International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 85 - Number 9 |
Year of Publication: 2014 |
Authors: Prashant Pandey, Rajeev Tripathi |
10.5120/14868-3243 |
Prashant Pandey, Rajeev Tripathi . Computational Complexity Reduction of OFDM Signals by PTS with Alternate Optimized Recursive Phase Weighting (AO-RPW) Method. International Journal of Computer Applications. 85, 9 ( January 2014), 13-18. DOI=10.5120/14868-3243
Partial transmit sequences (PTS) is one of the most attractive schemes to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. However, the Optimal PTS (OPTS) scheme requires an exhaustive searching over all combinations of allowed phase factors. Consequently, the computational complexity increases exponentially with the number of the subblocks. Recursive phase weighting (RPW) technique is a novel method whose aim is to reduce computational complexity and achieve the same performance in PAPR reduction as compared to O-PTS. In this paper we have proposed a novel technique named as Alternate optimized Recursive phase weighting (AO-RPW) method. Theoretical analysis and simulation results show that , compared with O-PTS and PTS employing RPW, PTS with AO-RPW method reduces the computational complexity but at the cost of loss of performance for PAPR reduction.