Table Of Contents

MT Convolutional Decoder (Viterbi Hard Decision, Rate) (G Dataflow)

Last Modified: January 9, 2017

Decodes a convolutionally encoded bit stream using a specified code rate. The code rate is equal to the ratio of the data word length to the code word length.


traceback depth

The number of trellis stages used in the Viterbi decoding process.

Default: 15


input bit stream

Bit sequence representing the code word to decode.



The convolutional code rate, which is a ratio of k/n, where k is the input data word length and n is the output code word length.

Name Description

Supports constraint lengths of 3,4,5,6,7,8,9,10,11,12,13,14,15,16,17


Supports constraint lengths of 3,4,5,6,7,8,9,10,11,12,13,14


Supports constraint lengths of 3,4,5,6,7,8,9,10,11,12,13,14


Supports constraint lengths of 2,3,4,5,6


Supports constraint lengths of 2,3,4

Default: 1/2


constraint length

The maximum number of encoded bits that can be affected by a single input bit. This value represents (1 + maximal memory order), where maximal memory order refers to the length of the longest shift register chain in the convolutional encoder.

Default: 3


initial state

The initial parent state for the decode operation. When reset? is set to TRUE, the trellis structure is set to this state, thereby initializing the Viterbi decoding operation. On the first call to this node, and thereafter when reset? is set to FALSE, the survivor state from the previous iteration is used to continue performing Viterbi decoding and this parameter is ignored.

Default: 0


error in

Error conditions that occur before this node runs. The node responds to this input according to standard error behavior.

Default: no error



A Boolean that determines whether the internal state of the decoder is cleared.

TRUE Clears any buffered bits from previous iterations. Also initializes the Viterbi algorithm to start decoding from initial state. The relationship of the length of output bit stream, L out , to the length of input bit stream, L in , is described by the following equation:

L out = k × [floor(L in /n) - D]

where k is the input data word length, n is the output data word length, and D is the decoder traceback depth in symbols.

FALSE Continues decoding from the previous iteration. The length of output bit stream is given by the following equation:

L out = k × floor(L in /n).


If the length of the encoded bit stream is L in , and reset? is set to TRUE, the Viterbi decoding algorithm (for a rate k/n code) returns a total of L out = k×[floor(L in /n)-D] decoded bits in a single iteration, implying that a total of k×D message bits are buffered inside the node. To recover the entire message of length k×floor[L in /n] in a single call to MT Convolutional Decoder with reset? set to TRUE, choose one of the following options:

  • Append max(D,K-1)×k zeros to the end of the message prior to performing convolutional encoding. Here k represents the message word length.
  • Append D×n zeros to the end of the encoded bit stream prior to calling MT Convolutional Decoder. Here, D is the traceback depth employed in the convolutional decoder, and n is the code word length.

Default: TRUE


output bit stream

Bit sequence decoded by this node.


final state

The survivor state after decoding the entire input bit stream.


error out

Error information. The node produces this output according to standard error behavior.

Where This Node Can Run:

Desktop OS: Windows

FPGA: Not supported

Recently Viewed Topics