Low Complexity IFFT Implementation Architecture for PTS-based OFDM System

• Main Authors: Feng-Tz Chang, 張丰慈
• Other Authors: Jyh-Horng Wen
• Format: Others
• Language: en_US
• Online Access: http://ndltd.ncl.edu.tw/handle/08455677642824692791

碩士 === 國立中正大學 === 通訊工程研究所 === 97 === In this paper, the complexity reduction of partial transmit sequence (PTS) scheme which is used for PAPR reduction in OFDM system by reducing the complexity in the IFFT architecture is investigated. In the IFFT architecture of PTS OFDM scheme, much calculation is the addition and the multiplication of zero, which is obviously unnecessary. Eliminating the calculation from the architecture can efficiently reduce the computational complexity without any effect to the resulting signal or the performance of PAPR reduction. In this word, two new PTS OFDM scheme are proposed in chapter 3 and chapter 4. In chapter 3, after eliminating the addition and multiplication of zeros, the IFFT can be reduce to a smaller size of IFFT and two other transform. Thus, the computational complexity can be efficiently reduced. In chapter 4, with the similar concept, after eliminating the unnecessary calculation, we can combine all the IFFTs of branches into just an IFFT architecture by using decimate-in-frequency (DIF) IFFT architecture. Thus, the computational complexity can be reduce to 1/M times of the complexity, which M is the number of the branches.