Scheduling strategies for iterative decoders
View Patent ↗An iterative decoder is controlled to iteratively decode a block by performing one or more decoding iterations for the block. The iterative decoder uses a parity-check matrix and can be configured to process that parity-check matrix for parallel, sequential or a combination of parallel and sequential (“hybrid”) parity constraint updates.
1. A method comprising:
receiving soft information regarding a codeword at an iterative low density parity check (“LDPC”) decoder, by a decoder unit, that operates according to a parity check matrix arranged as a plurality of ordered rows each corresponding to a parity constraint;
performing updates of the soft information at the iterative decoder for a particular iteration by processing the ordered rows sequentially, each consecutive parity constraint of an ordered row being updated sequentially one parity constraint at a time using results based on previous parity constraint updates of the particular iteration; and
converging on the codeword after the particular iteration.
2. The method as in claim 1 , further comprising:
operating a single-port static random access memory (“SRAM”) to update each parity constraint; and
generating matrix row addresses corresponding to each parity constraint as each parity constraint is to be updated by the single-port SRAM.
3. The method as in claim 1 , further comprising:
updating a subset of parity constraints in parallel.
4. The method as in claim 3 , further comprising:
operating a plurality of decoder units; each decoder unit to process updates for a given sub set.
5. The method as in claim 1 , further comprising:
transmitting the soft information after the particular iteration to a channel detector for one or more channel iterations between the channel detector and the iterative decoder.
6. The method as in claim 1 , further comprising:
receiving the soft information regarding the codeword from a data channel.
7. The method as in claim 6 , wherein the data channel is a communication channel, the method further comprising: receiving the codeword as one or more data packets from the communication channel.
8. The method as in claim 1 , further comprising:
utilizing a single decoder unit for the decoder.
9. An iterative low density parity check (“LDPC”) decoder comprising:
a parity-check matrix arranged as a plurality of ordered rows each corresponding to a parity constraint;
circuitry configured to receive soft information for a codeword; and
a single generic row decoder unit configured to update a single ordered row at a time and to execute decoding for all parity constraints, the decoding comprising i) performance of sequential updates of the soft information received for the codeword for a particular iteration by processing the matrix rows sequentially, each consecutive parity constraints of an ordered row being updated sequentially one parity constraint at a time using results based on previous parity constraint updates of the particular iteration and ii) convergence on the codeword after the particular iteration.
10. The iterative LDPC decoder as in claim 9 , further comprising:
a single-port static random access memory (“SRAM”) as the single generic row decoder unit; and
an address generator to generate matrix row addresses corresponding to each parity constraint as each parity constraint is to be updated by the single-port SRAM.
11. The iterative LDPC decoder as in claim 9 , wherein a subset of parity constraints are updated in parallel, the single generic row decoder unit comprising:
a plurality of decoder units, each decoder unit configured to process updates for a given sub set.
12. An apparatus, comprising:
a parity-check matrix arranged as a plurality of ordered rows each corresponding to a parity constraint;
circuitry configured to receive soft information for a codeword; and
a single generic row decoder unit configured to update a single ordered row at a time and to execute decoding for all parity constraints, the decoding comprising performance of sequential updates of the soft information received for the codeword for a particular iteration by processing the matrix rows sequentially, each consecutive parity constraints of an ordered row being updated sequentially one parity constraint at a time using results based on previous parity constraint updates of the particular iteration.
13. The apparatus of claim 12 , wherein the decoding further comprises convergence on the codeword after the particular iteration.
14. The apparatus of claim 12 , wherein a subset of parity constraints are updated in parallel.
15. The apparatus of claim 14 , wherein the single generic row decoder unit comprising a plurality of decoder units, each decoder unit configured to process updates for a given subset.
16. The apparatus of claim 12 , wherein the circuitry is configured to receive the soft information regarding the codeword from a data channel.
17. The apparatus of claim 16 , wherein the data channel is a communication channel.
18. The apparatus of claim 17 , wherein the circuitry is configured to receive the codeword as one or more data packets from the communication channel.
19. The apparatus of claim 12 , wherein the decoder comprises a single decoder unit.