Parallel bit interleaver
AssigneePanasonic Holdings Corporation
InventorMihail Petrov
Life of this patent
Estimating the term…
Abstract
A bit interleaving method involves applying a bit permutation process to a QC-LDPC codeword made up of N cyclic blocks each including Q bits, and dividing the codeword after the permutation process into a plurality of constellation words each including M bits, the codeword being divided into F×N/M folding sections, each of the constellation words being associated with one of the F×N/M folding sections, and the bit permutation process being applied such that each of the constellation words includes F bits from each of M/F different cyclic blocks in a given folding section associated with a given constellation word.
Claims6
A bit interleaving method comprising:
- receiving a codeword generated according to a repeat-accumulate quasi-cyclic low-density parity check coding scheme, the codeword including N bit groups each consisting of Q bits;
- reordering the N bit groups, without reordering the bits within each N bit group;
- reordering bits in the codeword after the N bit groups are reordered;
- dividing the codeword into constellation words after the bits in the codeword are reordered, each of the constellation words being made up of M bits, wherein
- N is not a multiple of M, X is a remainder of N divided by M, and N′ is equal to N-X,
- bits of N′ bit groups are written into an M by Q matrix row-by-row and the written bits of the N′ bit groups are read from the M by Q matrix column-by-column in order to reorder the bits in the codeword, and
- the method further comprises reordering a parity portion of the codeword before the N bit groups are reordered without reordering the bits within each N bit group.
A reception method comprising:
- receiving a transmission signal through an antenna;
- generating constellation words based on the transmission signal, the constellation words each consisting of M bits;
- generating a codeword by concatenating the constellation words, the codeword including N×Q bits;
- reordering bits in the codeword;
- reordering N bit groups after the bits in the codeword are reordered, without reordering the bits within each N bit group;
- reordering a parity portion of the codeword after the N bit groups are reordered without reordering the bits within each N bit group;
- and
- decoding bits of the codeword according to a low-density parity check coding scheme after the N bit groups are reordered, a parity-check matrix of the low-density parity check coding scheme having a quasi-cyclic structure, wherein
- N is not a multiple of M, X is a remainder of N divided by M, and N′ is equal to N-X, and
- bits of the N′ bit groups are written into an M by N matrix column-by-column and the written bits of the N′ bit groups are read from the M by N matrix row-by-row in order to reorder the bits in the codeword.
Dependencies are inferred from the claim text.