MT BCH Decoder (Non-Systematic, Message-Generator Product)
- Updated2023-02-17
- 3 minute(s) read
MT BCH Decoder (Non-Systematic, Message-Generator Product)
Decodes a code word available as a polynomial product of the data word and the generator polynomials. Performs decoding on a Bose-Chaudhari-Hocquenghem (BCH) encoded bit stream using the Berlekamp algorithm for binary BCH codes.
.png?_LANG=enus)
Inputs/Outputs
input bit stream
Bit sequence representing the code word to decode.
n,k,t
Values of the code word length (n), data word length (k), and error correcting capacity (t), in bits. The n, k, and t values for BCH encoding are interrelated such that specifying two values constrains the third value. Select from a set of well-known (n,k,t) triples that are widely used for BCH encoding or specify an arbitrary triple by entering three comma-separated integers. The encoding scheme takes in a bit data word of k bits and produces a code word of n bits.
Default value: 7, 4, 1
Code Word Length Limits
error in
Error conditions that occur before this node runs.
The node responds to this input according to standard error behavior.
Default value: No error
reset?
A Boolean that determines whether the internal state of the decoder is cleared.
| TRUE | Clears any buffered bits from previous iterations. Also initializes the Galois field structure corresponding to the BCH n, k, t values. |
| FALSE | Continues decoding from the previous iteration. Any buffered bits from the previous iteration are added to the beginning of the input bit stream prior to decoding. |
Default value: TRUE
output bit stream
Bit sequence decoded by this node.
error out
Error information.
The node produces this output according to standard error behavior.