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

Method for decoding low-density block check code

A check code, low-density technology, applied in the field of low-density packet check code decoding, can solve the problem of slow convergence speed of the MAP algorithm

Inactive Publication Date: 2007-01-03
PANASONIC CORP
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This algorithm has a slower convergence speed than the MAP algorithm of convolutional codes.

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
  • Method for decoding low-density block check code
  • Method for decoding low-density block check code
  • Method for decoding low-density block check code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0019] specific implementation

[0020] The present invention will be described in further detail below in conjunction with the accompanying drawings and specific embodiments.

[0021] figure 1 A simple example of using a bipartite graph to represent a low density check code is given. LDPC code is a kind of linear block code based on sparse parity check matrix. In 1981, Tanner proposed to use a bipartite graph to represent a low-density linear block code. Since then, the bipartite graph has become the main tool for analyzing LDPC codes. Assuming an LDPC code, the information bit length is K, the code length is N, and the parity bit is M=N-K, then the parity check matrix A of the code is a matrix with a size of M*N. The bipartite graph of H is described as follows: the N nodes below the bipartite graph represent N codewords and become message nodes (massage nodes); the M nodes above represent M check formulas and are called check nodes. . When the lower information node an...

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

This invention provides a decode method for low density packet checking codes, which tests the likelihood ratio output by information nodes in the period of an iterative decoding of sum product algorithm to adaptively output the hard judgment value of reliable information node directly and stops refreshment to reliable information nodes in the successive iterative period to reduce the operation volume.

Description

technical field [0001] The invention relates to channel decoding in the communication field, in particular to a decoding method of a low-density block check code. Background technique [0002] Low Density Parity-Check Code (LDPC Code) is a powerful forward error correction coding method rediscovered in the past ten years. It has approached the Shannon limit under the condition of long code construction, so it is considered It is an effective replacement technology for Turbo codes, and it is likely to be used in the next generation of mobile communications and deep space communications. [0003] Gallager proposed low density block check code in 1962. The LDPC code is a code defined based on a supervisory matrix, which has the following characteristics: each column contains a small fixed number of 1s j>=3, and each row contains a small fixed number of 1s k>j. Gallager proves that the typical minimum distances of these codewords increase linearly with the code length, a...

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/11H03M13/19H03M13/00
Inventor 吴湛击李继峰
Owner PANASONIC CORP
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