Performs the direct sequence spread spectrum (DSSS) despreading operation on a spread sequence of data bits.

Decodes a convolutionally encoded bit stream, using a specified rate or generator matrix. The decoding scheme employs the Viterbi decoding algorithm and returns an output binary message stream.

Decodes a normal or shortened Reed-Solomon (RS) encoded integer symbol stream.

Decodes an 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 VI 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.

Decodes a Hamming-encoded bit stream.

Performs decoding on a Bose-Chaudhari-Hocquenghem (BCH)-encoded bit stream using the Berlekamp algorithm for binary BCH codes. The input values of n, k, and t define the code word length, data word length and error correcting capacity, respectively, in bits. The VI provides a set of common combinations of (n,k,t).

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 the MT Puncture Data Stream VI.

Message-passing algorithms are effective decoding strategies for low-density parity check (LDPC). The best algorithm known is iterative probabilistic decoding, or belief propagation. In this algorithm, at each iteration, messages are passed from message nodes to check nodes and vice versa. The message that is sent from message node (v) to the check node (c) must not take into account the message sent in the previous iteration from c to v. The same is true for messages passed from check nodes to message nodes.