A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems

Guoliang Chen, S. H. Song, Khaled Letaief

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Single carrier frequency division multiple access (SC-FDMA) has been receiving much attention as the uplink multiple access technology in the next generation communication systems due to its lower peak-to-average power ratio (PAPR) compared to OFDMA. However, it was shown that PAPR is still an issue for SCFDMA, especially with the localized subcarrier allocation (SC-LFDMA) scheme. The precoding method has been shown to be effective in reducing the peak power. However, the construction of the codewords is a nondeterministic polynomial-time hard (NP-hard) problem. In this paper, we first formulate the problem of PAPR reduction by precoding as a combinatorial problem, and then propose the semidefinite relaxation approach with which the problem can then be solved in polynomial time. It will be shown that the proposed scheme can efficiently reduce the peak power with much lower complexity. By taking the transmit power limit into consideration, we further demonstrate the existence of a tradeoff between the transmit power increase and the peak power reduction. Specifically, less stringent power constraint will lead to more significant PAPR reduction.

Original languageEnglish
Title of host publication2011 IEEE Wireless Communications and Networking Conference, WCNC 2011
PublisherIEEE Computer Society
Pages1358-1362
Number of pages5
ISBN (Print)9781612842547
DOIs
Publication statusPublished - 2011
Externally publishedYes

Fingerprint

Frequency division multiple access
Polynomials
Communication systems
communication system

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Chen, G., Song, S. H., & Letaief, K. (2011). A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems. In 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011 (pp. 1358-1362). [5779327] IEEE Computer Society. https://doi.org/10.1109/WCNC.2011.5779327

A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems. / Chen, Guoliang; Song, S. H.; Letaief, Khaled.

2011 IEEE Wireless Communications and Networking Conference, WCNC 2011. IEEE Computer Society, 2011. p. 1358-1362 5779327.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, G, Song, SH & Letaief, K 2011, A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems. in 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011., 5779327, IEEE Computer Society, pp. 1358-1362. https://doi.org/10.1109/WCNC.2011.5779327
Chen G, Song SH, Letaief K. A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems. In 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011. IEEE Computer Society. 2011. p. 1358-1362. 5779327 https://doi.org/10.1109/WCNC.2011.5779327
Chen, Guoliang ; Song, S. H. ; Letaief, Khaled. / A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems. 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011. IEEE Computer Society, 2011. pp. 1358-1362
@inproceedings{73f7e64912a3408a9c7ebd0bff4ee4ef,
title = "A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems",
abstract = "Single carrier frequency division multiple access (SC-FDMA) has been receiving much attention as the uplink multiple access technology in the next generation communication systems due to its lower peak-to-average power ratio (PAPR) compared to OFDMA. However, it was shown that PAPR is still an issue for SCFDMA, especially with the localized subcarrier allocation (SC-LFDMA) scheme. The precoding method has been shown to be effective in reducing the peak power. However, the construction of the codewords is a nondeterministic polynomial-time hard (NP-hard) problem. In this paper, we first formulate the problem of PAPR reduction by precoding as a combinatorial problem, and then propose the semidefinite relaxation approach with which the problem can then be solved in polynomial time. It will be shown that the proposed scheme can efficiently reduce the peak power with much lower complexity. By taking the transmit power limit into consideration, we further demonstrate the existence of a tradeoff between the transmit power increase and the peak power reduction. Specifically, less stringent power constraint will lead to more significant PAPR reduction.",
author = "Guoliang Chen and Song, {S. H.} and Khaled Letaief",
year = "2011",
doi = "10.1109/WCNC.2011.5779327",
language = "English",
isbn = "9781612842547",
pages = "1358--1362",
booktitle = "2011 IEEE Wireless Communications and Networking Conference, WCNC 2011",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - A low-complexity precoding scheme for PAPR reduction in SC-FDMA systems

AU - Chen, Guoliang

AU - Song, S. H.

AU - Letaief, Khaled

PY - 2011

Y1 - 2011

N2 - Single carrier frequency division multiple access (SC-FDMA) has been receiving much attention as the uplink multiple access technology in the next generation communication systems due to its lower peak-to-average power ratio (PAPR) compared to OFDMA. However, it was shown that PAPR is still an issue for SCFDMA, especially with the localized subcarrier allocation (SC-LFDMA) scheme. The precoding method has been shown to be effective in reducing the peak power. However, the construction of the codewords is a nondeterministic polynomial-time hard (NP-hard) problem. In this paper, we first formulate the problem of PAPR reduction by precoding as a combinatorial problem, and then propose the semidefinite relaxation approach with which the problem can then be solved in polynomial time. It will be shown that the proposed scheme can efficiently reduce the peak power with much lower complexity. By taking the transmit power limit into consideration, we further demonstrate the existence of a tradeoff between the transmit power increase and the peak power reduction. Specifically, less stringent power constraint will lead to more significant PAPR reduction.

AB - Single carrier frequency division multiple access (SC-FDMA) has been receiving much attention as the uplink multiple access technology in the next generation communication systems due to its lower peak-to-average power ratio (PAPR) compared to OFDMA. However, it was shown that PAPR is still an issue for SCFDMA, especially with the localized subcarrier allocation (SC-LFDMA) scheme. The precoding method has been shown to be effective in reducing the peak power. However, the construction of the codewords is a nondeterministic polynomial-time hard (NP-hard) problem. In this paper, we first formulate the problem of PAPR reduction by precoding as a combinatorial problem, and then propose the semidefinite relaxation approach with which the problem can then be solved in polynomial time. It will be shown that the proposed scheme can efficiently reduce the peak power with much lower complexity. By taking the transmit power limit into consideration, we further demonstrate the existence of a tradeoff between the transmit power increase and the peak power reduction. Specifically, less stringent power constraint will lead to more significant PAPR reduction.

UR - http://www.scopus.com/inward/record.url?scp=79959288625&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959288625&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2011.5779327

DO - 10.1109/WCNC.2011.5779327

M3 - Conference contribution

AN - SCOPUS:79959288625

SN - 9781612842547

SP - 1358

EP - 1362

BT - 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011

PB - IEEE Computer Society

ER -