Quasi-cyclic matrix and construction method thereof
A technology of quasi-circular matrix and construction method, which is applied in the field of channel coding in wireless communication, can solve problems such as inapplicability and high parallelism of decoders, and achieve the effects of reducing parallelism, wide application range, and reducing the number of short loops
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0039]A quasi-circular matrix 100, applied to channel coding in wireless communication, such as figure 1 As shown, it includes multiple first-level sub-matrices and multiple second-level sub-matrices located in each first-level sub-matrix, where each first-level sub-matrix is obtained by weighted cyclic shift extension based on the base matrix, and each second-level sub-matrix The sub-matrix is obtained by extending the weighted cyclic shift twice based on the first-level sub-matrix where it is located.
[0040] like figure 1 In , the size of each first-level sub-matrix is q 1 ×q 1 , the size of each secondary sub-matrix is q 2 ×q 2 , each first-level sub-matrix nests multiple second-level sub-matrices to form a q 1 ×q 2 matrix, the number of columns of the quasi-circular matrix constructed finally is ρ×q 1 ×q 2 , the number of rows is σ×q 1 ×q 2 , where ρ and σ are the number of columns and rows of the above base matrix, respectively.
[0041] The quasi-cir...
Embodiment 2
[0043] A construction method 200 of the above-mentioned quasi-circular matrix, such as figure 2 shown, including:
[0044] Step 210, based on the number of row weights, column weights and number of short rings of the quasi-circulant matrix to be constructed, construct a first base matrix and a second base matrix storing cyclic shift values and a third base matrix storing each weight value ;
[0045] Step 220, using the first base matrix and the second base matrix in sequence, and extending the third base matrix twice to obtain a quasi-circular matrix to be constructed.
[0046] The present embodiment proposes a method of constructing a quasi-circular matrix that can realize a small-size sub-matrix, based on the quasi-circular matrix (row weights: the number of non-zero elements in a row; column weights: the number of non-zero elements in a row) based on actual needs number; a ring refers to a ring structure starting from a non-zero element in the encoding matrix and retur...
example 1
[0082] Example 1, set ρ=σ=8, q 1 =63,q 2 =11, the weight set of the matrix is not limited, and can be selected according to the specific encoding method. The first basis matrix A is constructed based on the Latin algorithm of the Galois field GF(64). The Latin algorithm will generate a 64×64 Latin square matrix, the elements on the main diagonal are -∞, and the elements in other positions are taken as The value is from 0 to 62, then select 56×8 elements without -∞ value from the upper right corner of the Latin square matrix to form matrix A', and then select 8 rows from matrix A' to construct the first base matrix A (specifically, select 8 rows from 56 rows to form the first basic matrix A, calculate the same CP-2g number of the first basic matrix A and the second basic matrix B, and select the first basic matrix A with the least number of CP-2g Fundamental matrix A). The second basic matrix B is constructed based on the array code matrix algorithm. First, an array code m...
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