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

Method for rapidly sorting tree graph

A tree diagram, a fast technology, applied in the direction of using block codes for error correction/detection, data representation error detection/correction, error detection coding using multiple parity bits, etc., can solve the problem that the number of tree diagrams cannot be determined, The problem of high complexity of tree graph decomposition method

Active Publication Date: 2008-11-05
SHANGHAI RES CENT FOR WIRELESS TECH
View PDF3 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the prior art provided in the above literature does not consider how the convergence speed will change if each tree in the decomposed dendrogram contains different numbers of check nodes and variable nodes, and does not consider how to perform dendrogram Decomposition can get the fastest convergence speed, because the tree diagram decomposition method is very complex, it is difficult to decompose a TANNER diagram obtained by random search into any desired number of tree diagrams, and it is impossible to determine the decomposition obtained before the decomposition. number of tree diagrams

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 rapidly sorting tree graph
  • Method for rapidly sorting tree graph
  • Method for rapidly sorting tree graph

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0022] When the base matrix of the quasi-cyclic LDPC code obtained by random search has a sub-matrix of size M×N, a 2×N sub-matrix of the following form appears, and only two columns of these two rows have non-negative elements at the same time, and there are no other columns With non-negative elements present on both rows, the submatrix has the form:

[0023] a 1 - 1 a 2 a 5 . . . a 3 a 6 ...

no. 2 example

[0031] When the base matrix of the quasi-cyclic LDPC code obtained by random search has a sub-matrix with a size of M×N, a 3×N sub-matrix of the following form appears.

[0032] a 1 - 1 a 2 a 3 a 4 - 1 - 1 a 5 a 6 - - - ( 4...

no. 3 example

[0036] Finally, please refer to the literature [8] "Sunghwan Kim and Jong-Seon No, "Construction of Protographs for QC LDPC Codes With Girth Larger Than 12", IEEETRANSACTIONS ON INFORMATION THEORY, VOL.53, NO.8, AUGUST2007.", by Literature [8] shows that if the parity check matrix exists as a b c d e f , and the element values ​​have no negative numbers, then no matter how the elements a, b, c, d, e, f of the cyclic shift matrix take values, there will always be a cycle of length 12, so in order to decompose the obtained tree The size of the tree should be as large as possible, and the number of trees should be as small as possible. The sub-matrix selected from the base matrix for the decomposition of the tree graph should avoid appearing in the form of ...

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 fast tree graph decomposition method for decomposing the TANNER graph corresponding to the quasi-cyclic low density parity check code into the tree graph with expected number, wherein the method includes the steps of: decomposing the basic matrix corresponding to the quasi-cyclic LDPC code according to the set mode, then decomposing the matrix into the tree graph with expected number, thereby decomposing the TANNER graph of the quasi-cyclic LDPC code into the tree graph with expected number. The fast tree graph decomposition method of the invention conveniently performs the tree graph decomposition and the serial decoding to the constructed quasi-cyclic LDPC code, and proves that the number of the ZIGZAG tree graph is less through the simulation, the required iteration times are fewer, the convergence speed is higher, in addition, the invention adopts the less tree graph decomposition method which has the convergence speed two times higher than that of the flood information transfer algorithm.

Description

technical field [0001] The invention relates to channel coding theory, graph theory and finite field theory, and specifically relates to a fast tree diagram decomposition method. Background technique [0002] Flood information transmission strategy is a commonly used information transmission method in iterative decoding algorithm. In one iteration, all variable nodes transmit initial information to adjacent check nodes, and then all check nodes transmit information to their adjacent variable Nodes, in each iteration, the variable nodes update the information of the adjacent check nodes according to the new information and channel information obtained in the previous iteration; the check nodes use the new information obtained in the current iteration to update the information. [0003] In recent years, in order to increase the convergence speed of information transmission, various fast-converging information transmission strategies have been developed based on the flood infor...

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/11
Inventor 周秦英李明齐杨曾徐其
Owner SHANGHAI RES CENT FOR WIRELESS TECH
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