A new weighting factor of PTS OFDM with low complexity for PAPR reduction

A major drawback of partial transmit sequence (PTS) method is its higher computation complexity due to the necessity of larger number of inverse fast Fourier transforms (IFFT). The PTS method with low computation complexity, called decomposition PTS sub-blocking was proposed which employs the radix-r inverse fast Fourier transform (IFFT) for the signals at the middle stages of an N-point radix-r IFFT and decimation in frequency (DIF) domain. This method (DIF-IFFT) can reduce the computation complexity relatively while providing PAPR reduction similar to other PTS techniques. On the other hand, PTS method can improve PAPR reduction performance very well as increasing a number of weighting factors and clusters. However, the size of side information proportionally increases as increasing the number of weighting factors or/and clutters, which are required to inform the side information to the receiver for recovering the original data. In this paper, we propose the new weighting factor technique in conjunction with D-PTS sub-blocking technique which can improve both the PAPR performance and computation complexity without any increasing of side information.