Coding and decoding using LDPC quasi-cyclic codes
A technology of codewords and diagonal lines, applied in the field of data transmission, can solve problems such as constrained LDPC
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0058] An example of an implementation of the present invention is described below with reference to the numerals employed in the drawings.
[0059] In theory, the problems that the inventive process aims to solve include the successful use of low-cost hardware implementations and LDPC codes to optimize error correction in data communications.
[0060] LDPC codes are linear codes that operate on blocks of data. The code is defined by its parity check matrix H. In this implementation example, the code is a binary code, and the invention can be generalized to codes over any Galois field GF(q), where q > 2.
[0061] In transmission, a data block consists of K bits. The data blocks are designated as u=[u(0), u(1), . . . , u(K-1)]. After applying the method of the present invention, a word with a linear code v=[v(0), v(1), . . . , v(N-1)] (where N<K) of N bits is generated. The code is generated by the product v=uG, where G is the binary matrix KxN - the generator of the LDPC c...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 