A low complexity PTS algorithm for PAPR reduction in OFDM system based on hamming distance

Author

Shuyan Ding ; Shibao Li ; Jianhang Liu ; Haiyan Wang ; Zhaozhi Gu ; Lihong Gu

Author_Institution

Coll. of Comput. & Commun. Eng., China Univ. of Pet.(East China), Qingdao, China

fYear

2014

fDate

24-26 Sept. 2014

Firstpage

499

Lastpage

502

Abstract

PTS(Partial transmit sequence) is a valid and distortionless technique used to reduce the PAPR(peak-to-average power ratio) in OFDM(orthogonal frequency division multiplexing)system. However, this algorithm has a high computational complexity. In this paper, to balance the performance and the computation complexity, we describe a simplified scheme for finding the best scrambling sequences based on hamming-tabu-search to achieve the reduction of computational complexity. Algorithm analysis and simulation results show that, as compared with PTS method, the proposed scheme could be implemented with lower complexity while at no loss of PAPR performance.

Keywords

Hamming codes; OFDM modulation; computational complexity; search problems; Hamming distance; Hamming-tabu-search; OFDM system; PAPR performance; PAPR reduction; PTS algorithm; PTS method; computational complexity; orthogonal frequency division multiplexing; partial transmit sequence; peak-to-average power ratio; Algorithm design and analysis; Computational complexity; Hamming distance; Partial transmit sequences; Peak to average power ratio; Hamming Dsitance; orthogonal frequency division multiplexing; partial transmit sequence; peak-to-average power ratio;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Information Technologies (ISCIT), 2014 14th International Symposium on

Conference_Location

Incheon

Type

conf

DOI

10.1109/ISCIT.2014.7011963

Filename

7011963