Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Hard decision bit flipping decoding algorithm for LDPC code

An LDPC code and decoding algorithm technology, which is applied in the field of high-performance and low-complexity hard-decision bit-flip decoding algorithms, can solve problems such as poor decoding performance and cannot meet actual communication needs, and achieves reduced impact and capture. Probabilistic and reliable decoding algorithms

Inactive Publication Date: 2019-03-22
NANJING UNIV
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Nevertheless, in the environment where soft messages are not available, such as binary symmetric channel (BSC), the decoding performance of the algorithm is still poor and cannot meet the actual communication needs

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
  • Hard decision bit flipping decoding algorithm for LDPC code
  • Hard decision bit flipping decoding algorithm for LDPC code
  • Hard decision bit flipping decoding algorithm for LDPC code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0051] Embodiment: Take the codeword whose code length is 1296, code rate is 1 / 2, row weight is 8, and column weight is 4 as an example. The code word passes through the BSC channel, the channel flipping probability is α, the sending end adopts BPSK modulation, and the receiving end adopts the bit flipping algorithm based on gradient descent respectively. And algorithm, using Monte Carlo method for simulation. The hard-decision decoding algorithm above has a maximum number of iterations of 300, and the last one is a soft-decision decoding algorithm with a maximum number of iterations of 20. Figure 5 For the obtained FER performance simulation curve. It can be seen that compared with the hard-decision decoding algorithm, the algorithm disclosed in the present invention has a great performance improvement, and can obtain a decoding performance close to that of the OMS algorithm. Therefore, the algorithm disclosed in the present invention makes up the performance gap between s...

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 relates to a hard decision decoding algorithm for an LDPC code. The method comprises the following steps of computing a checksum at the beginning of each iteration, and judging whether the decoding is finished or not according to the checksum and current iterations; and for each code element in a current decoding code word, firstly, judging whether the code element is equal to the corresponding code element in the received code word or not; secondly, computing the sum of checksum values connected to the code element; and thirdly, generating a random penalty term with a value of 0or 1 based on a preset probability value. The sum of the three parts is an energy value of the code element. The energy value reflects the reliability of each code element, and the code element withthe largest corresponding energy value will be turned over. According to the algorithm, only hard messages need to be used for decoding, so that the decoding complexity is very low. Through the application of the algorithm, the probability that the hard decision decoding is trapped in a capturing set can be greatly reduced. In the case that a soft message, such as a BEC channel, cannot be obtained, the error correction capability of the transmission data is greatly improved through the decoding algorithm disclosed by the invention.

Description

Technical field [0001] The invention relates to a decoding algorithm in the technical field of communication coding, in particular to a high-performance and low-complexity hard-decision bit-flip decoding algorithm for LDPC codes in the communication field. Background technique [0002] In the current communication system, the signal is generated by the source and reaches the receiver after being transmitted through a noisy channel. Therefore, the received signal is interfered, and the noise will make some information in the received signal inconsistent with the transmitted signal, resulting in the received information not being desired. In order to ensure the consistency of received information and transmitted information, channel coding technology is introduced in the communication system to overcome the influence of noisy channels on transmitted information. This technology adds some redundant check bits to the sent signal, and the receiving end uses these check bits to d...

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/1108
Inventor 王中风崔航轩林军
Owner NANJING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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