New Decoding Techniques for Punctured Convolutional Codes

Pisit CHARN KEIT KONG; Yuichi SAITOH; Kazuhiko YAMAGUCHI; Hideki IMAI

New Decoding Techniques for Punctured Convolutional Codes

Pisit CHARN KEIT KONG, Yuichi SAITOH, Kazuhiko YAMAGUCHI, Hideki IMAI

Full Text Views

0

Share
Cite this

Summary :

In this paper, a rate k/n punctured convolutional code is considered as a time-varying code with period k. The punctured convolutional codes with time-varying constraint length are studied. For these codes, new maximum likelihood decoding techniques are proposed. Not only for the binary symmetric channel but also for any discrete memoryless channel, these decoding techniques can periodically reduce the number of survivors and comparisons in the decoding process. On the basis of the proposed decoding techniques, new classes of punctured convolutional codes are introduced. Computer searches are perfermed to construct good codes from these classes.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E74-A No.9 pp.2571-2578

Publication Date: 1991/09/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Information Theory and Its Applications)

Category

Authors

Pisit CHARN KEIT KONG
Yuichi SAITOH
Kazuhiko YAMAGUCHI
Hideki IMAI

Keyword

Cite this

Copy

Pisit CHARN KEIT KONG, Yuichi SAITOH, Kazuhiko YAMAGUCHI, Hideki IMAI, "New Decoding Techniques for Punctured Convolutional Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E74-A, no. 9, pp. 2571-2578, September 1991, doi: .
Abstract: In this paper, a rate k/n punctured convolutional code is considered as a time-varying code with period k. The punctured convolutional codes with time-varying constraint length are studied. For these codes, new maximum likelihood decoding techniques are proposed. Not only for the binary symmetric channel but also for any discrete memoryless channel, these decoding techniques can periodically reduce the number of survivors and comparisons in the decoding process. On the basis of the proposed decoding techniques, new classes of punctured convolutional codes are introduced. Computer searches are perfermed to construct good codes from these classes.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e74-a_9_2571/_p

Copy

@ARTICLE{e74-a_9_2571,
author={Pisit CHARN KEIT KONG, Yuichi SAITOH, Kazuhiko YAMAGUCHI, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={New Decoding Techniques for Punctured Convolutional Codes},
year={1991},
volume={E74-A},
number={9},
pages={2571-2578},
abstract={In this paper, a rate k/n punctured convolutional code is considered as a time-varying code with period k. The punctured convolutional codes with time-varying constraint length are studied. For these codes, new maximum likelihood decoding techniques are proposed. Not only for the binary symmetric channel but also for any discrete memoryless channel, these decoding techniques can periodically reduce the number of survivors and comparisons in the decoding process. On the basis of the proposed decoding techniques, new classes of punctured convolutional codes are introduced. Computer searches are perfermed to construct good codes from these classes.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - New Decoding Techniques for Punctured Convolutional Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2571
EP - 2578
AU - Pisit CHARN KEIT KONG
AU - Yuichi SAITOH
AU - Kazuhiko YAMAGUCHI
AU - Hideki IMAI
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E74-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1991
AB - In this paper, a rate k/n punctured convolutional code is considered as a time-varying code with period k. The punctured convolutional codes with time-varying constraint length are studied. For these codes, new maximum likelihood decoding techniques are proposed. Not only for the binary symmetric channel but also for any discrete memoryless channel, these decoding techniques can periodically reduce the number of survivors and comparisons in the decoding process. On the basis of the proposed decoding techniques, new classes of punctured convolutional codes are introduced. Computer searches are perfermed to construct good codes from these classes.
ER -