Improved ACE-POCS-Based Algorithm for PAPR Reduction in OFDM Systems.

Saved in:
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193482021
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Improved ACE-POCS-Based Algorithm for PAPR Reduction in OFDM Systems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhang%2C+Xiuyan%22">Zhang, Xiuyan</searchLink><relatesTo>1</relatesTo><i> xyzhang_113@163.com</i><br /><searchLink fieldCode="AR" term="%22Tao%2C+Guobin%22">Tao, Guobin</searchLink><relatesTo>1</relatesTo><i> tgbdqpi@163.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Computer+Science%22">IAENG International Journal of Computer Science</searchLink>. May2026, Vol. 53 Issue 5, p1637-1649. 13p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Orthogonal+frequency+division+multiplexing%22">Orthogonal frequency division multiplexing</searchLink><br /><searchLink fieldCode="DE" term="%22Least+squares%22">Least squares</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Signal+processing%22">Signal processing</searchLink><br /><searchLink fieldCode="DE" term="%22Optimization+algorithms%22">Optimization algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Bit+error+rate%22">Bit error rate</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193482021
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 1637
    Subjects:
      – SubjectFull: Orthogonal frequency division multiplexing
        Type: general
      – SubjectFull: Least squares
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Signal processing
        Type: general
      – SubjectFull: Optimization algorithms
        Type: general
      – SubjectFull: Bit error rate
        Type: general
    Titles:
      – TitleFull: Improved ACE-POCS-Based Algorithm for PAPR Reduction in OFDM Systems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhang, Xiuyan
      – PersonEntity:
          Name:
            NameFull: Tao, Guobin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 1819656X
          Numbering:
            – Type: volume
              Value: 53
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: IAENG International Journal of Computer Science
              Type: main
ResultId 1