Look-ahead LDPC decoder
AssigneeGoke US Research Laboratory
InventorsKo-Chung Tseng, Engling Yeo
Life of this patent
Estimating the term…
Abstract
Look-ahead LDPC decoder. In an exemplary embodiment, a method includes generating a message (QA) to a first check node, the QA message is generated from a result (RA) from the first check node, and generating a message (QB) to a second check node, the QB message is generated from the result (RA) and is transmitted to avoid decoder stall. The method also includes receiving a result (R′A) from the first check node, computing a difference (R″A) between the result (R′A) and the result (RA), and receiving a result (R′B) from the second check node. The method also includes computing a bit value P(B) using the difference (R″A) and the result (R′B).
Claims20
A method performed by a digital data decoder, comprising:
- determining that a Read-Before-Write (RBW) hazard may occur;
- in response to determining that a RBW hazard may occur:
- generating a message (QA) to a first check node, wherein the QA message is generated from a previous result (RA) from the first check node;
- generating a message (QB) to a second check node, wherein the QB message is generated from the previous result (RA) and is transmitted before a result (R′A) is received from the first check node;
- receiving the result (R′A) from the first check node;
- computing a difference (R″A) between the result (R′A) and the result (RA);
- receiving a result (R′B) from the second check node;
- and
- computing a bit value P(B) using the difference (R″A) and the result (R′B);
- whereby the RBW hazard is avoided as a result of computing QB before receiving the result R′A from the first check node.
A digital data decoder, comprising:
- means for determining that a Read-Before-Write (RBW) hazard may occur;
- means for generating a message (QA) to a first check node, the message (QA) determined from a previous result (RA) from the first check node;
- means for generating a message (QB) to a second check node from the previous result (RA) and is transmitted before a result (R′A) is received from the first check node;
- means for receiving a result (R′A) from the first check node;
- means for computing a difference (R″A) between the result (R′A) and the result (RA) when the RBW hazard may occur;
- means for receiving a result (R′B) from the second check node;
- and
- means for computing a bit value P(B) using the difference (R″A) and the result (R′B);
- whereby the RBW hazard is avoided as a result of computing QB before receiving the result R′A from the first check node.
A method performed by a digital data decoder, comprising:
- detecting a read before write (RBW) hazard associated with first and second check nodes;
- generating messages (QA) and (QB) to the first and second check nodes, respectively, wherein the (QA) and (QB) messages are generated from a previous result (RA) from the first check node, each message transmitted before a result (R′A) is received from the first check node;
- receiving a result (R′A) from the first check node and a result (R′B) from the second check node;
- and
- computing a new bit node value based on the result (R′A) and the result (R′B);
- whereby the RBW hazard is avoided as a result of computing QB before receiving the result R′A from the first check node.
Dependencies are inferred from the claim text.