The path memory unit in an (n,k,m) Viterbi Decoder is responsible for keeping track of the information bits associated with the surviving paths designated by the path metric unit. Viterbi decoders and ...

The decoding in the sliding block decoder was performed simultaneously in forward and backward direction. However, only a 4-state Viterbi decoder was implemented, while for practical 32- or 64-state ...

In this paper, we propose a parallel block-based Viterbi decoder (PBVD) on the graphic processing unit (GPU) platform for the decoding of convolutional codes. The decoding procedure is simplified and ...

One way to optimize the Viterbi algorithm is to simplify the trellis diagram by reducing the number of states and branches. This can be done by using punctured codes, which skip some of the ...

The first step in the Viterbi-decoding algorithm requires calculation of the branch-metric (see sidebar “The Viterbi-decoding algorithm”). The branch metric is the distance from the received code word ...

The path memory unit in an (n,k,m) Viterbi Decoder is responsible for keeping track of the information bits associated with the surviving paths designated by the path metric unit. Viterbi decoders and ...

A high speed and low power Viterbi decoder architecture design based on deep pipelined, clock gating and toggle filtering has been presented in this paper. The Add-Compare-Select (ACS) and Trace Back ...