A new partitioning scheme for PTS technique to improve the PAPR performance in OFDM systems

A high peak-to-average-power ratio (PAPR) is the primary drawback faced by the orthogonal frequency division multiplexing (OFDM) systems in the practical applications. Meanwhile, Partial Transmit Sequence (PTS) is regarded as one of the efficient PAPR reduction techniques in OFDM systems. PTS techni...

詳細記述

保存先:
書誌詳細
主要な著者: Al-Jawhar, Yasir Amer, Ramli, Khairun N., S. Ahmed, Mustafa, Abdulhasan, Raed Abdulkareem, Farhood, Hussein M., Alwan, Mohammed H.
フォーマット: 論文
言語:English
出版事項: Taiwan Association of Engineering and Technology Innovation 2018
主題:
オンライン・アクセス:http://eprints.uthm.edu.my/2529/1/AJ%202019%20%2834%29.pdf
http://eprints.uthm.edu.my/2529/
https://ojs.imeti.org/index.php/IJETI/article/view/1875
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
その他の書誌記述
要約:A high peak-to-average-power ratio (PAPR) is the primary drawback faced by the orthogonal frequency division multiplexing (OFDM) systems in the practical applications. Meanwhile, Partial Transmit Sequence (PTS) is regarded as one of the efficient PAPR reduction techniques in OFDM systems. PTS technique depends on partitioning the input data into the several subblocks in the frequency-domain and weighting these subblocks by a set of phase factors in the time-domain. As the result, there are three common types of subblocks partitioning schemes have been adopted in the PTS technique, interleaving scheme, adjacent scheme, and pseudo-random scheme. Each one of the conventional partitioning schemes has PAPR reduction performance and a computational complexity level different from others. In this paper, a new subblock partitioning scheme named terminals exchanging segmentation (TE-PTS) scheme has been proposed to improve the PAPR performance in PTS technique better than that of the interleaving scheme. The simulation results and the numerical calculations indicate that the PAPR reduction capacity of the proposed scheme is superior to that of interleaving scheme without increasing the computational complexity.