A New PTS OFDM Scheme with Low Complexity for PAPR Reduction 


Vol. 31,  No. 9, pp. 914-920, Sep.  2006


PDF Full-Text
  Abstract

In this paper, we introduce a new partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM) scheme with low computational complexity. In the proposed scheme, 2ⁿ-point inverse fast Fourier transform (IFFT) is divided into two parts. An input symbol sequence is partially transformed using the first l stages of IFFT into an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences. Then, the remaining n-l stages of IFFT are applied to each of the intermediate signal subsequences and the resulting signal subsequences are summed after being multiplied by each member of a set of W rotating vectors to yield W distinct OFDM signal sequences. The one with the lowest peak to average power ratio (PAPR) among these OFDM signal sequences is selected for transmission. The new PTS OFDM scheme reduces the computational complexity while it shows almost the same performance of PAPR reduction as that of the conventional PTS OFDM scheme.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

D. Lim, S. Heo, J. No, H. Chung, "A New PTS OFDM Scheme with Low Complexity for PAPR Reduction," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 914-920, 2006. DOI: .

[ACM Style]

Dae-Woon Lim, Seok-Joong Heo, Jong-Seon No, and Habong Chung. 2006. A New PTS OFDM Scheme with Low Complexity for PAPR Reduction. The Journal of Korean Institute of Communications and Information Sciences, 31, 9, (2006), 914-920. DOI: .

[KICS Style]

Dae-Woon Lim, Seok-Joong Heo, Jong-Seon No, Habong Chung, "A New PTS OFDM Scheme with Low Complexity for PAPR Reduction," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 9, pp. 914-920, 9. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880