Low-Complexity PTS Schemes Using Dominant Time-Domain Samples in OFDM Systems
- Authors
- Cho, Young-Jeon; Kim, Kee-Hoon; Woo, Jun-Young; Lee, Kang-Seok; No, Jong-Seon; Shin, Dong-Joon
- Issue Date
- Jun-2017
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Low complexity; orthogonal frequency division multiplexing (OFDM); partial transmit sequence (PTS); peak-to-average power ratio (PAPR)
- Citation
- IEEE TRANSACTIONS ON BROADCASTING, v.63, no.2, pp.440 - 445
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON BROADCASTING
- Volume
- 63
- Number
- 2
- Start Page
- 440
- End Page
- 445
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/19648
- DOI
- 10.1109/TBC.2017.2662228
- ISSN
- 0018-9316
- Abstract
- Partial transmit sequence (PTS) is a probabilistic peak-to-average power ratio (PAPR) reduction scheme for orthogonal frequency division multiplexing (OFDM) signals, but it requires an exhaustive search for the one with the minimum PAPR over all alternative OFDM signal vectors. In order to reduce such computational complexity, it was proposed that the PAPR value of each alternative OFDM signal vector is approximately estimated by using dominant time-domain samples selected based on a simple metric. In this paper, two new effective metrics for selecting dominant time-domain samples are proposed for low-complexity PTS scheme. For further lowering the computational complexity, two low-complexity PTS schemes are proposed by sorting the dominant time-domain samples in decreasing order of their metric values. Simulation results confirm that compared with the conventional PTS scheme, the proposed PTS schemes show identical PAPR reduction performance with substantially reduced computational complexity.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.