Apparatus and method for turbo product codes
An apparatus for a turbo product codes includes a codeword generator and an interleaver. The codeword generator receives a data in a matrix, and generate a turbo product code (TPC) codeword including the data, row parities and column parities. The interleaver interleaves the TPC codeword by assigning at least one bit in at least one row-column intersection of the TPC codeword to at least one master code, and outputs the interleaved TPC codeword.
1. An apparatus comprising:
a codeword generator suitable for receiving a data in a matrix, and generating a turbo product code (TPC) codeword including the data, row parities and column parities; and
an interleaver suitable for interleaving the TPC codeword by assigning bits of at least one row-column intersection of the TPC codeword to a plurality of master codes, wherein the number of the bits of at least one row-column intersection is different from the number of the plurality of master codes, each of the plurality of master codes corresponding to more than one of the bits of at least one row-column intersection, and output the interleaved TPC codeword.
2. The apparatus of claim 1 , wherein the codeword generator is suitable for:
generating the row parities from row data of the matrix;
generating the column parities by combining the row parities and column data; and
generating the TPC codeword including the data, the row parities and the column parities.
3. The apparatus of claim 1 , wherein the number of the bits of at least one row-column intersection is identical to the number of the plurality of master codes.
4. The apparatus of claim 3 , wherein the interleaver is suitable for assigning each of the bits of at least one row-column intersection to different master codes.
5. The apparatus of claim 1 , wherein the number of the bits of at least one row-column intersection is greater than the number of the plurality of master codes.
6. The apparatus of claim 1 , wherein the interleaver is suitable for assigning a predetermined number of bits of at least one row-column intersection to the same master code.
7. The apparatus of claim 6 , wherein the predetermined number of bits of at least one row-column intersection includes two bits in the at least one row-column intersection.
8. The apparatus of claim 1 , wherein the row parities are of a serial concatenation structure.
9. A method comprising:
generating a turbo product code (TPC) codeword including a data in a matrix, row parities and column parities;
interleaving the TPC codeword by assigning bits of at least one row-column intersection of the TPC codeword to a plurality of master codes, wherein the number of the bits of at least one row-column intersection is different from the number of the plurality of master codes, each of the plurality of master codes is corresponding to more than one of the bits of at least one row-column intersection; and
outputting the interleaved TPC codeword.
10. The method of claim 9 , wherein the generating of the TPC codeword comprises:
generating the row parities from row data of the matrix;
generating the column parities by combining the row parities and column data; and
generating the TPC codeword including the data, the row parities and the column parities.
11. The method of claim 9 , wherein the number of the bits of at least one row-column intersection is identical to the number of the plurality of master codes.
12. The method of claim 11 , wherein the interleaving of the TPC codeword comprises:
assigning each of the plurality of bits of at least one row-column intersection to different master codes.
13. The method of claim 9 , wherein the number of the bits of the at least one row-column intersection is greater than the number of the plurality of master codes.
14. The method of claim 9 , wherein the interleaving of the TPC codeword comprises:
assigning a predetermined number of bits of the at least one row-column intersection to the same master code.
15. The method of claim 14 , wherein the predetermined number of bits of the at least one row-column intersection includes two bits in the at least one row-column intersection.
16. The method of claim 9 , wherein the row parities are of a serial concatenation structure.