Low complexity quasi-cyclic LDPC code designing method based on mask operation

An LDPC code, low-complexity technology, applied in the field of channel coding, which can solve the problem of high coding complexity

Inactive Publication Date: 2014-05-28
YANCHENG TEACHERS UNIV
View PDF5 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0017] 2. The quasi-cyclic LDPC code constructed by the finite field method proposed by the ShuLin research group, its parity check matrix cannot be directly used ...

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
  • Low complexity quasi-cyclic LDPC code designing method based on mask operation
  • Low complexity quasi-cyclic LDPC code designing method based on mask operation
  • Low complexity quasi-cyclic LDPC code designing method based on mask operation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] The present invention will be described in detail below in conjunction with specific embodiments.

[0037] Based on the design of the finite field method, the present invention proposes a quasi-cyclic LDPC code design method based on the finite field mask in combination with the property that the Tam structure can perform simple recursive coding.

[0038] Such as figure 1 As shown, assume that in the finite field GF(2 q ) to construct a check matrix, the complete check matrix H (1) size is (q-1) 2 ×(q-1) 2 , H FF is a parity check matrix constructed according to the specified code length and code rate, its size is ML×NL, E(H FF ) is its corresponding exponent matrix, the matrix size is M×N, E(H FTM ) is the exponential matrix of the quasi-cyclic LDPC code constructed by the FTM (Finite Field, Tam, Masking) method proposed by the present invention, H FTM Its corresponding check matrix, B(H) is the base matrix corresponding to matrix H, that is, the non-zero elemen...

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 low complexity quasi-cyclic LDPC code designing method based on mask operation. According to the low complexity quasi-cyclic LDPC code designing method based on the mask operation, a finite field method and a Tam structure are combined, quasi-cyclic LDPC codes constructed through the method retains the excellent properties of quasi-cyclic LDPC codes constructed through the infinite field method, a check matrix of the quasi-cyclic LDPC codes constructed through the method further has the Tam structure capable of carrying out simple recursion coding, and the quasi-cyclic LDPC codes constructed through the method are suitable for hardware implementation and have significant application potential in mobile communication and wireless sensor networks of a future new generation. Furthermore, the performance of the BER (bit error rates) of the quasi-cyclic LDPC codes constructed through the method is better than that of quasi-cyclic LDPC codes given by Tam and quasi-cyclic LDPC codes in IEEE802.16e under equal conditions.

Description

technical field [0001] The invention relates to the technical field of channel coding, in particular to a method for constructing a quasi-cyclic low density parity check code (Quasi-Cyclic Low Density Parity Check, QC-LDPC). Background technique [0002] LDPC (Low Density Parity Check) codes are a class of linear block error correction codes that can be defined by a very sparse Parity-check matrix or Bi-Partite graph (bipartite graph). The decoding complexity of LDPC codes is lower than that of turbo codes, and It can realize complete parallel operation, so it is suitable for hardware implementation, and can provide excellent performance closer to Shannon limit than Turbo code. LDPC codes have attracted great attention from academic circles and IT industries all over the world in various aspects such as deep space communication, 4th generation mobile communication systems, high-speed and very high-speed digital subscriber lines, magnetic recording systems and even power line...

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
IPC IPC(8): H03M13/11
Inventor 徐华
Owner YANCHENG TEACHERS UNIV
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