A fast maximum-likelihood decoder for convolutional codes

  title={A fast maximum-likelihood decoder for convolutional codes},
  author={J. Feldman and Ibrahim C. Abou-Faycal and M Frigo},
  journal={Proceedings IEEE 56th Vehicular Technology Conference},
  pages={371-375 vol.1}
The lazy Viterbi decoder is a maximum-likelihood decoder for block and stream convolutional codes. For many codes of practical interest, under reasonable noise conditions, the lazy decoder is much faster than the original Viterbi decoder. For a code of constraint length 6, the lazy algorithm is about 50% faster than an optimized implementation of the Viterbi decoder whenever SNR>6 dB. Moreover, while the running time of the Viterbi decoder grows exponentially with the constraint length, under… 
Maximum likelihood DE coding of convolutional codes using viterbi algorithm with improved error correction capability
The modified decoding process proposed in this paper shall use a different approach to derive the exact bit, double bit, burst error and a symbol error correction process, which will detect and correct the errors by means of connecting and comparing the metric values at the present, previous and next states of the Viterbi decoding.
A new efficient fangled Viterbi algorithm is proposed in this paper with less complexity and processing time along with 2 bit error correction capabilities.
Computer Generation of Efficient Software Viterbi Decoders
A program generator for fast software Viterbi decoders for arbitrary convolutional codes using a small domain-specific language called VL to express the structure of the forward pass.
Low complexity SOVA for Turbo codes
Simulation results and complexity analysis show that VA based T-SOVA performs as well as lazy VA based SOVA and is easier to be applied to hardware implementation.
On the Performance-Complexity Tradeoff of Convolutional Codes for Broadband FWA Systems
In this paper, we investigate the performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems by considering the effects of quantization and path metric memory
A Low Complexity Turbo Code Decoder American University of Beirut Faculty of Engineering and Architecture Department of Electrical and Computer Engineering Final Year Project Spring 2005-2006
Turbo codes are currently used in mobile data services because of their low error rates. Due to their iterative decoding procedure, decoding Turbo codes in real-time can only be performed at the
Performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems
In this study, the authors investigate the performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems by considering the effects of quantisation and path
Successive Cancellation Priority Decoding of Polar Codes
It is proved that the path extension of the SCP decoder can achieve the same decoding performance as that of the standard SCL decoder, and a quantized priority queue is introduced to avoid the comparison operations in the path selection and to simplify theSCP decoder.
A New State-Drop Fast Sequence Estimation for TCM
In this paper, we developed a new State-Drop Fast Sequence Estimation (SDFSE) strategy for Trellis Coded Modulation (TCM) schemes for transmission in the Intersymbol Interference (ISI) environment.
Fast Viterbi Decoder Algorithms for Multi-Core System
New parallel Viterbi algorithms for decoding convolutional codes are proposed based on tail biting trellises based on back-propagation algorithms for a multi-core system.


Convolutional Codes II. Maximum-Likelihood Decoding
  • G. Forney
  • Computer Science, Mathematics
    Inf. Control.
  • 1974
It is shown that termination is unnecessary with the Viterbi algorithm, and a universal asymptotic bounding technique is developed and used to bound error probabilities, free distance, list-of-2 error probability, and other subsidiary quantities.
A maximum-likelihood soft-decision sequential decoding algorithm for binary convolutional codes
A trellis-based maximum-likelihood soft-decision sequential decoding algorithm (MLSDA) for binary convolutional codes and shows that, under moderate SNR, the algorithm is about four times faster than the conventional sequential decode algorithm having comparable bit-error probability.
Viterbi Decoding for Satellite and Space Communication
Convolutional coding and Viterbi decoding, along with binary phase-shift keyed modulation, is presented as an efficient system for reliable communication on power limited satellite and space
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
The authors present a novel and efficient maximum-likelihood soft-decision decoding algorithm for linear block codes. The approach used here converts the decoding problem into a search problem
A* decoding of block codes
A tutorial on the A* algorithm is given, the decoding complexity is compared with that of exhaustive search and Viterbi decoding algorithms, and performance curves obtained for several codes are presented.
Error Control Systems for Digital Communication and Storage
1. Error Control Coding for Digital Communication Systems. 2. Galois Fields. 3. Polynomials over Galois Fields. 4. Linear Block Codes. 5. Cyclic Codes. 6. Hadamard, Quadratic Residue, and Golay
The viterbi algorithm
This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
A heuristic discussion of probabilistic decoding
  • R. Fano
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1963
The invited Profess01 Fano to commit to paprr his elegant but, unelaborate explanation of the principles of sequential decoding, a scheme which is currently contending for a position as the most practical implementation of Shannon’s theory of noisy communication channels.
The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition
A container closure assembly for maintaining a sterile sealed container is provided having a ferrule having a top annular portion and a depending skirt portion for securing a resilient stopper for
Dolinar. decoding of block codes
  • IEEE Trans. Comm.,
  • 1996