LDPC encoder and decoder and method thereof
AssigneeMarvell International Ltd.
InventorsZining Wu, Gregory Burd
Life of this patent
Estimating the term…
Abstract
A method of decoding low-density parity-check codes comprises a first step that includes calculating └└rRml, for each parity check equation, at iteration i−1, in response to a third step. A second step includes decision aided equalizing, at iteration i, in response to the first step. The third step includes calculating └└rQ└m, for each parity check equation, at iteration i in response to the second step, wherein └└rQ└m represents information from bit node l to equation node m, one for each connection, and wherein └└rRml represents information from equation node m to bit node l, one for each connection.
Claims52
A method of decoding low-density parity-check codes comprising the steps of:
- a. calculating └└rRml, for each parity check equation, at iteration i−1, in response to step c;
- b. decision aided equalizing, at iteration i, in response to step a;
- and
- c. calculating └└rQ└m, for each parity check equation, at iteration i in response to step b,
- wherein └└rQ└m represents information from bit node 1 to equation node m, one for each connection, and
- wherein └└rRml represents information from equation node m to bit node 1, one for each connection.
A computer program for decoding low-density parity-check codes comprising the steps of:
- a. calculating └└rRml, for each parity check equation, at iteration i−1, in response to step c;
- b. decision aided equalizing, at iteration i, in response to step a;
- and
- c. calculating └└rQ└m, for each parity check equation, at iteration i in response to step b;
- wherein └└rQ└m represents information from bit node 1 to equation node m, one for each connection, and
- wherein └└rRml represents information from equation node m to bit node 1, one for each connection.
A decoder for decoding low-density parity-check codes comprising:
- first calculating means for calculating └└rRml, for each parity check equation, at iteration i−1;
- decision aided equalizing means for equalizing └└rRml, at iteration i, in response to said first calculating means;
- and
- second calculating means for calculating └└rQ└m, for each parity check equation, at iteration i in response to said decision aided equalizing means;
- wherein └└rQ└m represents information from bit node 1 to equation node m, one for each connection,
- wherein └└rRml represents information from equation node m to bit node 1, one for each connection, and
- wherein said first calculating means is responsive to said second calculating means.
A decoder for decoding low-density parity-check codes comprising:
- a first calculator to calculate └└rRml, for each parity check equation, at iteration i−1;
- a decision aided equalizer to equalize └└rRml, at iteration i, in response to said first calculator;
- and
- a second calculator to calculate └└rQ└M, for each parity check equation, at iteration i in response to said decision aided equalizer,
- wherein └└rQ└m represents information from bit node 1 to equation node m, one for each connection,
- wherein └└rRml represents information from equation node m to bit node 1, one for each connection, and
- wherein said first calculator is responsive to said second calculator.
Dependencies are inferred from the claim text.