| Summary: | 碩士 === 義守大學 === 資訊工程學系碩士班 === 98 === Reed Solomon codes, which have been used in a variety of broadcasting systems, are encoded by algebraic methods. Although commonly implemented in dedicated hardware, this thesis, explores the mapping of high-throughput RS encoding on processors.
The look-up table method to accelerate the operation in Galois Field for the (204, 188, t=8) RS encoder is presented in this thesis. First, the multiplication could be improved by reducing the times of the lookup table. According to this, if a multiplier is constant, one can express as an exponent value. Therefore, search times in the lookup table and computing the complexity are reduced.
In addition, the use of the Lagrange method to encode the (204, 188, t=8) RS Code, the Lagrange polynomial of the coefficients is pre-calculated to store in the memory. Moreover, the method could be provided in parallel on multi-core CPU. In the end, the codeword can be expressed as the message polynomial to add parity polynomial.
|
|---|
