Error correction method by using quasi-cyclic LDPC code based on Latin square
A technology of LDPC code and error correction method, which is applied in the field of quasi-cyclic LDPC code and channel quasi-cyclic LDPC code error correction, can solve the problems of not the best performance, performance difference, and high complexity, and achieve low error floor performance and complex The effect of low degree and less redundancy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0043] Example 1: For 2 that satisfy the row and column constraints 3 Order Latin square matrix, m=3, n=8, the elements in the fourth column of the second row are twice the elements in the third column; the elements in the sixth column are four times the elements in the third column; the elements in the eighth column It is the complement element of the element in the third column, that is, n-1 minus the element in the third column; the element in the seventh column is the complement element of the element in the fourth column, that is, n-1 minus the element in the fourth column; the above relationships are all in the modulo n- 1 under. Due to the existence of the above relationship, it is only necessary to determine the values of the elements in the third column and the fifth column to obtain the values of all other positions, that is, the position set Ψ={1, 3}, L=2.
[0044] Step 2, construct the second row of the Latin square matrix:
[0045] see image 3 As shown, th...
example 2
[0053] Example 2: For the 2 that satisfies the row and column constraints 3 Order Latin square matrix, m=3, n=8, according to the constraint relationship between the elements of each position described in Example 1, if the value of the third column element is 3, then the second behavior of the entire Latin square matrix can be obtained [0 -1 3 6 1 5 4 2].
[0054] Step 3, use the second row of the Latin square matrix to construct the entire Latin square matrix W:
[0055] (3a) The exchange of rows and columns of the Latin square matrix will not affect the performance of the quasi-cyclic LDPC code generated by it, so firstly, after the exchange of rows and columns, the elements on the diagonal are set to v i,i = -1, i ∈ {1, 2, ..., n-1};
[0056] (3b) Starting from the third row of the W matrix, it is generated row by row, and the element in row i+1 and column j+1 is generated from the element in row i and column j according to the following relationship:
[0057] v i,j =(v...
example 3
[0063] Example 3: For 2 that satisfy the row and column constraints 3 Order Latin square matrix, m=3, n=8, according to the second line of the given Latin square matrix of example 2, obtain whole Latin square matrix as follows:
[0064] - 1 0 1 2 3 4 5 6 0 - 1 3 6 1 5 4 2 1 ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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