Node processor for use with low density parity check decoder using multiple variable node degree distribution codes
View Patent ↗A decoding system for use with different degree parity constraint nodes and highly parallel processing operates by passing messages to variable nodes based on updated states of first and second check nodes, processing messages from the variable nodes and updating states of first and second check nodes in a decoder with Z processors that operate in parallel, further processing the updated state information for the second check nodes to coordinate the states of N=Z/z sets of second check nodes, where z is the number of bits associated with the second check nodes, and repeating the process utilizing the coordinated states of the second check nodes as the updated states of the second check nodes.
1. A method of decoding a data block comprising
processing messages from variable nodes corresponding to the block of data and updating states of Z first check nodes and z second check nodes with Z processors included in one or more hardware components
where z corresponds to z bits associated with the z second check nodes and Z corresponds to a number of processors that operate in parallel where Z is greater than z; and
providing messages to the variable nodes based upon the updated states of the Z first check nodes and the z second check nodes.
2. The method of claim 1 wherein the second check nodes in combination with the first check nodes are associated with a higher variable node degree distribution code than the first check nodes operating without the second check nodes.
3. The method of claim 2 wherein the first check nodes are associated with a low density parity check code.
4. The method of claim 3 wherein the second check nodes are associated with one or more single parity check codes.
5. A decoder comprising
first check nodes and z second check nodes that are associated with a variable degree distribution code;
Z node processors included in one or more hardware components and configured as z sets of N first check node processors and z second check node processsors where z corresponds to a number of bits associated with the second check code, Z corresponds to a number of processors that operate in parallel, and N corresponds to Z/z, wherein the Z node processors are configured to process messages directed to and from variable nodes and
update states of the z sets of N first check nodes based upon the messages received from the variable nodes, and
further update the states of the z second check nodes utilizing the z sets of N first check node processors and the z second check node processors.
6. The decoder of claim 5 wherein the decoder includes
a processing loop including a feed forward subsystem that includes a permutation processor subsystem that permutes the updated states for the z sets of N first check node processors and the z second node processors, and
a preprocessor that processes the permuted updated state for the z sets of N first check nodes to update the states of the z second check nodes.
7. The decoder of claim 6 further including
a post processor that post processes the updated states of the z second check nodes and generates messages to be sent to the variable nodes; and
a memory for retaining preprocessed information and post processed information.
8. The decoder of claim 6 wherein the permutation subsystem consists of cascaded permuters, with the permutation subsystem configured to shift the preprocessed information for N processing nodes of the z sets of N first check nodes.
9. The decoder of claim 5 wherein the first check nodes operate as a low density parity check code.
10. The decoder of claim 9 wherein the second check nodes operate as single parity check nodes.
11. The decoder of claim 10 wherein the second check nodes have higher degrees than the first check nodes.
12. A system comprising
a preprocessor included in one or more hardware components for updating state information for Z check nodes based on received messages from variable nodes;
a feed forward path for providing the updated state information for the preprocesseed Z check nodes to the preprocessor as received messages; and
the preprocessor configured to further process the Z check nodes to coordinate the updated state of first of N processing nodes and subsequent of the N processing nodes of z sets of N check nodes, where N corresponds to Z/z, utilizing the updated state information from the feed forward path; and
using the updated state information to update the state of z second check nodes to produce messages for sending to the variable nodes.
13. The system of claim 12 further including in the feed forward path a permutation processor subsystem that permutes the updated state information for the first of the N processing nodes and the subsequent of the N processing nodes of the z sets of N check nodes.
14. The system of claim 13 wherein the system determines for the z sets of N check nodes a smallest message magnitude and a next smallest message magnitude and an edge index as the updated state information.
15. The system of claim 14 wherein the system further determines a total sign value as the updated state information.
16. The system of claim 15 wherein the system provides to the feed forward path the smallest message magnitude and the total sign value.
17. The system of claim 12 wherein the z sets of N check nodes are high degree nodes.
18. The system of claim 17 configured to process nodes of lesser degrees that do not utilize the feed forward path.