Puncturing algorithm of finite length LDPC (Low Density Parity Check) code

An LDPC code, finite technology, applied in the field of puncturing algorithms of finite-length LDPC codes, can solve problems such as large decoding errors, achieve overall decoding improvement, reduce error floor, and avoid low code rate decoding performance loss Effect

Active Publication Date: 2016-04-13
HUAQIAO UNIVERSITY
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This results in a higher probability of decoding errors for

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
  • Puncturing algorithm of finite length LDPC (Low Density Parity Check) code
  • Puncturing algorithm of finite length LDPC (Low Density Parity Check) code
  • Puncturing algorithm of finite length LDPC (Low Density Parity Check) code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] Below in conjunction with accompanying drawing, the present invention will be further described,

[0031] For a mother code whose code length is N and information bit length is K, its parity check matrix is

[0032] h m×n , (m=N-K, n=N), the concrete realization steps of the present invention are as follows:

[0033] Step 1: Calculate the number of information bits to be deleted according to the target code rate.

[0034] Let R' be the target code rate after punching, N p is the total number of parity bits that need to be deleted, which can be easily obtained according to the code rate definition:

[0035] R'=K / (N-N p )(1)

[0036] According to formula (1), the total number of information bits to be deleted is calculated as:

[0037]

[0038] Step 2: Select nodes with high decoding recovery reliability in all mother codes, and store them in the set PRIOR.

[0039] 2.1: All rows C in the parity check matrix i , i∈{1,...,m}, the number of 1s in each row, as the...

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 puncturing algorithm of a finite length LDPC (Low Density Parity Check) code. According to the puncturing algorithm, by extracting all nodes with high decoding recovery reliability from an original code, then reconstructing a to-be-deleted sequence having valid check information uniformly distributed, and then inserting the nodes with the high decoding recovery reliability into the to-be-deleted sequence according to a certain rule, the shortage of greedy selection in the traditional grading sorting algorithm is overcome, the loss of low bit rate decoding performance due to excessively uniform distribution is avoided, the overall decoding is improved and the error floor of the overall decoding is reduced.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a puncturing algorithm of a finite-length LDPC code. Background technique [0002] For time-varying wireless fading channels, the performance of channel coding with fixed code rate is not good. It can adapt to channel changes through adaptive coding and modulation technology, thereby increasing the transmission rate and approaching the Shannon capacity limit. That is, when the channel state is poor, low-code rate codewords and low-order modulation modes are used for transmission. When the channel state becomes better, high-code rate codewords and high-order modulation modes are used for transmission. The flexible conversion of the code rate in the adaptive coding and modulation technology is often realized by the rate-compatible technology, among which puncturing is the most important one of the rate-compatible technology. The principle is, given a low code rate mother c...

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
CPCH03M13/1131H03M13/6362
Inventor 周林黄伟成贺玉成陈晓鹏邱丽鹏鲁紫君
Owner HUAQIAO UNIVERSITY
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