2018
DOI: 10.4218/etrij.2018-0070
|View full text |Cite
|
Sign up to set email alerts
|

New low-complexity segmentation scheme for the partial transmit sequence technique for reducing the high PAPR value in OFDM systems

Abstract: Orthogonal frequency division multiplexing (OFDM) has been the overwhelmingly prevalent choice for high‐data‐rate systems due to its superior advantages compared with other modulation techniques. In contrast, a high peak‐to‐average‐power ratio (PAPR) is considered the fundamental obstacle in OFDM systems since it drives the system to suffer from in‐band distortion and out‐of‐band radiation. The partial transmit sequence (PTS) technique is viewed as one of several strategies that have been suggested to diminish… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
9

Relationship

4
5

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 31 publications
0
13
0
Order By: Relevance
“…In general, in multicarrier systems such as OFDM, the baseband signal is passed to the IFFT unit to modulate the subcarriers by the data symbol. Therefore, the OFDM signal is expressed as [27]:…”
Section: Papr Problemmentioning
confidence: 99%
“…In general, in multicarrier systems such as OFDM, the baseband signal is passed to the IFFT unit to modulate the subcarriers by the data symbol. Therefore, the OFDM signal is expressed as [27]:…”
Section: Papr Problemmentioning
confidence: 99%
“…There are various categories of subblock partitioning methods [31]- [34]. Among them, the three most common categories are adjacent, interleaving and random partitioning methods [25].…”
Section: Papr Reduction With Pts and Pts-as A Conventional Ptsmentioning
confidence: 99%
“…The computational complexity for finding the optimum phase factor This computational complexity is because of performing the phase rotation factors in the time-domain, and it rises exponentially with increment the number of the subblocks. The Cadd and Cmult operations can be expressed as [25] 1 add…”
Section: The Computational Complexity Of Ifft Performingmentioning
confidence: 99%