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

Active Publication Date: 2019-09-10
HUAZHONG UNIV OF SCI & TECH
View PDF9 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The present invention provides a quasi-circular matrix and its construction method to solve the problem that the existing quasi-circular matrix used in channel coding needs to have a larger sub-matrix to reduce the number of short loops in order to improve the performance of the decoding algorithm of the decoder. , and the large-size sub-matrix will lead to a technical problem that the parallelism of the decoder is too large and cannot be applied to resource-constrained circuit systems

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
  • Quasi-cyclic matrix and construction method thereof
  • Quasi-cyclic matrix and construction method thereof
  • Quasi-cyclic matrix and construction method thereof

Examples

Experimental program
Comparison scheme
Effect test

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...

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 quasi-cyclic matrix and a construction method thereof applied to channel coding in wireless communication.The quasi-cyclic matrix comprises a plurality of first-level sub-matrixes and a plurality of second-level sub-matrixes located in each first-level sub-matrix, each first-level sub-matrix is obtained through weighted cyclic shift expansion based on the base matrix, andeach second-level sub-matrix is obtained through weighted cyclic shift expansion based on the first-level sub-matrix where the second-level sub-matrix is located. The quasi-cyclic matrix is composedof two stages of sub-matrixes, and each secondary sub-matrix is obtained through secondary expansion according to a primary expansion mode based on the primary sub-matrix where the secondary sub-matrix is located, so that the parallelism degree of the decoder can be greatly reduced by reducing the size of the secondary sub-matrix, and different node parallelism degree requirements of the decoder are met; besides, the number of short rings in the quasi-cyclic matrix can be effectively reduced by selecting appropriate shift values of the first-level sub-matrix and the second-level sub-matrix, and compared with a traditional quasi-cyclic matrix, the quasi-cyclic matrix is wide in application range.

Description

technical field [0001] The invention belongs to the field of channel coding in wireless communication, and more specifically relates to a quasi-circular matrix and a construction method thereof. Background technique [0002] In a wireless transmission system, in order to achieve higher receiving performance, it is necessary to use channel coding technology. Many high-performance codes, such as Low-Density Parity-Check Codes (LDPC) and Rate Compatible Modulation (Rate Compatible Modulation, RCM), etc., can be represented by sparse matrices, and the structure of the matrix determines the Encoding performance and decoder structure. [0003] One of the sparse matrices is the sparse quasi-circular matrix, which is a special matrix form consisting of multiple cyclically shifted sub-matrices. By selecting appropriate sub-matrix shift values, the quasi-circular matrix can be obtained and randomly constructed The matrix is ​​close to the performance. Moreover, the quasi-circular s...

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
CPCH03M13/116
Inventor 鲁放董燕于博
Owner HUAZHONG UNIV OF SCI & TECH
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap