Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2016
Session Number:M3-H
Session:
Number:M3-H-2
Computational Complexity Reduction of Orthogonal Precoding of N-continuous OFDM
Hikaru Kawasaki, Takahiro Matsui, Masaya Ohta, Katsumi Yamashita ,
pp.249-252
Publication Date:2016/7/10
Online ISSN:2188-5079
Summary:
N-continuous OFDM is a precoding method for sidelobe suppression of orthogonal frequency division multiplexing (OFDM) signals and is to seamlessly connect OFDM symbols up to the high order derivative for sidelobe suppression, which is suitable for suppressing out-of-band radiation. However, it degrade the error rate severely as increasing the continuous derivative order. Orthogonal precoding of N-continuous OFDM has both a sidelobe suppression performance and an ideal error rate; however, it requires a very large computational complexity for precoding and decoding. This paper proposes a matrix decomposition of the large-sized matrix in the orthogonal precoding of N-continuous OFDM to reduce the computational complexity. Numerical experiments show that the proposed method can drastically reduce the computational complexity.