Table based decoding of rate one-half convolutional codes

DOI10.1109/26.380090MaRDI QIDQ2726495zbMATH OpenOpenAlexFDO

Authors Ajay Dholakia, Mladen A. Vouk, Donald L. Bitzer

Publication date 18 July 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.380090

Mathematics Subject Classification ID

Convolutional codes (94B10)

Review text

Table based error correction and decoding of rate one-half convolutional codes is described. A new class of fast-decodeable locally invertible convolutional codes based on a one-to-one mapping between information and encoded blocks of equal lengths is defined. The syndrome is used as an address to access a correction table which stores pre-computed correction information. The correction table generation process is described and a specific table based correction algorithm is given. Performance of this scheme is analyzed and simulation results are presented.

Recommendations

• scientific article; zbMATH DE number 721804
• A class of binary rate one-half convolutional codes that allows an improved stack decoder
• Decoding of convolutional codes using a syndrome trellis
• Bounded distance decoding of unit memory codes
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

Cited in

(2)

• Fast tabular decoding method for multi-delimiter codes
• Algebraic decoder of multidimensional convolutional code: Constructive algorithms for determining syndrome decoder and decoder matrix based on Gröbner basis

This page was built for publication: Table based decoding of rate one-half convolutional codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2726495)