On low complexity stack decoding of convolutional codes

DOI10.1109/26.768752MaRDI QIDQ2732732zbMATH OpenOpenAlexFDO

Authors J. D'Souza, S. L. Maskara

Publication date 4 September 2001

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

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

zbMATH Keywords

convolutional codesstack algorithmhigh rate codeshard quantized channelstack sequential decoding

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Convolutional codes (94B10) Decoding (94B35)

Recommendations

• On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
• scientific article; zbMATH DE number 1504653
• scientific article; zbMATH DE number 4035733
• Twin-stack decoding of recursive systematic convolutional codes
• Sequential decoding of linear convolutional codes
• Decoding concatenated codes with inner convolutional codes
• Decoding of block codes obtained from convolution codes
• Low State Complexity Block Codes Via Convolutional Codes
• On the theory of low-density convolutional codes. II
• Convolutional codes and complexity

Cited in

(4)

• On the performance of sequential and Viterbi decoders for high-rate punctured convolutional codes
• Decoding concatenated codes with inner convolutional codes
• Twin-stack decoding of recursive systematic convolutional codes
• A class of binary rate one-half convolutional codes that allows an improved stack decoder

This page was built for publication: On low complexity stack decoding of convolutional codes

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