Name
Abstract | ||
|---|---|---|
In this paper, a low complexity peak-to-average power ratio (PAPR) reduction scheme is proposed for OFDM systems. By utilizing the properties of Discrete Fourier Transform (DFT), the proposed scheme divides the OFDM symbol into two disjoint subblocks in time domain, and generates a set of candidate signals by cyclically shifting one of the subblocks and sums them up. From the candidate signals, the one with the minimum PAPR is selected to be transmitted. Compared with selected mapping (SLM) and partial transmitted sequences (PTS), the proposed method needs only one IFFT and no additional complex multiplication operation, which means that the computational complexity of this method is significantly lower than SLM and PTS. When the number of candidate signals is limited, simulation results show that the PAPR performance of the proposed method is slightly worse than that of SLM, but outperforms PTS. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ChinaCom.2011.6158130 | CHINACOM |
Keywords | Field | DocType |
PAPR, OFDM, SLM, PTS | Time domain,Discrete mathematics,Slightly worse,Disjoint sets,Power ratio,Algorithm,Discrete Fourier transform,Mathematics,Complex multiplication,Orthogonal frequency-division multiplexing,Computational complexity theory | Conference |
Volume | Issue | Citations |
null | null | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xing Ouyang | 1 | 20 | 3.56 |
| Jiyu Jin | 2 | 5 | 5.58 |
| ZhiSen Wang | 3 | 3 | 2.09 |