The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Tempahan nada (TR) telah dicadangkan untuk pengurangan kuasa puncak kepada purata (PAPR) dalam sistem multicarrier jalur asas sebenar [1]. Dalam teknik ini, isyarat pengurangan puncak dikira dengan pengoptimuman melalui pengaturcaraan linear (LP). Seperti yang ditunjukkan dalam [1], kerumitan pengiraan pengoptimuman LP sebahagian besarnya ditentukan oleh kerumitan algoritma transformasi Fourier pantas songsang (IFFT). Dalam makalah ini, kami menggunakan submatriks transformasi Fourier pantas songsang (IFFT) untuk mengurangkan bilangan kekangan dalam pengoptimuman berasaskan LP. Kami menunjukkan bahawa pengurangan kerumitan yang ketara boleh dicapai berbanding dengan algoritma TR konvensional, dengan pengurangan PAPR yang serupa.
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.
Salinan
Abolfazl GHASSEMI, T. Aaron GULLIVER, "Reduced Constraint Set Linear Program for Tone Reservation in Multicarrier Modulation" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 6, pp. 2231-2234, June 2009, doi: 10.1587/transcom.E92.B.2231.
Abstract: Tone reservation (TR) has been proposed for peak to average power reduction (PAPR) in real-baseband multicarrier systems [1]. In this technique, the peak reduction signal is computed by optimization via linear programming (LP). As shown in [1], the computational complexity of the LP optimization is largely determined by the complexity of the inverse fast Fourier transform (IFFT) algorithm. In this paper, we use submatrices of the inverse fast Fourier transform (IFFT) to reduce the number of constraints in the LP-based optimization. We show that a significant complexity reduction can be achieved compared to the conventional TR algorithm, with similar PAPR reduction.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2231/_p
Salinan
@ARTICLE{e92-b_6_2231,
author={Abolfazl GHASSEMI, T. Aaron GULLIVER, },
journal={IEICE TRANSACTIONS on Communications},
title={Reduced Constraint Set Linear Program for Tone Reservation in Multicarrier Modulation},
year={2009},
volume={E92-B},
number={6},
pages={2231-2234},
abstract={Tone reservation (TR) has been proposed for peak to average power reduction (PAPR) in real-baseband multicarrier systems [1]. In this technique, the peak reduction signal is computed by optimization via linear programming (LP). As shown in [1], the computational complexity of the LP optimization is largely determined by the complexity of the inverse fast Fourier transform (IFFT) algorithm. In this paper, we use submatrices of the inverse fast Fourier transform (IFFT) to reduce the number of constraints in the LP-based optimization. We show that a significant complexity reduction can be achieved compared to the conventional TR algorithm, with similar PAPR reduction.},
keywords={},
doi={10.1587/transcom.E92.B.2231},
ISSN={1745-1345},
month={June},}
Salinan
TY - JOUR
TI - Reduced Constraint Set Linear Program for Tone Reservation in Multicarrier Modulation
T2 - IEICE TRANSACTIONS on Communications
SP - 2231
EP - 2234
AU - Abolfazl GHASSEMI
AU - T. Aaron GULLIVER
PY - 2009
DO - 10.1587/transcom.E92.B.2231
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2009
AB - Tone reservation (TR) has been proposed for peak to average power reduction (PAPR) in real-baseband multicarrier systems [1]. In this technique, the peak reduction signal is computed by optimization via linear programming (LP). As shown in [1], the computational complexity of the LP optimization is largely determined by the complexity of the inverse fast Fourier transform (IFFT) algorithm. In this paper, we use submatrices of the inverse fast Fourier transform (IFFT) to reduce the number of constraints in the LP-based optimization. We show that a significant complexity reduction can be achieved compared to the conventional TR algorithm, with similar PAPR reduction.
ER -