US2014129895A1PendingUtilityA1
Parallel bit interleaver
Est. expiryMay 18, 2031(~4.8 yrs left)· nominal 20-yr term from priority
Inventors:Mihail Petrov
H03M 13/2957H03M 13/1134H03M 13/6325H03M 13/27H03M 13/255H03M 13/6552H03M 13/2767H03M 13/2778H04L 1/0058H03M 13/271H03M 13/2703H04L 1/06H03M 13/116H04L 1/0618H03M 13/1168H03M 13/356H03M 13/1142H03M 13/1154H04L 1/0606H03M 13/6555H03M 13/2792H04L 1/0071H03M 13/1165
47
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
A bit interleaving method applying a bit permutation process to a QC LDPC codeword made up of N cyclic blocks of Q bits each, dividing the processed codeword into constellation words of M bits each, and applying an intra-cyclic-block permutation process to the cyclic blocks, where the codeword is divided into F×N/M folding sections of M/F cyclic blocks each and the constellation words are each associated with one of the folding sections, and the bit permutation process is applied such that the constellation words are each made up of F bits from each of M/F different cyclic blocks in the associated section, after the permutation process.
Claims
exact text as granted — not AI-modified1 - 14 . (canceled)
15 . A bit interleaving method interleaving a codeword of quasi-cyclic low-density parity check codes, including repeat-accumulate quasi-cyclic low-density parity check codes, the bit interleaving method comprising:
an allocation step of allocating codeword bits of the codeword made up of N cyclic blocks each including Q cyclic block bits to Q×N/M constellation words, each of the constellation words being made up of M bits, wherein F is an integer greater than 1, and is a divisor of M and Q, N is not a multiple of M/F, N′ is equal to (M/F)×floor(N/(M/F)), in the allocation step, allocation process is applied such that the M bits-include F cyclic block bits from each of M/F different cyclic blocks in each of F×N′/M folding sections, each of the folding sections being made up of M/F of the cyclic blocks, and such that the M bits are allocated to each of Q/F of the constellation words.
16 . A bit interleaver interleaving a codeword of quasi-cyclic low-density parity check codes, including repeat-accumulate quasi-cyclic low-density parity check codes, the bit interleaver comprising:
an allocation unit allocating codeword bits of the codeword made up of N cyclic blocks each including Q cyclic block bits to Q×N/M constellation words, each of the constellation words being made up of M bits, wherein F is an integer greater than 1, and is a divisor of M and Q, N is not a multiple of M/F, N′ is equal to (M/F)×floor(N/(M/F)), the allocation process is applied such that the M bits include F cyclic block bits from each of M/F different cyclic blocks in each of F×N′/M folding sections, each of the folding sections being made up of M/F of the cyclic blocks, and such that the M bits are allocated to each of Q/F of the constellation words.
17 . A decoding method, comprising:
a demodulation step of generating a demodulated signal by demodulating a signal transmitted by modulating M bits allocated to each of a plurality of constellation words using the bit interleaving method of claim 15 ; and a decoding step of decoding the demodulated signal and generating original data according to quasi-cyclic low-density parity check codes.
18 . A decoder, comprising:
a demodulating unit generating a demodulated signal by demodulating a signal transmitted by modulating M bits allocated to each of a plurality of constellation words using the bit interleaver of claim 16 ; and a decoding unit decoding the demodulated signal and generating original data according to quasi-cyclic low-density parity check codes.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.