TRANSMISSION METHOD, RECEPTION METHOD, TRANSMITTER, AND RECEIVER
A codeword is divided into N/(B×D) sections, a bit permutation is applied to (B×D)×Q bits of each of the sections, each Q groups of bits of each of the sections are mapped to a real-valued symbol, each Q D-dimensional vector having D real-valued symbols in Q×D real-valued symbols of each of the sections is multiplied by an orthogonal matrix with D rows and D columns, only two bits of the same quasi-cyclic block are encoded in a constellation block consisting of two D-dimensional vectors, and the two bits are mapped to the same dimension of the two D-dimensional vectors one bit by one bit.
1 . A transmission method for transmitting, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, the transmission method comprising the steps of:
dividing the codeword into N/(B×D) sections each consisting of M=B×D quasi-cyclic blocks, applying a bit permutation to M×Q=(B×D)×Q bits of each of the sections, and grouping the permuted (B×D)×Q bits of each of the sections into Q groups of bits each consisting of M=(B×D) bits, the bit permutation being adapted such that the Q bits of each of the quasi-cyclic blocks are mapped to Q different groups of bits;
mapping B bits of each of the groups of bits to a real-valued symbol;
transforming a D-dimensional vector having D real-valued symbols generated from the groups of bits as elements into a D-dimensional rotated constellation having D transformed real-valued symbols as elements by multiplying the D-dimensional vector by an orthogonal matrix with D columns and D rows, the orthogonal matrix being a matrix for spreading values of elements in each dimension of the D-dimensional vector over at least two dimensions, D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block; and
mapping N×Q/B transformed real-valued symbols to N×Q/(2×B) complex symbols such that 2×D transformed real-valued symbols of each of the rotated constellation blocks are mapped to D complex symbols and the D transformed real-valued symbols of each of the D-dimensional rotated constellations are mapped to D different complex symbols.
2 . The transmission method according to claim 1 , wherein
the bit permutation is equivalent to writing the (B×D)×Q bits of each of the sections row by row into a section permutation matrix with Q columns and B×D rows and reading out the written (B×D)×Q bits column by column from the section permutation matrix.
3 . The transmission method according to claim 1 , wherein
the step of mapping the N×Q/B transformed real-valued symbols to the N×Q/(2×B) complex symbols is performed such that the D transformed real-valued symbols of each of the D-dimensional rotated constellations are mapped to either D real components of D consecutive complex symbols or D imaginary components of D consecutive complex symbols.
4 . The transmission method according to claim 1 , wherein
the step of mapping the N×Q/B transformed real-valued symbols to the N×Q/(2×B) complex symbols is performed such that D transformed real-valued symbols of each of two D-dimensional rotated constellations are mapped to the same D consecutive complex symbols, the two D-dimensional rotated constellations being generated from consecutive groups of bits belonging to the same section.
5 . A reception method for receiving, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, two D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block, the D-dimensional vectors each being generated from one bit of each of M=B×D quasi-cyclic blocks, the reception method comprising the steps of:
demapping received N×Q/(2×B) complex symbols based on (N×Q)/(B×D) D-dimensional rotated constellations each having D transformed real-valued symbols as elements and being generated from D-dimensional vectors;
dividing N×Q bits obtained by the demapping into N/M=N/(B×D) sections each consisting of M=B×D quasi-cyclic blocks; and
applying an inverse bit permutation to M×Q=(B×D)×Q bits of each of the sections, the inverse bit permutation being the inverse of a bit permutation performed by a transmitter.
6 . The reception method according to claim 5 , wherein
the inverse bit permutation is equivalent to writing the (B×D)×Q bits of each of the sections column by column into a section permutation matrix with Q columns and B×D rows and reading out the written (B×D)×Q bits row by row from the section permutation matrix.
7 . A transmitter for transmitting, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, the transmitter comprising:
a bit interleaver dividing the codeword into N/(B×D) sections each consisting of M=B×D quasi-cyclic blocks, applying a bit permutation to M×Q=(B×D)×Q bits of each of the sections, and grouping the permuted (B×D)×Q bits of each of the sections into Q groups of bits each consisting of M=(B×D) bits, the bit permutation being adapted such that the Q bits of each of the quasi-cyclic blocks are mapped to Q different groups of bits;
a constellation mapper mapping B bits of each of the groups of bits to a real-valued symbol;
a constellation rotator transforming a D-dimensional vector having D real-valued symbols generated from the groups of bits as elements into a D-dimensional rotated constellation having D transformed real-valued symbols as elements by multiplying the D-dimensional vector by an orthogonal matrix with D columns and D rows, the orthogonal matrix being a matrix for spreading values of elements in each dimension of the D-dimensional vector over at least two dimensions, D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block, and mapping N×Q/B transformed real-valued symbols to N×Q/(2×B) complex symbols such that 2×D transformed real-valued symbols of each of the rotated constellation blocks are mapped to D complex symbols and the D transformed real-valued symbols of each of the D-dimensional rotated constellations are mapped to D different complex symbols.
8 . A receiver for receiving, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, two D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block, the D-dimensional vectors each being generated from one bit of each of M=B×D quasi-cyclic blocks, the receiver comprising:
a constellation demapper demapping received N×Q/(2×B) complex symbols based on (N×Q)/(B×D) D-dimensional rotated constellations each having D transformed real-valued symbols as elements and being generated from D-dimensional vectors; and
a bit deinterleaver dividing N×Q bits obtained by the demapping into N/M=N/(B×D) sections each consisting of M=B×D quasi-cyclic blocks, and applying an inverse bit permutation to M×Q=(B×D)×Q bits of each of the sections, the inverse bit permutation being the inverse of a bit permutation performed by a transmitter.
9 . The receiver according to claim 8 , wherein
the inverse bit permutation is equivalent to writing the (B×D)×Q bits of each of the sections column by column into a section permutation matrix with Q columns and B×D rows and reading out the written (B×D)×Q bits row by row from the section permutation matrix.
10 . The receiver according to claim 8 , further comprising
a first memory storing therein N×Q bits output from the constellation demapper, the first memory being divided into P first memory banks in parallel, P being a divisor of Q, wherein
the constellation demapper includes a plurality of constellation demapper units, the constellation demapper units being divided into P/2 demapper banks, the demapper banks each being configured to access two adjacent of the first memory banks.
11 . The receiver according to claim 10 , further comprising
a second memory storing therein N×Q/(2×B) complex symbols, the second memory being divided into P second memory banks in parallel, wherein
the demapper banks are each further configured to access two adjacent of the second memory banks.
12 . A transmission method for transmitting, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, the transmission method comprising the steps of:
mapping B bits to a real-valued symbols;
transforming a D-dimensional vector having D real-valued symbols as elements into a D-dimensional rotated constellation having D transformed real-valued symbols as elements by multiplying the D-dimensional vector by an orthogonal matrix with D columns and D rows, two D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block, the D-dimensional vectors each being generated from one bit of each of B×D quasi-cyclic blocks, the orthogonal matrix being a matrix for spreading values of elements in each dimension of the D-dimensional vector over at least two dimensions; and
dividing N×Q/B transformed real-valued symbols into N/(B×D) sections, and applying a first component permutation to Q×D transformed real-valued symbols of each of the sections, the first component permutation being equivalent to writing the Q×D transformed real-valued symbols column by column into a first component permutation matrix with Q columns and D rows, applying a cyclic shift to each of rows of the first component permutation matrix, and reading out the cyclically-shifted Q×D transformed real-valued symbols row by row from the first component permutation matrix.
13 . The transmission method according to claim 12 , further comprising the step of:
mapping two consecutive of the transformed real-valued symbols, which have undergone the first component permutation, to a complex symbol, and applying a complex symbol permutation to N×Q/(2×B) complex symbols, the complex symbol permutation being equivalent to writing the N×Q/(2×B) complex symbols row by row into a complex symbol permutation matrix with Q/2 columns and N/B rows and reading out the written N×Q/(2×B) complex symbols column by column from the complex symbol permutation matrix.
14 . The transmission method according to claim 12 , further comprising the step of:
dividing N×Q/B real-valued symbols obtained by mapping the B bits to the real-valued symbol into N/(B×D) sections, and applying a second component permutation to Q×D real-valued symbols of each of the sections, the second component permutation being equivalent to writing the Q×D real-valued symbols row by row into a second component permutation matrix with Q columns and D rows, applying an inverse cyclic shift to each of rows of the second component permutation matrix, and reading out the cyclically-shifted Q×D real-valued symbols column by column from the second component permutation matrix, the inverse cyclic shift being the inverse of the cyclic shift applied in the first component permutation.
15 . The transmission method according to claim 12 , wherein
the cyclic shift applied to k rows of the first component permutation matrix is k×Q/D, k being an index of the row beginning with zero.
16 . The transmission method according to claim 12 , wherein
the cyclic shift applied to k rows of the first component permutation matrix is an even.
17 . A reception method for receiving, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, two D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block, the D-dimensional vectors each being generated from one bit of each of M=B×D quasi-cyclic blocks, the reception method comprising the steps of:
dividing N×Q/B components based on N×Q/(2×B) complex symbols into N/(B×D) sections, and applying a component permutation to Q×D components of each of the sections, the component permutation being equivalent to writing the Q×D components row by row into a component permutation matrix with Q columns and D rows, applying an inverse cyclic shift to each of rows of the component permutation matrix, and reading out the cyclically-shifted Q×D components column by column from the component permutation matrix, the inverse cyclic shift being the inverse of a cyclic shift performed by a transmitter; and
demapping N×Q/(2×B) complex symbols that have undergone the component permutation, based on (N×Q)/(B×D) D-dimensional rotated constellations each having D transformed real-valued symbols as elements and being generated from D-dimensional vectors.
18 . A transmitter for transmitting, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, the transmitter comprising:
a constellation mapper mapping B bits to a real-valued symbols;
a constellation rotator transforming a D-dimensional vector having D real-valued symbols as elements into a D-dimensional rotated constellation having D transformed real-valued symbols as elements by multiplying the D-dimensional vector by an orthogonal matrix with D columns and D rows, two D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block, the D-dimensional vectors each being generated from one bit of each of B×D quasi-cyclic blocks, the orthogonal matrix being a matrix for spreading values of elements in each dimension of the D-dimensional vector over at least two dimensions; and
a component interleaver dividing N×Q/B transformed real-valued symbols into N/(B×D) sections, and applying a first component permutation to Q×D transformed real-valued symbols of each of the sections, the first component permutation being equivalent to writing the Q×D transformed real-valued symbols column by column into a first component permutation matrix with Q columns and D rows, applying a cyclic shift to each of rows of the first component permutation matrix, and reading out the cyclically-shifted Q×D transformed real-valued symbols row by row from the first component permutation matrix.
19 . A receiver for receiving, in a communication system employing D-dimensional rotated constellations, a codeword generated based on a quasi-cyclic low-density parity-check coding scheme including a repeat-accumulate quasi-cyclic low-density parity-check coding scheme, real-valued symbols each being obtained by encoding B bits, the codeword consisting of N quasi-cyclic blocks, the quasi-cyclic blocks each consisting of Q bits, two D-dimensional vectors that are generated from the same B×D quasi-cyclic blocks constituting a constellation block, the D-dimensional vectors each being generated from one bit of each of M=B×D quasi-cyclic blocks, the receiver comprising:
a component deinterleaver dividing N×Q/B components based on N×Q/(2×B) complex symbols into N/(B×D) sections, and applying a component permutation to Q×D components of each of the sections, the component permutation being equivalent to writing the Q×D components row by row into a component permutation matrix with Q columns and D rows, applying an inverse cyclic shift to each of rows of the component permutation matrix, and reading out the cyclically-shifted Q×D components column by column from the component permutation matrix, the inverse cyclic shift being the inverse of a cyclic shift performed by a transmitter; and
a rotated constellation demapper demapping N×Q/(2×B) complex symbols that have undergone the component permutation, based on (N×Q)/(B×D) D-dimensional rotated constellations each having D transformed real-valued symbols as elements and being generated from D-dimensional vectors.