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
A multiplexação por divisão de frequência ortogonal (OFDM) é uma técnica de transmissão atraente para sistemas de comunicação de alta taxa de bits. Uma grande desvantagem do OFDM é a alta relação de potência pico-média (PAPR) do sinal transmitido. Este estudo apresenta um esquema OFDM de mapeamento selecionado de baixa complexidade (SLM) baseado na modelagem de constelação por transformada discreta de Fourier (DFT). O algoritmo de modelagem de constelação baseado em DFT aplicado com esquema SLM convencional geralmente requer um banco de matrizes de modelagem DFT para gerar sequências de constelação de baixa correlação e um banco de transformadas rápidas inversas de Fourier (IFFTs) para gerar um conjunto de sinais de transmissão candidatos, e esse processo geralmente resulta em alta complexidade computacional. Portanto, um algoritmo de matriz esparsa com baixa complexidade é proposto para substituir os blocos IFFT e os blocos de modelagem DFT no esquema SLM de modelagem de constelação DFT proposto. Ao utilizar a matriz esparsa proposta, o sinal de transmissão candidato com o menor PAPR pode ser alcançado com menor complexidade do que o esquema SLM convencional. A análise de complexidade do algoritmo proposto mostra uma grande melhoria na redução do número de multiplicações. Além disso, esta nova técnica de baixa complexidade oferece um PAPR significativamente inferior ao do SLM convencional, sem qualquer perda em termos de energia e eficiência espectral.
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.
Copiar
Chua-Yun HSU, Hsin-Chieh CHAO, "Novel SLM Scheme with Low-Complexity for PAPR Reduction in OFDM System" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 7, pp. 1689-1696, July 2008, doi: 10.1093/ietfec/e91-a.7.1689.
Abstract: Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This study introduces a low-complexity selected mapping (SLM) OFDM scheme based on discrete Fourier transform (DFT) constellation-shaping. The DFT-based constellation-shaping algorithm applied with conventional SLM scheme usually requires a bank of DFT-shaping matrices to generate low-correlation constellation sequences and a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this process usually results in high computational complexity. Therefore, a sparse matrix algorithm with low-complexity is proposed to replace the IFFT blocks and the DFT-shaping blocks in the proposed DFT constellation-shaping SLM scheme. By using the proposed sparse matrix, the candidate transmission signal with the lowest PAPR can be achieved with lower complexity than that of the conventional SLM scheme. The complexity analysis of the proposed algorithm shows great an improvement in the reduction of the number of multiplications. Moreover, this new low-complexity technique offers a PAPR that is significantly lower than that of the conventional SLM without any loss in terms of energy and spectral efficiency.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.7.1689/_p
Copiar
@ARTICLE{e91-a_7_1689,
author={Chua-Yun HSU, Hsin-Chieh CHAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Novel SLM Scheme with Low-Complexity for PAPR Reduction in OFDM System},
year={2008},
volume={E91-A},
number={7},
pages={1689-1696},
abstract={Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This study introduces a low-complexity selected mapping (SLM) OFDM scheme based on discrete Fourier transform (DFT) constellation-shaping. The DFT-based constellation-shaping algorithm applied with conventional SLM scheme usually requires a bank of DFT-shaping matrices to generate low-correlation constellation sequences and a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this process usually results in high computational complexity. Therefore, a sparse matrix algorithm with low-complexity is proposed to replace the IFFT blocks and the DFT-shaping blocks in the proposed DFT constellation-shaping SLM scheme. By using the proposed sparse matrix, the candidate transmission signal with the lowest PAPR can be achieved with lower complexity than that of the conventional SLM scheme. The complexity analysis of the proposed algorithm shows great an improvement in the reduction of the number of multiplications. Moreover, this new low-complexity technique offers a PAPR that is significantly lower than that of the conventional SLM without any loss in terms of energy and spectral efficiency.},
keywords={},
doi={10.1093/ietfec/e91-a.7.1689},
ISSN={1745-1337},
month={July},}
Copiar
TY - JOUR
TI - Novel SLM Scheme with Low-Complexity for PAPR Reduction in OFDM System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1689
EP - 1696
AU - Chua-Yun HSU
AU - Hsin-Chieh CHAO
PY - 2008
DO - 10.1093/ietfec/e91-a.7.1689
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2008
AB - Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This study introduces a low-complexity selected mapping (SLM) OFDM scheme based on discrete Fourier transform (DFT) constellation-shaping. The DFT-based constellation-shaping algorithm applied with conventional SLM scheme usually requires a bank of DFT-shaping matrices to generate low-correlation constellation sequences and a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this process usually results in high computational complexity. Therefore, a sparse matrix algorithm with low-complexity is proposed to replace the IFFT blocks and the DFT-shaping blocks in the proposed DFT constellation-shaping SLM scheme. By using the proposed sparse matrix, the candidate transmission signal with the lowest PAPR can be achieved with lower complexity than that of the conventional SLM scheme. The complexity analysis of the proposed algorithm shows great an improvement in the reduction of the number of multiplications. Moreover, this new low-complexity technique offers a PAPR that is significantly lower than that of the conventional SLM without any loss in terms of energy and spectral efficiency.
ER -