Research Of Reed-Solomon Codec Algorithm And Hardware Architectures For DMB

Reliability in communication system is increasingly critical as the broadband wireless multimedia communication and broadcasting develop fast. One of the ways to make the transmission more reliable is to add more effective error-correct code to the channel coding. Reed-Solomon code is one kind of BCH code which can correct both random and burst errors. It is widely used in the channel coding of broadband wireless multimedia communication and broadcasting. RS codes are based on a specialist area of mathematics known as Galois fields which have special property for arithmetic operations. Codec algorithm is presented in this thesis. The most important part of RS codec is to find the error location in the decoder. Three blocks of decoder are introduced including BM iterative algorithm which is the key algorithm in finding the error locater polynomial. A kind of inverse-free BM iterative algorithm is analyzed compared with conventional BM algorithm and architectures of syndrome computation block, key-equation solver block, and chien search and error evaluator block are also analyzed.