Efficient low complexity high throughput LDPC decoding method and optimization
View Patent ↗A decoder and method for iteratively decoding of low-density parity check codes (LDPC) includes, in a code graph, performing check node decoding by determining messages from check nodes to variable nodes. In the code graph, variable node decoding is performed by determining messages from the variable nodes to the check nodes. The variable node decoding is independent from degree information regarding the variable nodes. Decoded results are output.
1. A method for iterative decoding of low-density parity check codes (LDPC), comprising:
in a code graph, performing check node decoding by determining messages from check nodes to variable nodes;
in the code graph, stored using a computer readable storage medium, performing variable node decoding by determining messages from the variable nodes to the check nodes wherein the variable node decoding is independent from degree information regarding the variable nodes; and
outputting decoded results.
2. The method as recited in claim 1 , wherein performing variable node decoding includes obtaining flipping threshold values for determining the results which are not based upon degree information of the variable nodes.
3. The method as recited in claim 1 , wherein performing variable node decoding includes obtaining a cost m k , which is a discrepancy between extrinsic inputs of variable nodes.
4. The method as recited in claim 3 , wherein the cost m k is determined as
m
k
(
ℓ
)
=
-
∑
j
∈
V
n
,
j
≠
k
u
c
->
v
,
j
(
ℓ
)
u
n
,
k
∈
V
n
,
where u c→v,j is the extrinsic message outputs from a check node along a jth edge to a variable node, v v→c,j , is an extrinsic message output from a variable node passed along a jth edge to a check node, u n is a channel message from the nth variable node, v n is a set of edges that are connected to the nth variable node, and k is an index of edges in a code graph.
5. The method as recited in claim 1 , wherein performing variable node decoding includes providing a decoding principle for variable nodes.
6. The method as recited in claim 5 , wherein providing a decoding principle for variable nodes includes
u
v
->
c
,
k
(
ℓ
+
1
)
=
{
-
u
n
if
m
k
(
ℓ
)
≥
d
,
u
n
,
otherwise
,
where v v→c,j , is an extrinsic message output from a variable node passed along a kth edge to a check node, u n is a channel message from the nth variable node, and d is a flipping threshold for the decoding of variable nodes.
7. The method as recited in claim 6 , wherein the flipping threshold is independent of degree information for variable nodes.
8. The method as recited in claim 6 , wherein the flipping threshold is constant for time-invariant decoding methods.
9. The method as recited in claim 6 , wherein the flipping threshold is varied in accordance with decoding iteration for time-variant decoding methods.
10. A decoder, utilizing a computer readable storage medium, for low-density parity check codes (LDPC), comprising:
a check node decoder configured to determine messages from check nodes to variable nodes in a code graph; and
a variable node decoder configured to determine messages from the variable nodes to the check nodes wherein the variable node decoder decodes variable nodes independently from degree information of the variable nodes.
11. The decoder as recited in claim 10 , wherein the variable node decoder includes flipping thresholds which are not based upon degree information of the variable nodes.
12. The decoder as recited in claim 10 , wherein the variable node decoder includes a cost m k which is determined from a discrepancy between extrinsic inputs of variable nodes.
13. The decoder as recited in claim 12 , wherein the cost m k is computed as
m
k
(
ℓ
)
=
-
∑
j
∈
V
n
,
j
≠
k
u
c
->
v
,
j
(
ℓ
)
u
n
,
k
∈
V
n
,
where u c→v,j is the extrinsic message outputs from a check node along a jth edge to a variable node, v v→c,j , is an extrinsic message output from a variable node passed along a jth edge to a check node, u n is a channel message from the nth variable node, v n is a set of edges that are connected to the nth variable node, and k is an index of the edge in the code graph.
14. The decoder as recited in claim 10 , wherein the variable node decoder includes a decoding principle for variable nodes.
15. The decoder as recited in claim 14 , wherein the decoding principle for variable nodes includes
u
v
->
c
,
k
(
ℓ
+
1
)
=
{
-
u
n
if
m
k
(
ℓ
)
≥
d
,
u
n
,
otherwise
,
where v v→c,j , is an extrinsic message output from a variable node passed along a kth edge to a check node, u n is a channel message from the nth variable node, and d is a flipping threshold for the decoding of variable nodes.
16. The decoder as recited in claim 15 , wherein the flipping threshold is independent of degree information for variable nodes.
17. The decoder as recited in claim 15 , wherein the flipping threshold is constant for time-invariant decoding methods.
18. The decoder as recited in claim 15 , wherein the flipping threshold is varied in accordance with decoding iteration for time-variant decoding methods.
19. The decoder as recited in claim 10 , wherein the decoder is implemented in a hardware circuit.