Information processing method of low-density check codes
A technology of low-density check code and information processing method, applied in the field of information processing of low-density check code, can solve the problems of slow processing speed, complex processing, high cost, etc., to reduce power consumption, reduce hardware resources, and reduce costs Effect
Patent Information
- Authority / Receiving Office
- CN · China
- Current Assignee / Owner
- Publication Date
- 2010-09-01
- Estimated Expiration
- Not applicable · inactive patent
Smart Images
Figure 1 Figure 2 Figure 3
Abstract
Description
technical field
[0001] The invention relates to a method in the technical field of communication, in particular to an information processing method of a low-density check code. Background technique
[0002] LDPC codes (low density parity check codes, low density check codes) are a coding technique first proposed by Gallager in 1963, which can be used as an error correction / error detection technique for various communication systems or information storage systems. Because of its performance approaching the channel limit, it has become a popular technology that has attracted the most attention in the past decade. LDPC code decoders usually have three structural forms: serial structure, full parallel structure, and partial parallel structure. The serial structure LDPC code decoder has a simple structure and consumes less hardware resources, but the decoding speed is slow and the throughput is low; the fully parallel structure has a fast decoding speed and high throughput, but ...
Examples
Embodiment
[0026] This embodiment includes the following steps:
[0027] In the first step, the sending end rotates and adjusts the check matrix H1 of the low-density check code to obtain the processed matrix H2.
[0028] The check matrix H1 of the low-density check code in this embodiment is a matrix of 4*16 rows and 8*16 columns, specifically as figure 1 As shown, where: the blank place means 0, and the dotted place means 1.
[0029] The described rotation adjustment process includes the following steps:
[0030] 1) Convert the parity check matrix H1 of the 4*16 rows and 8*16 columns low-density check code into a mother matrix M1 of 4 rows and 8 columns, each element in the mother matrix M1 represents a 16*16 matrix, Wherein: when the matrix of 16*16 is a zero matrix, the corresponding element in the mother matrix M1 is -1; otherwise, the element of the mother matrix M1 is the cyclic shift factor of the 16*16 cyclic shift identity matrix;
[0031] The mother matrix M1 obtained in th...