Method for consitituting sparse generative matrix and method for coding low-density block check code

A technology for generating matrices and sparse matrices, which is applied in the fields of constructing sparse generating matrices, coding of low-density block check codes, and channel coding.

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

AI Technical Summary

Problems solved by technology

[0030] The above coding methods all require complex mathematical operations of sparse mat

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 consitituting sparse generative matrix and method for coding low-density block check code
  • Method for consitituting sparse generative matrix and method for coding low-density block check code
  • Method for consitituting sparse generative matrix and method for coding low-density block check code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] specific implementation

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

[0051] 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 H of the code is a matrix with a size of M*N. The bipartite graph of the parity check matrix H is described as follows: the N nodes on the bottom of the bipartite graph represent N codewords and become message nodes (massage nodes); the M nodes on the top represent M check formulas and are called check nodes...

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 discloses a method for generating matrixes including: a, randomly generating a sparse matrix P of k lines and n-k columns, b, getting a generated matrix G=[Ik P] from said sparse matrix P, checking the matrix H=[PT In-k], in which, Ik is the unit matrix of k lines and k columns, the PT is the transposed matrix of P, c, carrying out initial transformation to said checked matrix H to let it meet the preset re-distribution of columns to get the transformed check matrix H, d, checking if there are short rings in the matrix H, e, recording the corresponding lines and columns of the short rings in H to further get the numbers corresponding to said short rings in H so as to further find out numbers corresponding to those in the random matrix P and H, f, regulating the code re-distribution corresponding to said line and column number in P, g, repeating said step b to f and short rings do not exist in H.

Description

technical field [0001] The invention relates to channel coding in the communication field, in particular to a method for constructing a sparse generation matrix and a corresponding low-density block check code coding method. 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 distance...

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