Parallel circuit based on Chien search algorithm and Fornie algorithm

A search algorithm and Forney algorithm technology, applied in the field of decoding, can solve the problems of insufficient processing speed and large hardware resource consumption, and achieve the effect of improving circuit processing speed and reducing hardware resource consumption.

Pending Publication Date: 2021-03-09
XIAN UNIV OF POSTS & TELECOMM
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In order to solve the technical problem that the existing circuit hardware resource consumption is too large and the processing speed cannot meet the current high-speed data transmission, the invention provides a parallel circuit based on money search algorithm and Forney algorithm, which can meet high-speed parallel processing data and has a simple structure , less hardware resource consumption

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
  • Parallel circuit based on Chien search algorithm and Fornie algorithm
  • Parallel circuit based on Chien search algorithm and Fornie algorithm
  • Parallel circuit based on Chien search algorithm and Fornie algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0039] The specific implementation manners of the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments.

[0040] 1. Money Search Algorithm and Forney Algorithm Process

[0041] The essence of the money search algorithm is to find the root of a finite field polynomial. Because the number of items of the polynomial is limited, the element of each item in the polynomial is evaluated. If the result of the polynomial is 0, then the value of this element is the root of the polynomial. Then the position of the element is the wrong position. Taking the RS code as an example, the money search algorithm processes the input error position polynomial, and searches for errors by verifying the form of the root of each position according to the error position polynomial.

[0042] The error location polynomial based on the money search algorithm is:

[0043] σ(α i ) = σ 0 +σ 1 alpha i +σ 2 (α i ) 2 +…+σ n-k-1 (α i...

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

In order to solve the technical problems that the hardware resource consumption of the existing circuit is overlarge and the processing speed cannot meet the current high-speed data transmission, theinvention provides a parallel circuit based on a money search algorithm and a Fini algorithm. A mode of simultaneously processing a group of input error position polynomials and error value polynomials in s clock periods or carrying out time-sharing processing on a group of error position polynomials and error value polynomials in 2s clock periods is adopted, so that high-speed parallel data processing can be met, the structure is simple, and the hardware resource consumption is relatively low.

Description

technical field [0001] The invention relates to the technical field of decoding, in particular to a parallel circuit based on money search algorithm and Forney algorithm. Background technique [0002] Set the definition in Galois field GF(2 m ) The packet length of the codeword is n=2 m -1, m is the bit width (mbit) of each symbol, and the code length is k, then the code group can be expressed as RS(n,k), the check length is n-k, and the minimum distance is d=n-k+ 1. The error correction ability is The money search algorithm is a solution based on the cyclic characteristics of GF(2 m ) in the polynomial equation ∑ (x) = 0 position error algorithm, the Forney algorithm is often used to calculate the error value on the known error position in the coding theory, the money search algorithm and the Forney algorithm are mainly used in: RS (Reed-Solomon) code, BCH (Bose-Chaudhuri-Hocquenghem) code, ECC (Elliptic curve cryptography). [0003] With the rapid development of mode...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H03M13/15
CPCH03M13/15
Inventor 张丽果谭竞轩曾泽沧蒋励惠颖昭张英杰
Owner XIAN UNIV OF POSTS & TELECOMM
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