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… 

Figures from this paper

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

SIEVE: A Space-Efficient Algorithm for Viterbi Decoding

A reformulation of the Viterbi algorithm that eliminates its space-complexity dependence on the number of observations to be explained, and discards and recomputes parts of the DP solution for the sake of space efficiency, in divide-and-conquer fashion, without incurring a time- complexity overhead.

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

A software-based Turbo code decoder which significantly reduces computational complexity, power consumption and cost is proposed.

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

A New State-Drop Fast Sequence Estimation for TCM

A new State-Drop Fast Sequence Estimation (SDFSE) strategy for Trellis Coded Modulation (TCM) schemes for transmission in the Intersymbol Interference (ISI) environment, which takes the path metrics of soft output Viterbi algorithm as a measure to decide and compute the state transitions of only-best-survivor in the succeeding intervals.

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.



Convolutional Codes II. Maximum-Likelihood Decoding

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

This work has shown that polynomials over Galois Fields, particularly the Hadamard, Quadratic Residue, and Golay Codes, are good candidates for Error Control Coding for Digital Communication Systems.

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