SCHEDULING FOR LOW-DENSITY PARITY-CHECK CODES
First Claim
1. A method for wireless communication, comprising:
- receiving a message encoded as a low-density parity-check (LDPC) code that includes a plurality of check nodes and a plurality of bit nodes;
applying a first number of decoding iterations to decoding the message, wherein only a portion of the plurality of check nodes is decoded during each of the first number of decoding iterations;
applying a second number of decoding iterations to decoding the message after the first number of decoding iterations are applied, wherein all of the plurality of check nodes are decoded during each of the second number of decoding iterations; and
decoding the message through completion of both the first number of decoding iterations and the second number of decoding iterations.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods, systems, and devices for wireless communications are described. Efficient low-density parity-check (LDPC) scheduling of layered decoding may include receiving a message encoded as an LDPC code that includes a number of check nodes and a number of bit nodes, applying a first number of decoding iterations to decoding the message, applying a second number of decoding iterations to decoding the message after the first number of decoding iterations are applied, and decoding the message through completion of both the first number of decoding iterations and the second number of decoding iterations. In some cases, only a portion of the number of check nodes is decoded during each of the first number of decoding iterations and all of the number of check nodes are decoded during each of the second number of decoding iterations.
13 Citations
30 Claims
-
1. A method for wireless communication, comprising:
-
receiving a message encoded as a low-density parity-check (LDPC) code that includes a plurality of check nodes and a plurality of bit nodes; applying a first number of decoding iterations to decoding the message, wherein only a portion of the plurality of check nodes is decoded during each of the first number of decoding iterations; applying a second number of decoding iterations to decoding the message after the first number of decoding iterations are applied, wherein all of the plurality of check nodes are decoded during each of the second number of decoding iterations; and decoding the message through completion of both the first number of decoding iterations and the second number of decoding iterations. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. An apparatus for wireless communication, comprising:
-
means for receiving a message encoded as a low-density parity-check (LDPC) code that includes a plurality of check nodes and a plurality of bit nodes; means for applying a first number of decoding iterations to decoding the message, wherein only a portion of the plurality of check nodes is decoded during each of the first number of decoding iterations; means for applying a second number of decoding iterations to decoding the message after the first number of decoding iterations are applied, wherein all of the plurality of check nodes are decoded during each of the second number of decoding iterations; and means for decoding the message through completion of both the first number of decoding iterations and the second number of decoding iterations. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25)
-
-
26. An apparatus for wireless communication, comprising:
-
a processor; memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to; receive a message encoded as a low-density parity-check (LDPC) code that includes a plurality of check nodes and a plurality of bit nodes; apply a first number of decoding iterations to decoding the message, wherein only a portion of the plurality of check nodes is decoded during each of the first number of decoding iterations; apply a second number of decoding iterations to decoding the message after the first number of decoding iterations are applied, wherein all of the plurality of check nodes are decoded during each of the second number of decoding iterations; and decode the message through completion of both the first number of decoding iterations and the second number of decoding iterations. - View Dependent Claims (27, 28, 29)
-
-
30. A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to:
-
receive a message encoded as a low-density parity-check (LDPC) code that includes a plurality of check nodes and a plurality of bit nodes; apply a first number of decoding iterations to decoding the message, wherein only a portion of the plurality of check nodes is decoded during each of the first number of decoding iterations; apply a second number of decoding iterations to decoding the message after the first number of decoding iterations are applied, wherein all of the plurality of check nodes are decoded during each of the second number of decoding iterations; and decode the message through completion of both the first number of decoding iterations and the second number of decoding iterations.
-
Specification