New Decoding Techniques for Punctured Convolutional Codes

Pisit CHARN KEIT KONG  Yuichi SAITOH  Kazuhiko YAMAGUCHI  Hideki IMAI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E74-A   No.9   pp.2571-2578
Publication Date: 1991/09/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Issue on Information Theory and Its Applications)
Category: 
Keyword: 


Full Text: PDF(566.4KB)>>
Buy this Article




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.