http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Hikaru Kawasaki,Takahiro Matsui,Masaya Ohta,Katsumi Yamashita 대한전자공학회 2017 IEIE Transactions on Smart Processing & Computing Vol.6 No.2
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 highorder 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.
Hikaru Kawasaki,Zhiheng Zhou,Masaya Ohta,Katsumi Yamashita 대한전자공학회 2017 IEIE Transactions on Smart Processing & Computing Vol.6 No.5
N-continuous symbol padding orthogonal frequency division multiplexing is a modulation technique that achieves a lower-sidelobe transmission signal with precoding data symbols. However, precoding requires wide dynamic range arithmetic. This study considers two decompositions of the precoder matrix for a low-end field-programmable gate array (FPGA) without digital signal processing blocks. Results of numerical experiments and a test design confirm that singular value decomposition is suitable for FPGA implementation.