The technique of partial transmit sequences (PTS) is effective in reducing the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the conventional PTS (CPTS) scheme has high computation complexity because it needs several inverse fast Fourier transform (IFFT) units and an optimization process to find the candidate signal with the lowest PAPR. In this paper, we propose a new low-complexity PTS scheme for OFDM systems, in which a hybrid subblock partition method (SPM) is used to reduce the complexity that results from the IFFT computations and the optimization process. Also, the PAPR reduction performance of the proposed PTS scheme is further enhanced by multiplying a selected subblock with a predefined phase rotation vector to form a new subblock. The time-domain signal of the new subblock can be obtained simply by performing a circularly-shift-left operation on the IFFT output of the selected subblock. Computer simulations show that the proposed PTS scheme achieves a PAPR reduction performance close to that of the CPTS scheme with the pseudo-random SPM, but with much lower computation complexity.
Sheng-Ju KU
Tatung University
Yuan OUYANG
Chang Gung University
Chiachi HUANG
Yuan Ze University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sheng-Ju KU, Yuan OUYANG, Chiachi HUANG, "A Low-Complexity PTS Scheme with the Hybrid Subblock Partition Method for PAPR Reduction in OFDM Systems" in IEICE TRANSACTIONS on Communications,
vol. E98-B, no. 11, pp. 2341-2347, November 2015, doi: 10.1587/transcom.E98.B.2341.
Abstract: The technique of partial transmit sequences (PTS) is effective in reducing the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the conventional PTS (CPTS) scheme has high computation complexity because it needs several inverse fast Fourier transform (IFFT) units and an optimization process to find the candidate signal with the lowest PAPR. In this paper, we propose a new low-complexity PTS scheme for OFDM systems, in which a hybrid subblock partition method (SPM) is used to reduce the complexity that results from the IFFT computations and the optimization process. Also, the PAPR reduction performance of the proposed PTS scheme is further enhanced by multiplying a selected subblock with a predefined phase rotation vector to form a new subblock. The time-domain signal of the new subblock can be obtained simply by performing a circularly-shift-left operation on the IFFT output of the selected subblock. Computer simulations show that the proposed PTS scheme achieves a PAPR reduction performance close to that of the CPTS scheme with the pseudo-random SPM, but with much lower computation complexity.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.2341/_p
Copy
@ARTICLE{e98-b_11_2341,
author={Sheng-Ju KU, Yuan OUYANG, Chiachi HUANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Low-Complexity PTS Scheme with the Hybrid Subblock Partition Method for PAPR Reduction in OFDM Systems},
year={2015},
volume={E98-B},
number={11},
pages={2341-2347},
abstract={The technique of partial transmit sequences (PTS) is effective in reducing the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the conventional PTS (CPTS) scheme has high computation complexity because it needs several inverse fast Fourier transform (IFFT) units and an optimization process to find the candidate signal with the lowest PAPR. In this paper, we propose a new low-complexity PTS scheme for OFDM systems, in which a hybrid subblock partition method (SPM) is used to reduce the complexity that results from the IFFT computations and the optimization process. Also, the PAPR reduction performance of the proposed PTS scheme is further enhanced by multiplying a selected subblock with a predefined phase rotation vector to form a new subblock. The time-domain signal of the new subblock can be obtained simply by performing a circularly-shift-left operation on the IFFT output of the selected subblock. Computer simulations show that the proposed PTS scheme achieves a PAPR reduction performance close to that of the CPTS scheme with the pseudo-random SPM, but with much lower computation complexity.},
keywords={},
doi={10.1587/transcom.E98.B.2341},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - A Low-Complexity PTS Scheme with the Hybrid Subblock Partition Method for PAPR Reduction in OFDM Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 2341
EP - 2347
AU - Sheng-Ju KU
AU - Yuan OUYANG
AU - Chiachi HUANG
PY - 2015
DO - 10.1587/transcom.E98.B.2341
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2015
AB - The technique of partial transmit sequences (PTS) is effective in reducing the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the conventional PTS (CPTS) scheme has high computation complexity because it needs several inverse fast Fourier transform (IFFT) units and an optimization process to find the candidate signal with the lowest PAPR. In this paper, we propose a new low-complexity PTS scheme for OFDM systems, in which a hybrid subblock partition method (SPM) is used to reduce the complexity that results from the IFFT computations and the optimization process. Also, the PAPR reduction performance of the proposed PTS scheme is further enhanced by multiplying a selected subblock with a predefined phase rotation vector to form a new subblock. The time-domain signal of the new subblock can be obtained simply by performing a circularly-shift-left operation on the IFFT output of the selected subblock. Computer simulations show that the proposed PTS scheme achieves a PAPR reduction performance close to that of the CPTS scheme with the pseudo-random SPM, but with much lower computation complexity.
ER -