Implementation method of Reed-Solomon decoder

An implementation method and a decoder technology, which are applied in the field of Reed-Solomon decoder implementation, can solve the problems of not being able to support multi-symbol operations at the same time, failing to meet the requirements of the application environment, and the number of iterations depending on wrong symbols, etc., to achieve easy Hardware implementation, fixed delay, and small delay effect

Inactive Publication Date: 2010-09-15
高通创锐讯通讯科技(上海)有限公司
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0056] 2. Traditional adjoint calculations can only support single symbols, and cannot support multi-symbol operations at the same time
[0057] 3. The traditional decoder based on the improved Euclidean algorithm uses iteration to solve the error position and error value polynomial, but the number of iterations depends on the number of error symbols in the codeword, so it passes through different code groups through the decoder There may be different d

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Implementation method of Reed-Solomon decoder
  • Implementation method of Reed-Solomon decoder
  • Implementation method of Reed-Solomon decoder

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0084] From the calculation process of the improved Euclidean algorithm, it can be seen that for the solution of the two polynomials of the error position polynomial σ(X) and the error value polynomial ω(X), the improved Euclidean algorithm only depends on R(X) The difference between the highest-order coefficients of the two polynomials and Q(X) and the orders of the two polynomials.

[0085] The implementation method of the Reed-Solomon decoder of the present invention is based on the improved Euclidean algorithm. After optimization, the schematic diagram of an implementation is as follows Figure 5 shown.

[0086] A controller, an arithmetic unit, and four shift registers are set respectively, wherein the first shift register stores the coefficients of each order of the polynomial R(X), the second shift register stores the coefficients of each order of the polynomial Q(X), and the shift register Three stores the coefficients of each order of the polynomial λ(X), shift regis...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an implementation method of a Reed-Solomon decoder. The Reed-Solomon decoder realizes solving on an error location polynomial and an error value polynomial by a controller, an arithmetic device and four shifting registers, and can decode a plurality of symbols of a Reed-Solomon code, thus achieving small and fixed delay time for decoding and regular structure.

Description

technical field [0001] The invention relates to digital communication technology, in particular to a method for realizing a Reed-Solomon decoder. Background technique [0002] In order to reduce the error probability of digital signals during transmission or storage, etc., error correction codes are widely used in various environments. By detecting whether the received code group is wrong, the receiving end can notify the sending end to resend the erroneous code; the more advanced error correction code, the so-called "Forward Error Correction Code" (FEC, Forward Error Correction), can detect and Corrects errors in received code groups without requiring the sender to retransmit. [0003] A Galois finite field defines a number field that contains a finite number of elements. A Galois field containing q elements is usually denoted as GF(q). In FEC coding, especially RS (Reed-Solomon, Reed-Solomon) code, the Galois field is very useful. For example, a string of binary sequen...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H03M13/15
Inventor 王星李东川胡新宇
Owner 高通创锐讯通讯科技(上海)有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap