Low Complexity LDPC Encoding Algorithm
AssigneeLSI Logic Corporation
InventorsSergey Gribok, Alexander Andreev, Igor Vikhliantsev
Life of this patent
Estimating the term…
Abstract
A method of encoding a binary source message u, by calculating x:=Au, calculating y:=B″x, resolving the equation Dp=y for p, and incorporating u and p to produce an encoded binary message v, where A is a matrix formed only of permutation sub matrices, B′ is a matrix formed only of circulant permutation sub matrices, and D is a matrix of the form D = ( T 0 ⋯ 0 0 0 T ⋯ 0 0 ⋯ ⋯ ⋯ ⋯ ⋯ 0 0 ⋯ T 0 I I ⋯ I I ) where T is a two-diagonal, circulant sub matrix, and I is an identity sub matrix.
Claims15
A method of encoding a binary source message u, the method comprising the steps of:
- 1. calculating x:=Au,
- 2. calculating y:=B′x,
- 3. resolving the equation Dp=y for p, and
- 4. incorporating u and p to produce an encoded binary message v, where
- A is a matrix formed only of permutation sub matrices,
- B′ is a matrix formed only of circulant permutation sub matrices, and
- D is a matrix of the form
- D
- =
- (
- T
- 0
- ⋯
- 0
- 0
- 0
- T
- ⋯
- 0
- 0
- ⋯
- ⋯
- ⋯
- ⋯
- ⋯
- 0
- 0
- ⋯
- T
- 0
- I
- I
- ⋯
- I
- I
- )
- where
- T is a two-diagonal, circulant sub matrix, and
- I is an identity sub matrix.
In a parity check matrix of the type used for an LDPC encoding method, where the parity check matrix is formed entirely of non-overlapping sub matrices, the improvement comprising the sub matrices are all permutation matrices.
In an LDPC encoding method, the improvement comprising converting a stream of digital information to a coded stream of digital information using a parity check matrix that is formed entirely of non-overlapping sub matrices, where the sub matrices are all permutation matrices.
Dependencies are inferred from the claim text.