Decode ReedSolomon code to recover integer vector data
Communications Toolbox / Error Detection and Correction / Block
The IntegerOutput RS Decoder block recovers a message vector from a ReedSolomon codeword vector. For proper decoding, the parameter values in this block must match those in the corresponding IntegerInput RS Encoder block.
The ReedSolomon code has message length K, and codeword length N – number of punctures. You specify N and K directly in the block dialog. The symbols for the code are integers in the range [0, 2^{M}1], which represent elements of the finite field GF(2^{M}). Restrictions on M and N are described in Restrictions on the M and the Codeword Length N below.
This icon shows optional ports.
The input and output are integervalued signals that represent codewords and messages, respectively. For more information, see Input and Output Signal Length in RS Blocks. The block inherits the output data type from the input data type. For information about the data types each block port supports, see Supported Data Types.
For more information on representing data for ReedSolomon codes, see the section Integer Format (ReedSolomon Only).
If the decoder is processing multiple codewords per frame, then the same puncture pattern holds for all codewords.
The default value of M is ceil(log2(N+1))
, that is, the smallest
integer greater than or equal to log2(N+1). You can change the value of M from the
default by specifying the primitive polynomial for GF(2^{M}), as
described in Specify the Primitive Polynomial below.
You can also specify the generator polynomial for the ReedSolomon code, as described in Specify the Generator Polynomial.
An (N, K) ReedSolomon code can correct up to
floor((NK)/2)
symbol errors (not bit
errors) in each codeword.
If decoding fails, the message portion of the decoder input is returned unchanged as the decoder output.
The sample times of the input and output signals are equal.
Data Types 

Multidimensional Signals 

VariableSize Signals 

This block uses the BerlekampMassey decoding algorithm. For information about this algorithm, see Algorithms for BCH and RS Errorsonly Decoding.
[1] Wicker, Stephen B., Error Control Systems for Digital Communication and Storage. Upper Saddle River, N.J.: Prentice Hall, 1995.
[2] Berlekamp, Elwyn R., Algebraic Coding Theory, New York: McGrawHill, 1968.
[3] Clark, George C., Jr., and J. Bibb Cain. ErrorCorrection Coding for Digital Communications, New York: Plenum Press, 1981.