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

Blind identification method of circulation code grouping length

A technology of block length and cyclic code, applied in cyclic code, error correction/detection using block code, error correction/detection using linear code, etc., to achieve the effect of wide application, simple principle, and simple identification process

Inactive Publication Date: 2010-11-10
INST OF ELECTRONICS ENG CHINA ACAD OF ENG PHYSICS
View PDF1 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The method of code redistribution is only applicable to the case of low code rate, that is, the length of the message is much smaller than the length of the packet; the GFFT method judges the error correction ability of the code according to the GFFT result, and then inverts the packet length. This method is suitable for the original RS code , while for the binary BCH code it is not applicable

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
  • Blind identification method of circulation code grouping length
  • Blind identification method of circulation code grouping length
  • Blind identification method of circulation code grouping length

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0040] A blind identification method of the block length of the cyclic code, when identifying the block length n of the (n, k) cyclic code whose message length is k, first determine the frame length of the cyclic code as f l , and in [3, f l ], take the factor i as the grouping length for grouping, and the cyclic code will get N after being grouped i codewords, and then in the obtained N i Determine and count the proportion of valid codewords among the codewords, and the i value with the largest proportion of valid codewords is identified as the packet length n.

[0041] The judgment rules for valid codewords are:

[0042] gcd[c 0 (x),c 1 (x),...,c i-1 (x)]≠1

[0043] where c 0 (x) is the code polynomial corresponding to code word c, c j (x), j=1, 2, ..., i-1, is the code polynomial corresponding to the code word obtained after the code word c is cyclically shifted to the left j times; gcd[] represents seeking the greatest common divisor operation.

[0044] In this pa...

Embodiment 2

[0072] Taking the most commonly used binary BCH code and RS code in cyclic codes as examples, verify the recognition algorithm described in 2.

[0073] 1. (15, 11) binary BCH code

[0074] Knowing that the frame length is 75, its factors are 3, 5, 15, and 25. Counting 100 codewords respectively, the effective codeword ratios obtained are: 0.58, 0.55, 1.00, and 0.58, respectively. Obviously the packet length is 15.

[0075] 2. (15, 11) RS code

[0076] Knowing that the frame length is 75, its factors are 3, 5, 15, and 25. Counting 100 codewords respectively, the effective codeword ratios obtained are: 0.22, 0.24, 1.00, and 0.35, respectively. Obviously the packet length is 15.

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 blind identification method of the circulation code grouping length. When the grouping length n of (n, k) circulation codes with the message length k is identified, firstly, the frame length of circulation codes is determined to be fl, in addition, a factor i is taken from [3, fl] to be used as the grouping length to be grouped, Ni code characters can be obtained after the circulation codes are grouped, then, the proportion of effective code characters in the obtained Ni code characters is judged and counted, and the effective code characters refer to the code characters meeting the judging rules, wherein the maximum i value of the proportion of the effective code characters is identified into the grouping length n. The identification method of the invention has the advantages of simple principle, wide application range and the like. No matter the codes are system codes or non-system codes, are binary codes or multilevel codes, the grouping length can be identified by the method only if the codes are circulation codes meeting the circulation features and the frame length is known. At the same time, the method has a simple identification flow process, is very suitable for hardware realization, and is suitable for engineering application.

Description

technical field [0001] The invention relates to a blind identification method of the block length of a linear block code in channel coding, in particular to a blind identification method of the block length of a cyclic code. Background technique [0002] Cyclic codes are one of the most important subclasses of linear block codes. Because of their advantages such as simple encoding and decoding algorithms and good error correction effects, they are widely used in error control in many digital communication systems. For example, RS codes are used in DVB-S coding standard, and the binary BCH code has been adopted by DVB-S2. [0003] The code word length after linear block code encoding is also called block length. The blind identification of packet length is the basis of blind identification of cyclic codes, and the blind identification of channel coding is the premise of restoring the original information of communication, which occupies an important position in the analysis ...

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/15H04L1/00
Inventor 王甲峰岳旸权友波李蕾叶江峰肖任伟
Owner INST OF ELECTRONICS ENG CHINA ACAD OF ENG PHYSICS
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