Title :
A PTS OFDM scheme with low computational complexity
Author :
Lim, Dae-Woon ; Heo, Seok-Joong ; No, Jong-Seon ; Chung, Habong
Author_Institution :
Sch. of Electr. Eng. & Comput. Sciecnce, Seoul Nat. Univ.
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 l 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 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
Keywords :
OFDM modulation; computational complexity; fast Fourier transforms; PTS OFDM scheme; computational complexity; intermediate signal sequence; inverse fast Fourier transform; orthogonal frequency division multiplexing; partial transmit sequence; peak to average power ratio; Bit error rate; Communication standards; Computational complexity; Fast Fourier transforms; Nonlinear distortion; OFDM modulation; Partial transmit sequences; Peak to average power ratio; Redundancy; Signal generators;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523518
