A Computationally Efficient Tree-PTS Technique for PAPR Reduction of OFDM Signals
被引:4
作者:
Lee, Byung Moo
论文数: 0引用数: 0
h-index: 0
机构:
KT, Cent R&D Lab, Seoul 137792, South KoreaKwangwoon Univ, Dept Elect Engn, Seoul 139701, South Korea
Lee, Byung Moo
[2
]
de Figueiredo, Rui J. P.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Calif Irvine, Lab Intelligent Signal Proc & Commun, Henry Samueli Sch Engn, Irvine, CA 92697 USAKwangwoon Univ, Dept Elect Engn, Seoul 139701, South Korea
de Figueiredo, Rui J. P.
[3
]
Kim, Youngok
论文数: 0引用数: 0
h-index: 0
机构:
Kwangwoon Univ, Dept Elect Engn, Seoul 139701, South KoreaKwangwoon Univ, Dept Elect Engn, Seoul 139701, South Korea
Kim, Youngok
[1
]
机构:
[1] Kwangwoon Univ, Dept Elect Engn, Seoul 139701, South Korea
[2] KT, Cent R&D Lab, Seoul 137792, South Korea
[3] Univ Calif Irvine, Lab Intelligent Signal Proc & Commun, Henry Samueli Sch Engn, Irvine, CA 92697 USA
Peak-to-average-power ratio (PAPR);
Partial transmit sequence (PTS);
OFDM;
AVERAGE POWER-RATIO;
PARTIAL TRANSMIT SEQUENCES;
CONSTELLATION EXTENSION;
SYSTEMS;
D O I:
10.1007/s11277-010-0062-0
中图分类号:
TN [电子技术、通信技术];
学科分类号:
0809 ;
摘要:
The high peak-to-average power ratio (PAPR) of time domain signals has been a major problem in orthogonal frequency division multiplexing (OFDM) systems, and thus various PAPR reduction algorithms have been introduced. Partial transmit sequence (PTS) is one of the most attractive solutions because of its good performance without distortion. However, it is considered as an impractical solution for the realization of high-speed data transmission systems due to its high computational complexity. In this paper, a novel PAPR reduction algorithm based on a tree-structured searching technique is proposed to reduce the PAPR with low complexity. In the proposed scheme, the computational complexity of searching process is decreased by adjusting the size of tree with two parameters, width and depth, while preserving good performance. The simulation results show that proposed scheme provides similar performance with optimum case with remarkably reduced computational complexity.