Bibliographic Details
| Title: |
Improved ACE-POCS-Based Algorithm for PAPR Reduction in OFDM Systems. |
| Authors: |
Zhang, Xiuyan1 xyzhang_113@163.com, Tao, Guobin1 tgbdqpi@163.com |
| Source: |
IAENG International Journal of Computer Science. May2026, Vol. 53 Issue 5, p1637-1649. 13p. |
| Subjects: |
Orthogonal frequency division multiplexing, Least squares, Algorithms, Signal processing, Optimization algorithms, Bit error rate |
| Abstract: |
This study proposes an innovative algorithm that integrates the least-squares (LS) estimation method into the traditional ACE-POCS framework, named the least-squares active constellation extension projected onto convex sets (LS-ACE-POCS). The main objective of this work is to address the detrimental effect of the high peak-to-average power ratio (PAPR) in orthogonal frequency-division multiplexing (OFDM) systems. To this end, the proposed algorithm employs the LS estimation method to compute an optimal scaling factor, which is multiplied by the peak-clipped signal to generate a new output signal. The proposed algorithm is validated by comparing its performance after a single iteration with that of the conventional ACE-POCS algorithm after ten iterations, with the aim of demonstrating improved convergence speed and computational efficiency under equal processing conditions. The simulation results demonstrate that, at a threshold of 1.923, a CCDF of 10-4, with 512 subcarriers and QPSK modulation, the proposed LS-ACE-POCS algorithm significantly outperforms the conventional ACE-POCS algorithm in terms of PAPR reduction. Specifically, the PAPR achieved by the proposed algorithm after one iteration is 0.42 dB lower than that achieved by the traditional algorithm after ten iterations. In addition, the bit error rate (BER) performance of the proposed algorithm also shows a modest improvement. Thus, the LS-ACE-POCS algorithm exhibits strong performance in both PAPR reduction and BER, while featuring substantially lower computational complexity, thereby reducing overall system complexity. [ABSTRACT FROM AUTHOR] |
|
Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |