Method for decoding broadcast channel (BCH) codes

A BCH code and decoding technology, applied in the field of BCH code decoding, can solve the problem of not meeting the needs and the like

Inactive Publication Date: 2012-03-28
NEOLINK COMM TECH HANGZHOU
View PDF2 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In the DMR protocol, the transmission of each time slot requires 48 bits, and in addition to the 18 protection bits, 30 bits for carrying information are also required to be transmitted together, but in reality, only 9 bits carry information , cannot meet the needs

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
  • Method for decoding broadcast channel (BCH) codes
  • Method for decoding broadcast channel (BCH) codes
  • Method for decoding broadcast channel (BCH) codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0053] A decoding method of a BCH code, comprising the following steps:

[0054] S1: Provide a BCH (30, 9, 12) code, and the BCH (30, 9, 12) code belongs to GF (2 5 ) field, the BCH (30, 9, 12) code is obtained by adding a parity bit to the shortened code BCH (29, 9) of the original BCH (31, 16), and the BCH (30, 9, 12) can be Correct all mistakes less than or equal to 5.

[0055] S2: Construct the generator polynomial of BCH (30,9,12) code, described generator polynomial is:

[0056] g(X)=X 20 +X 18 +X 17 +X 13 +X 10 +X 9 +X 7 +X 6 +X 4 +X 2 +1 for its α, α 2 , α 3 ,...,α 10 for the root.

[0057] S3: Obtain the receiving polynomial r(X) according to the generating polynomial of S2,

[0058] r(X)=r n-1 x n-1 +...r 2 x 2 + r 1 x 1 + r 0 ;

[0059] S4: Calculate syndrome S by receiving polynomial r(X), syndrome S=(S 1 , S 2 ,...,S 2t );

[0060] S5: Determine the error polynomial σ(X) from the syndrome S,

[0061] σ(X)=(1+β v X)...(1+β 2 X)(1+β 1...

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 a method for decoding broadcast channel (BCH) codes. The method comprises the following steps of: S1, supplying BCH (30, 9, 12) codes, wherein the BCH (30, 9, 12) codes are acquired by adding a parity check bit onto shortened codes BCH (29, 9) of the original BCH (31,16); S2, constructing the generating polynomial of the BCH (30, 9, 12) codes, wherein the generating polynomial is as follows: g(X)=X20+X18+X17+X13+X10+X9+X7+X6+X4+X2+1; and in the generating polynomial, a, a2, a3,..., and a10 are used as roots; S3, obtaining a receiving polynomial r(X)=rn-1Xn-1+...r2X2+r1X1+r0 according to the generating polynomial in the step 2; S4, calculating a corrector S according to the receiving polynomial, wherein the corrector S=(S1,S2,..., and S2t); 5, determining an error polynomial sigma(X), wherein sigma(X)=(1+betavX)...(1+beta2X)(1+beta1X)=sigmavXv+...+sigma2X2+sigma1X+sigma0; and S6, calculating the root of the sigma(X), determining the number of error positions, and correcting the error of the r(X), wherein v is the number of errors; and beta1, beta2,..., and betav are the error positions.

Description

technical field [0001] The invention relates to the communication field of wireless communication systems, in particular to a decoding method of a BCH code in wireless simulcasting technology. Background technique [0002] In the DMR protocol, 30ms data is a frame, including 288bit. In the wireless digital simulcasting technology, a frame of data is sent in 6 time slots, and each time slot contains 5 ms of data, that is, 48 ​​bits. In practical applications, some data is required for power up and distance protection. In this technology, 18bit is used for this function, and 30bit is valid information. [0003] BCH codes are a class of good linear error correction codes found so far. Its error correction ability is very strong, especially under short and medium code lengths, its performance is very close to the theoretical value, and its structure is convenient and its encoding is simple. The decoding of BCH codes has always been one of the most interesting topics in the st...

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
Inventor 戎骏戴辉发盛建峰吴峰
Owner NEOLINK COMM TECH HANGZHOU
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