Convolutional codes for peak-to-average power ratio reduction in OFDM

Chao Yu Chen; Chung Hsuan Wang; Chi Chao Chao

Convolutional codes for peak-to-average power ratio reduction in OFDM

Chao Yu Chen, Chung Hsuan Wang, Chi Chao Chao

Department of Engineering Science

Research output: Contribution to journal › Conference article › peer-review

2 Citations (Scopus)

Abstract

One of the disadvantages of orthogonal frequency division multiplexing (OFDM) system is that OFDM signals may have high peak-to-average power ratio (PAPR). Almost all the previously proposed coding approaches dealing with this problem employ block codes. In this paper, we propose terminated convolutional codes with offset for PAPR reduction. The constructed convolutional codes, which can be easily decoded by using the Viterbi algorithm, have low PAPR and acceptable code rates.

Original language	English
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
Publication status	Published - 2003 Oct 20
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: 2003 Jun 29 → 2003 Jul 4

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

Fingerprint Dive into the research topics of 'Convolutional codes for peak-to-average power ratio reduction in OFDM'. Together they form a unique fingerprint.

Cite this

@article{f462d6b17b1446bb8829f3457102fe23,

title = "Convolutional codes for peak-to-average power ratio reduction in OFDM",

abstract = "One of the disadvantages of orthogonal frequency division multiplexing (OFDM) system is that OFDM signals may have high peak-to-average power ratio (PAPR). Almost all the previously proposed coding approaches dealing with this problem employ block codes. In this paper, we propose terminated convolutional codes with offset for PAPR reduction. The constructed convolutional codes, which can be easily decoded by using the Viterbi algorithm, have low PAPR and acceptable code rates.",

author = "Chen, {Chao Yu} and Wang, {Chung Hsuan} and Chao, {Chi Chao}",

year = "2003",

month = oct,

day = "20",

language = "English",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Convolutional codes for peak-to-average power ratio reduction in OFDM

AU - Chen, Chao Yu

AU - Wang, Chung Hsuan

AU - Chao, Chi Chao

PY - 2003/10/20

Y1 - 2003/10/20

N2 - One of the disadvantages of orthogonal frequency division multiplexing (OFDM) system is that OFDM signals may have high peak-to-average power ratio (PAPR). Almost all the previously proposed coding approaches dealing with this problem employ block codes. In this paper, we propose terminated convolutional codes with offset for PAPR reduction. The constructed convolutional codes, which can be easily decoded by using the Viterbi algorithm, have low PAPR and acceptable code rates.

AB - One of the disadvantages of orthogonal frequency division multiplexing (OFDM) system is that OFDM signals may have high peak-to-average power ratio (PAPR). Almost all the previously proposed coding approaches dealing with this problem employ block codes. In this paper, we propose terminated convolutional codes with offset for PAPR reduction. The constructed convolutional codes, which can be easily decoded by using the Viterbi algorithm, have low PAPR and acceptable code rates.

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

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

M3 - Conference article

AN - SCOPUS:0141904968

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -