Encoding method, encoder, and transmitter

Abstract

An encoding method by which an encoding speed is improved is disclosed. An encoder (100) comprises an input data storage section (107) for outputting the stored input data (D100) according to an output control signal (108), an input data count section (101) for counting the inputs of input data (D100), an output control section (102) for controlling the output destination of the input data (D100)according to the input counts, one-bit storage sections (103-1 to 103-(N-K)) for holding one-bit data, row-vector storage sections (104-1 to 104-K) for holding row vectors of an LDPC code creation matrix, vector multiplying sections (105-1 to 105-K) for multiplying a row vector and a column vector, a parity storage section (109) for holding a parity created by the multiplication, and an LDPC code-word series creating section (106) for creating an LDPC code word from the input data series and parity series and outputting it.

Description

technical field [0001] The present invention relates to an encoding method, an encoding device and a sending device, in particular to an encoding method, an encoding device and a sending device for generating parity bits of input data based on a check matrix of an LDPC (LowDensity Parity Check) code as a standard . Background technique [0002] In recent years, an LDPC code defined by a parity check matrix has been used as an error correction code (Error Correction Code). The LDPC code is a linear code defined by a very coarse check matrix, that is, a check matrix with very few non-zero elements in the matrix. The prior art performs encoding directly on the basis of such a check matrix. [0003] Specifically, in existing codes such as figure 1 When the check matrix shown above generates parity bits, the determinant is transformed to reduce the number of operations (for example, Non-Patent Document 1). [0004] figure 1 The LDPC check matrix is ​​a matrix with q rows and...

AI Technical Summary

Problems solved by technology

[0027] However, in the methods described in Non-Patent Document 1 and Non-Patent Document 2, there is a problem that it is difficult to perform parallel processing because the parity bit is obtained by solving the recurrence formula, and as a result, it is difficult to improve the efficiency of encoding. calculation speed

Images