Implementation method of high-speed reed-solomon (RS) codec based on field programmable gate array (FPGA)

Abstract

The invention discloses an implementation method of a high-speed reed-solomon (RS) codec based on a field programmable gate array (FPGA), comprising FPGA implementation of a high-speed RS (244, 212) coder and FPGA implementation of a high-speed RS (244, 212) decoder. In the invention, the high-speed RS coder is a circuit based on polynomial division, and the high-speed RS decoder is based on three-level pipeline architecture, and dual-clock driving based on clock i_clk and reverse clock i_clk180 is adopted; In addition, based on a common Galois field (GF) multiplying unit, three basic computing units, including a constant coefficient GF multiply-add fused unit, a constant coefficient GF multiplying unit and a dual-clock period controlled GF multiplying unit are provided, thereby greatly improving the computing speed and reducing hardware complexity. The implementation method has the advantages of high supporting throughput rate and strong capacity of correcting burst errors and can be applied to many aspects.

Description

technical field [0001] The invention belongs to the field of channel encoding and decoding devices in communication, and in particular relates to an FPGA-based high-speed RS (244, 212) encoding and decoding implementation method that can be used for satellite high-speed signal processing. Background technique [0002] RS code, constructed in 1960 by Reed and Solomon using Mattson-Solomon (MS) polynomial, is a kind of multi-ary BCH code with strong error correction ability, which can correct both random errors and burst errors. This good characteristic makes it especially suitable for communication systems with very complex channel interference. The so-called complex channel interference refers to the fact that the error type in the channel may be a burst error or a random error at a certain moment, but there can only be one type of error at a certain moment. The RS code is not only a good code for correcting random errors, but also a code that is close to the best for corre...

AI Technical Summary

Problems solved by technology

[0004] In the decoding process of RS codes, due to the solution of the key equations in the decoding method, the method of multiple iterations is adopted, the implementation itself is more complicated, and because the engineering realization of the decoding method is also more difficult, resulting in its engineering The implementation cost is high, and it is difficult to achieve the ideal decoding speed. Therefore, whether an RS code can be applied in practice depends largely on whether the decoding algorithm can be simple, fast and economical.

Images