Low-complexity rate-compatible 5g LDPC encoding method and encoder
A technology with low complexity and coding method, which is applied in the field of error correction of wireless communication systems, and can solve the problems of high coding hardware complexity, excessive hardware resource consumption, and low coding performance.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0035] With the promotion of the standardization work of the fifth generation mobile communication system, LDPC code has become the channel coding and decoding scheme for data transmission of the fifth generation communication system (5G). method, and the traditional encoding method is not compatible with all the parity check matrices of the 5G standard. In view of these problems, the present invention proposes a low-complexity code rate compatible 5G LDPC encoding method and encoder through research and innovation.
[0036] The present invention is firstly a low-complexity LDPC (low-density parity-check code) encoding method based on the 5G standard, which satisfies that the product of the parity-check matrix and the codeword is always equal to 0, that is, H×c T =0, where the parity-check matrix H under the 5G standard is a block matrix whose row block is M and the number of column blocks is N, and the block matrix is a quasi-cyclic shift matrix whose size is Z*Z, expressed ...
Embodiment 2
[0052] The low-complexity LDPC encoding method based on the 5G standard is the same as that in Embodiment 1, and the relationship between the parity check matrix and the code word is H×c T = 0 can derive the first parity symbol (R means ), the second parity symbol where the second parity symbol P 2 The calculation translates into the second sub-matrix as Combination with the fourth sub-matrix B and the K information bit groups S and parity symbols P 1 The combination The multiplication operation simplifies the operation structure, thereby obtaining the code word and completing the encoding.
[0053] The second parity symbol P 2 If the calculation of the ordinary calculation method is used, that is, the matrix B and P 1 multiply plus matrix Multiplying with S, the calculation process is relatively complicated, which is not conducive to parallel processing. The present invention converts this formula into a matrix expression form to be more concise, which is bene...
Embodiment 3
[0055] The low-complexity LDPC encoding method based on the 5G standard is the same as that in Embodiment 1-2, since the first parity symbol P 1 The calculation of needs to inverse the sub-matrix A. Carefully observe the sub-matrix A and you can find that the matrix has a special structure. The particularity is that A has a double-diagonal structure, and the absolute value of the double-diagonal elements is 1, so the first The multiplication operation of the inverse of the three-sub-matrix A and the intermediate vector R can be converted into an operation of circularly shifting right by 1 bit and combining and accumulating each group of the R vector.
[0056] For the inverse operation of the sub-matrix A, if the complexity of the matrix inversion operation using the traditional method is very high, the present invention converts the inverse of A and the intermediate vector R into a multiplication operation for the R vector according to the special structure of the matrix A Eac...
PUM
![No PUM](https://static-eureka.patsnap.com/ssr/23.2.0/_nuxt/noPUMSmall.5c5f49c7.png)
Abstract
Description
Claims
Application Information
![application no application](https://static-eureka.patsnap.com/ssr/23.2.0/_nuxt/application.06fe782c.png)
- 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