A pts ofdm scheme with low computational complexity

Dae Woon Lim, Seok Joong Heo, Jong Seon No, Habong Chung

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

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, 2n - point inverse fast Fourier transform (IFFT) is divided into two parts. An input symbol sequence is partially transformed using the first - stages of IFFT to generate an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences. Then, the remaining _ - - 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 _ rotating vectors to yield _ 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.

Original languageEnglish
Article number1523518
JournalIEEE International Symposium on Information Theory - Proceedings
Volume2005-January
DOIs
StatePublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005

Fingerprint

Dive into the research topics of 'A pts ofdm scheme with low computational complexity'. Together they form a unique fingerprint.

Cite this