LDPC code inspection matrix generation method

A technology for checking matrix and decoder, which is applied in the direction of error detection coding, check code calculation, coding and other directions applying multiple parity bits, and can solve problems such as unstable characteristics
CN100539442CInactive Publication Date: 2009-09-09MITSUBISHI ELECTRIC CORP

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
MITSUBISHI ELECTRIC CORP
Publication Date
2009-09-09
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The check matrix generation method for LDPC codes of the present invention analyzes the "Sum-Product Algorithm" of LDPC codes by assuming that the log-likelihood ratio of the input and output data in the decoder can be approximated to a Gaussian distribution, and obtains the error that becomes zero. SNR threshold (threshold), by using a linear programming method to search for the optimal population of the weight of the row and the weight of the column, so that the Gaussian noise becomes the maximum when the encoding rate is fixed, and the check matrix for the LDPC code is generated according to the population .
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to a method for generating a check matrix for an LDPC code in an encoder using an LDPC (Low-Density Parity-Check code) code as an error correction code. Background technique

[0002] Figure 13 is a diagram representing an LDPC encoding / decoding system. Figure 13 Middle: 101 is an encoder, 102 is a modulator, 103 is a communication path, 104 is a demodulator, and 105 is a decoder. Here, before explaining the conventional check matrix generation method for LDPC codes, the flow of encoding and decoding when LDPC codes are used will be described.

[0003] First, an inspection matrix H is generated in the encoder 101 on the transmitting side by a predetermined method described later. Then, the generator matrix G is solved based on the following conditions.

[0004] G: k×n matrix (k: information length, n: code word length)

[0005] GH T = 0 (T is the transpose matrix)

[0006] Thereafter, in the encoder 101, a message (m 1 m 2...

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