The search functionality is under construction.

The search functionality is under construction.

Errata[Uploaded on September 1,2008]

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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.7 pp.1689-1696

- Publication Date
- 2008/07/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1093/ietfec/e91-a.7.1689

- Type of Manuscript
- PAPER

- Category
- Digital Signal Processing

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

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

Copy

@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},}

Copy

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 -