Table Of Contents

Decoding Nodes (G Dataflow)

Version:
    Last Modified: February 7, 2018

    node_icon
    Performs decoding on a Bose-Chaudhari-Hocquenghem (BCH)-encoded bit stream using the Berlekamp algorithm for binary BCH codes. The BCH decoding algorithm uses either a systematic or non-systematic encoding scheme.
    node_icon
    Decodes a convolutionally encoded bit stream using different types of the Viterbi decoding algorithm (hard decision/unquantized/soft decision) and specifications (code rate/generator matrix).
    node_icon
    Inserts an erasure value inside the punctured input data stream. The erasure value is equivalent to inserting a null symbol in the position of the input data stream that was previously punctured using MT Puncture Data Stream.
    node_icon
    Performs the direct sequence spread spectrum (DSSS) despreading operation on a spread sequence of data bits.
    node_icon
    Decodes a Golay-encoded bit stream. The decoder provides the two triple-correcting Golay codes: the Golay (23,12,3) code and the extended Golay (24,12,3) code. This node uses the Arithmetic decoding algorithm for decoding the Golay (23,12,3) encoded bit stream and the Kasami error-trapping decoding algorithm for decoding the extended Golay (24,12,3) encoded bit stream.
    node_icon
    Decodes a Hamming-encoded bit stream.
    node_icon
    Executes iterative probabilistic decoding, or belief propagation, for low-density parity check (LDPC). In this algorithm, at each iteration, messages are passed from message nodes to check nodes and vice versa.
    node_icon
    Decodes a normal or shortened Reed-Solomon (RS) encoded integer symbol stream.

    Recently Viewed Topics