• 제목/요약/키워드: Computational complexity reduction (telecommunications, encoding, modulation, multiplexing)

검색결과 1건 처리시간 0.015초

Matrix Decomposition for Low Computational Complexity in Orthogonal Precoding of N-continuous Schemes for Sidelobe Suppression of OFDM Signals

  • Kawasaki, Hikaru;Matsui, Takahiro;Ohta, Masaya;Yamashita, Katsumi
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제6권2호
    • /
    • pp.117-123
    • /
    • 2017
  • N-continuous orthogonal frequency division multiplexing (OFDM) is a precoding method for sidelobe suppression of OFDM signals and seamlessly connects OFDM symbols up to the high-order derivative for sidelobe suppression, which is suitable for suppressing out-of-band radiation. However, it severely degrades the error rate as it increases the continuous derivative order. Two schemes for orthogonal precoding of N-continuous OFDM have been proposed to achieve an ideal error rate while maintaining sidelobe suppression performance; however, the large size of the precoder matrices in both schemes causes very high computational complexity for precoding and decoding. This paper proposes matrix decomposition of precoder matrices with a large size in the orthogonal precoding schemes in order to reduce computational complexity. Numerical experiments show that the proposed method can drastically reduce computational complexity without any performance degradation.