Path-compatible pruned convolutional (PCPC) codes

Chung-Hsuan Wang; Chi Chao Chao

doi:10.1109/26.983318

Path-compatible pruned convolutional (PCPC) codes

Chung-Hsuan Wang^*, Chi Chao Chao

^*Corresponding author for this work

Institute of Communications Engineering

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

Path pruning, a new coding concept to achieve free distance enlargement for convolutional codes, is proposed in this paper. Through path pruning, every convolutional code can be used for unequal error protection (UEP), no matter whether it is originally a UEP Code. To avoid undesired path discontinuity and reduce possible path distance loss, a cascaded implementation together with a path-compatible criterion is proposed, under which path-compatible pruned convolutional (PCPC) codes are constructed. Necessary and sufficient conditions are also derived for a subclass of PCPC codes whose decoding can be dune by a single decoder for the parent code. Finally, some PCPC codes with good UEP capabilities found by computer search are given.

Original language	English
Pages (from-to)	213-224
Number of pages	12
Journal	IEEE Transactions on Communications
Volume	50
Issue number	2
DOIs	https://doi.org/10.1109/26.983318
State	Published - 1 Feb 2002

Keywords

Convolutional codes
Free distance
Path pruning
Single-trellis decoding
Unequal error protection

Access to Document

10.1109/26.983318

Cite this

@article{3e486a849b654c0a8f5089f925cc0479,

title = "Path-compatible pruned convolutional (PCPC) codes",

abstract = "Path pruning, a new coding concept to achieve free distance enlargement for convolutional codes, is proposed in this paper. Through path pruning, every convolutional code can be used for unequal error protection (UEP), no matter whether it is originally a UEP Code. To avoid undesired path discontinuity and reduce possible path distance loss, a cascaded implementation together with a path-compatible criterion is proposed, under which path-compatible pruned convolutional (PCPC) codes are constructed. Necessary and sufficient conditions are also derived for a subclass of PCPC codes whose decoding can be dune by a single decoder for the parent code. Finally, some PCPC codes with good UEP capabilities found by computer search are given.",

keywords = "Convolutional codes, Free distance, Path pruning, Single-trellis decoding, Unequal error protection",

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

year = "2002",

month = feb,

day = "1",

doi = "10.1109/26.983318",

language = "English",

volume = "50",

pages = "213--224",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

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

number = "2",

}

TY - JOUR

T1 - Path-compatible pruned convolutional (PCPC) codes

AU - Wang, Chung-Hsuan

AU - Chao, Chi Chao

PY - 2002/2/1

Y1 - 2002/2/1

N2 - Path pruning, a new coding concept to achieve free distance enlargement for convolutional codes, is proposed in this paper. Through path pruning, every convolutional code can be used for unequal error protection (UEP), no matter whether it is originally a UEP Code. To avoid undesired path discontinuity and reduce possible path distance loss, a cascaded implementation together with a path-compatible criterion is proposed, under which path-compatible pruned convolutional (PCPC) codes are constructed. Necessary and sufficient conditions are also derived for a subclass of PCPC codes whose decoding can be dune by a single decoder for the parent code. Finally, some PCPC codes with good UEP capabilities found by computer search are given.

AB - Path pruning, a new coding concept to achieve free distance enlargement for convolutional codes, is proposed in this paper. Through path pruning, every convolutional code can be used for unequal error protection (UEP), no matter whether it is originally a UEP Code. To avoid undesired path discontinuity and reduce possible path distance loss, a cascaded implementation together with a path-compatible criterion is proposed, under which path-compatible pruned convolutional (PCPC) codes are constructed. Necessary and sufficient conditions are also derived for a subclass of PCPC codes whose decoding can be dune by a single decoder for the parent code. Finally, some PCPC codes with good UEP capabilities found by computer search are given.

KW - Convolutional codes

KW - Free distance

KW - Path pruning

KW - Single-trellis decoding

KW - Unequal error protection

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

U2 - 10.1109/26.983318

DO - 10.1109/26.983318

M3 - Article

AN - SCOPUS:0036474674

SN - 0090-6778

VL - 50

SP - 213

EP - 224

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 2

ER -

Path-compatible pruned convolutional (PCPC) codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this