Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Decoding method for channel error correcting BCH code and RS code

A technology of BCH code and error correction code, which is applied in the field of channel error correction code, can solve the problems of high bit error rate and errors, and achieve the effect of reducing the bit error rate

Active Publication Date: 2009-06-17
PEKING UNIV +1
View PDF0 Cites 26 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In this case, the original decoding method in the system is still used, which may cause more errors in the decoded codeword than the received codeword, making the situation worse, and the system has a high bit error rate

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
  • Decoding method for channel error correcting BCH code and RS code
  • Decoding method for channel error correcting BCH code and RS code
  • Decoding method for channel error correcting BCH code and RS code

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0042] Example 1: The main parameters of a primitive BCH (511, 475) code are:

[0043] Code word length n=2 9 -1=511bits;

[0044] Information bit length k=475bits;

[0045] Maximum error correction capability t=(n-k) / m=(511-475) / 9=4bits;

[0046] The operations in decoding are performed in the Galois field GF(2 9 ) field, the adjoint polynomial coefficients are all GF(2 9 ) number in the field.

[0047] The transmitted codeword is 472 1s plus 3 0s, and the 48th, 187th, and 356th bit errors are artificially set in the channel, a total of 3 bit errors, which is less than the maximum error correction capability of the BCH code 4 bits. The error position polynomial obtained by the receiving end according to the Euclid algorithm is σ(x)=0+338 x+366 ​​x 2 +29 x 3 +172 x 4 , σ 0 Equal to 0, the number of error positions found by the Chien search algorithm is 3, the alarm indication signal does not generate an alarm, and the finally decoded codeword is 472 1s plus 3 0s, whic...

example 2

[0049] Example 2: In a single-carrier communication system using BPSK modulation, a BCH encoder and a decoder are respectively added at the sending end and the receiving end, and the BCH decoder uses the Euclid algorithm. The bit error rate of the system is simulated and tested, and the bit error rate comparison relationship between the system using the detection mechanism beyond the error correction capability of the present invention and the system without the detection mechanism beyond the error correction capability is as follows Figure 4 shown. Figure 4 The uppermost unsigned solid line is the theoretical bit error rate curve of the system without BCH encoding and decoding; the lower two signed curves are the bit error rate curves of adding BCH encoding and decoding, using the above two different mechanisms in decoding . It can be seen that the bit error rate of the system using the detection mechanism beyond the error correction capability of the present invention is ...

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 encoding method of a channel error correcting code BCH code and an RS code, belonging to the digital communication field, which comprises calculating an adjoint polynomial S(x) through a received code R(x), solving the Berlekamp key equation through the Euclid algorithm to obtain an error location polynomial sigma (x), and correctly encoding if the constant term sigma 0 in the error location polynomial sigma (x) is zero, or calculating the error locations and the relative error values through the Chien search if the constant term sigma 0 in the error location polynomial sigma (x) is not equal to 0, and being able to correctly encode if the number of searched error locations is equal to the largest error correcting capability thereof, or sending a warning indication signal whose error number of receiving signals exceeds the largest error correcting capability, and outputting original receiving codes. The encoding method avoids the condition that the more errors are corrected, the more errors existing when the receiving code error number exceeds the largest error correcting capability of the channel error correcting code, thereby reducing the error code rate of the whole communication system.

Description

technical field [0001] The invention relates to the channel error correction code technology in the field of digital communication, in particular to the decoding method of BCH (Bose Chaudhuri Hocquenghem) code and RS (Reed-Solomon) code. Background technique [0002] In the digital communication system, when the digital signal is transmitted on the actual channel, due to the unsatisfactory channel transmission characteristics and the interference of additive noise, the received digital signal will inevitably have errors. Channel error-correcting codes are a coding and decoding method designed to improve transmission quality and ensure reliability of information transmission. Its basic method is to add some check bits to the transmitted information sequence at the sending end, and these redundant check bits and information bits are related to each other through certain rules. The receiving end checks the relationship between the information bit and the check bit according to...

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/15H04L1/00
Inventor 冀烨吴毅凌赵玉萍李红滨
Owner PEKING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com