Novel Viterbi decoder VLSI implementation and its performance

  title={Novel Viterbi decoder VLSI implementation and its performance},
  author={S. Kubota and Shuzo Kato and Tsunehachi Ishitani},
  journal={IEEE Trans. Commun.},
An advanced, high-speed, and universal-coding-rate Viterbi decoder VLSI implementation is presented. Two novel circuit design schemes have been proposed: scarce state transition (SST) decoding and direct high-coding-rate convolutional code generation and variable-rate decoding. SST makes it possible to omit the final decision circuit and to reduce the required path memory length without degrading error probability performance. Moreover, the power consumption of the SST Viterbi decoder is… 

Universal-coding-rate scarce-state-transition Viterbi decoder

A universal-coding-rate scarce-state-transition Viterbi decoder that permits the realization of a high-speed high-codes-rate one-chip forward error correction CMOS LSIC is proposed and a low-power-consumption path memory is proposed to reduce the power consumption.

Comprehensive Analysis and Optimization of Reliable Viterbi Decoder Circuits Implemented in Modular VLSI Design Logic Styles

The significance of the work is the upshot of realizing low latency and low power dissipation with high reliability in the iterative process of finding the least path metric by superseding the subtractor in CSA & PCSA circuits with an optimized comparator.

Scarce-State-Transition Viterbi Decoding of Punctured Convolutional Codes for VLSI Implementation

In Viterbi decoding of (n, k) convolutional codes of total encoder memory M, the decoder carries out (2 k -l)-ary comparisons at each node of the 2 M -state encoder trellis, a power consumption reduction of 40% can be achieved by the system when compared with a hypothetical register-exchange type of Viter bi decoder.

VLSI design and implementation of high-speed Viterbi decoder

This paper presents a new architecture for high-speed Viterbi decoder with low power dissipation based on the modified T-algorithm and modified trace-back methods, which is adopted to reuse the already generated trace- back routes to reduce the times of trace-backs operations.

Low Complexity SST Viterbi Decoder

  • Jin JieC. Tsui
  • Computer Science
    IEEE Vehicular Technology Conference
  • 2006
An approach which facilitates the implementation of this reduced complexity algorithm by building it on the Scarce State Transition (SST) Viterbi decoding scheme and results show that over 80% computation reduction can be achieved while the bit-error-rate (BER) performance of the VA is maintained.

VLSI implementation of a high-speed and low-power punctured Viterbi decoder

To gain high throughput and short decoding latency, parallel computations in ACSU and SMU are adopted and to save the power consumption, the unnecessary computations of path metric are omitted in the add-compare-select-unit (ACSU) and the already generated back-tracing routes are reused to reduce the times of trace-back operations in the survivor-memory- unit (SMU).

A Low-Power Codeword-Based Viterbi Decoder with Fine-Grained Error Detection and Correction Techniques

A low-power codeword-based Viterbi decoder and its corresponding VLSI architecture with the following advantages and contributions, which can save up to 30.85% power saving with negligible area and delay overheads compared with the previous segment-based design.

Low-Power Limited-Search Parallel State Viterbi Decoder Implementation Based on Scarce State Transition

  • Jie JinC. Tsui
  • Computer Science
    IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 2007
A low complexity algorithm based on a limited search algorithm, which reduces the average number of the add-compare-select computation of the Viterbi algorithm, is proposed and seamlessly integrated with the SST-based decoder.

Scarce-State-Transition Syndrome-Former Error-Trellis

A novel scarce-state-transition (SST) type trellis decoding system for (n, n - 1) convolutional codes with coherent BPSK signals is proposed, and a combination of the two techniques results in a less complex and low power consumption decoding system.

FPGA implementation of Viterbi decoder

It is shown that the larger the constraint length used in a convolutional encoding process, the more powerful the code produced.



Syndrome Decoding of Binary Rate-1/2 Convolutional Codes

The classical Viterbi decoder recursively finds the trellis path (code word) closest to the received data, and the syndrome decoder first forms a syndrome, which determines the noise sequence of minimum Hamming weight that can be a possible cause of this syndrome.


A high-speed and high-coding-gain Viterbi decoder LSI with low power consumption and number of gates with low development costs is developed using CMOS master-slice LSI by employment of the SST scheme.

Parallel Viterbi algorithm implementation: breaking the ACS-bottleneck

A linear scale solution (architecture) is presented which allows the implementation of the Viterbi algorithm (VA) despite the fact that it contains a data-dependent decision feedback loop, and it is possible to transfer this method to other types of algorithms which contain aData-dependent feedback loop and have a finite state property.

CMOS/SOS LSI implementation of Viterbi error correction circuitry

A communications error correction CODEC circuit using the Viterbi algorithm has been implemented with a single CMOS/SOS LSI chip, providing data communications systems with enhanced signal/noise

A monolithic CMOS maximum-likelihood convolutional decoder for digital communication systems

  • P. HoppesR. Mccallister
  • Computer Science
    1982 IEEE International Solid-State Circuits Conference. Digest of Technical Papers
  • 1982
A device Providing forward error correction for NASA's 30/20 GHz program via a maximum-likelihood convolutional decoder with constraint length = 5, rate = 1/2 and Q = 4 is described.

Inverses of Linear Sequential Circuits

A large part of the work is motivated by results and techniques which have been applied in the study of continuous-time linear dynamical systems and thus serves to point out the advantages which may accrue through simultaneous study of both continuous- time systems and linear sequential circuits.

Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.)

The structure of punctured convolutional cedes is described, and it is indicated how their use simplifies the design of maximum likelihood decoders. The best codes of this class for rates 2/3 and 3/4