EP2634930B1 - Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement - Google Patents

Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement Download PDF

Info

Publication number
EP2634930B1
EP2634930B1 EP13170158.3A EP13170158A EP2634930B1 EP 2634930 B1 EP2634930 B1 EP 2634930B1 EP 13170158 A EP13170158 A EP 13170158A EP 2634930 B1 EP2634930 B1 EP 2634930B1
Authority
EP
European Patent Office
Prior art keywords
constellation
matrix
dimensional
value
representation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP13170158.3A
Other languages
German (de)
English (en)
Other versions
EP2634930A3 (fr
EP2634930A2 (fr
Inventor
Mihail Petrov
Tomohiro Kimura
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sun Patent Trust Inc
Original Assignee
Panasonic Intellectual Property Management Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Panasonic Intellectual Property Management Co Ltd filed Critical Panasonic Intellectual Property Management Co Ltd
Priority to PL13170158T priority Critical patent/PL2634930T3/pl
Priority to EP13170158.3A priority patent/EP2634930B1/fr
Publication of EP2634930A2 publication Critical patent/EP2634930A2/fr
Publication of EP2634930A3 publication Critical patent/EP2634930A3/fr
Application granted granted Critical
Publication of EP2634930B1 publication Critical patent/EP2634930B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J11/00—Orthogonal multiplex systems, e.g. using WALSH codes
    • H04J11/0023—Interference mitigation or co-ordination
    • H04J11/0063—Interference mitigation or co-ordination of multipath interference, e.g. Rake receivers

Definitions

  • the present invention relates to digital data communication, in particular to methods for generating multi-dimensional constellations for digital data modulation, methods for modulating and transmitting data on the basis of multi-dimensional constellations, and a corresponding apparatus.
  • Fading is one of the major problems in communication systems. It represents random fluctuations in the amplitude of the received signal due to multi-path propagation. If the delay spread of the channel is larger than the symbol period of the signal, the fading is also frequency selective. The amplitude of fading is usually approximated by a Rayleigh distribution. Such fading is referred to as Rayleigh fading.
  • information is encoded as a sequence of symbols belonging to a discrete alphabet, referred to as a constellation.
  • a constellation has N dimensions and encodes B information bits per dimension.
  • the number of bits per dimension B directly determines the spectral efficiency of the transmission, given in bits/Hz.
  • the number of dimensions N has no effect on the spectral efficiency.
  • each transmitted bit affects only one dimension.
  • "b 2 " of each constellation point "b 1 b 2 " affects only the dimension represented by the vertical axis. If the dimension affected by the transmitted bits undergoes a deep fading, all bits that modulate this dimension will be extremely unreliable, which increases the error probability. This effect is illustrated by the errors in FIG. 1A .
  • a multi-dimensional rotation can be achieved by multiplying the N-element signal vector by an N*N square matrix.
  • the necessary and sufficient condition for a square matrix to be a rotation matrix (or a reflection matrix) is for it to be orthogonal, i.e., to satisfy the equation of the following Math. 1.
  • RR T I Note that in the above Math. 1, the matrix R is a square matrix, the matrix R T is a transpose matrix of the matrix R , and the matrix I is a unit matrix.
  • NPL 3 discloses two different approaches, relying on the use of the algebraic number theory, which have the advantage of a reduced number of parameters.
  • the first approach allows the construction of rotation matrices by applying the "canonical embedding" to an algebraic number field.
  • Two methods are proposed.
  • Diversity means the minimum number of different values in the components of any two distinct points of the constellation.
  • the possible values of N are very limited, such as 3, 5, 9, 11, and 15.
  • R 2 N ⁇ cos 2 ⁇ ⁇ 8 ⁇ n 4 ⁇ 1 , 2 , ⁇ , N - 1 T 2 ⁇ 1 , 2 , ⁇ , N - 1
  • T denotes the transpose of a matrix
  • the resulting rotation matrix is a rotation matrix that is orthogonal for any N, the full modulation diversity is only achieved when N is a power of two.
  • the second approach first constructs rotation matrices with two and three dimensions, which can be used as base matrices for constructing matrices with more dimensions using a Hadamard-like stacked expansion shown in the following Math. 11.
  • R + R 1 - R 2 + R 2 + R 1
  • the base 2-D and 3-D (three-dimensional) rotation matrices have a single independent parameter which is chosen so that the product distance of the constellation is maximized.
  • a 4-D rotation matrix is constructed from two 2-D rotation matrices according to the above Math. 11. Because of the relative small dimension, it is possible to find an algebraic relationship between parameters of the two 2-D rotation matrices, so that the product distance is maximized. For larger dimensions, such an optimization becomes intractable, which is the primary disadvantage of the second approach.
  • Another aspect concerns the separation and mapping of the N dimensions of the rotated constellation so that they experience independent fading. This is a key aspect necessary for achieving the expected diversity performance.
  • the N constellation components which are obtained by separating the N-dimensional rotated constellation on a per-dimension basis, can be transmitted over different time slots, frequencies, transmitter antennas, or combinations thereof. Further signal processing is possible before transmission.
  • the critical aspect is that fading experienced by each of the N dimensions must be different from, or ideally uncorrelated with, fading experienced by any other one of the N dimensions.
  • the spreading of the N dimensions across different time slots, frequencies and antennas can be achieved for example through appropriate interleaving and mapping.
  • Another aspect concerns the mapping of the N real dimensions of the rotated constellation to complex symbols for transmission.
  • the N dimensions In order to ensure the desired diversity, the N dimensions must be mapped to different complex symbols.
  • the complex symbols are then spread as described earlier, e.g. through interleaving and mapping, so that at the reception, fading experienced by each of the N dimensions is uncorrelated with fading of any other one of the N dimensions.
  • FIG. 2 is a block diagram of a transmission apparatus.
  • the transmission apparatus is composed of an FEC encoder 210, a bit interleaver 220, a rotated constellation mapper 230, a complex symbol mapper 240, a symbol interleaver/mapper 250, modulation chains 260-1 to 260-M, and transmitter antennas 270-1 to 270-M.
  • the FEC encoder 210 performs forward error correction (FEC) encoding on the input thereto.
  • FEC forward error correction
  • the best FEC codes known so far, which are also the most used in new standards, are the turbo codes and the low-density parity check (LDPC) codes.
  • the bit interleaver 220 performs bit interleaving on the input from the FEC encoder 210.
  • the bit interleaving can be block interleaving or convolution interleaving.
  • the rotated constellation mapper 230 maps the input from the bit interleaver 220 to the rotated constellation.
  • the input to the rotated constellation mapper 230 is the output of the FEC encoder 210 via the bit interleaver 220 that performs optional bit interleaving.
  • the bit interleaving is usually required when there are more than one bit per dimension (B > 1).
  • the FEC encoding performed by the FEC encoder 210 introduces redundant bits in a controlled fashion, so that propagation errors can be corrected in the reception apparatus. Although the overall spectral efficiency decreases, the transmission becomes overall more robust, i.e., the bit error rate (BER) decays much faster with the signal to noise ratio (SNR).
  • BER bit error rate
  • each dimension is modulated separately by B bits, using either binary or Gray mapping, so the number of discrete values is 2 B and the number of constellation points is 2 B -N.
  • the complex symbol mapper 240 maps each of N constellation components, which represent N-dimensional rotated constellation symbols input from the rotated constellation mapper 230, to a different one of complex symbols.
  • the essential function of the complex symbol mapper 240 is to map each of N constellation components of one rotated constellation symbol to a different one of complex symbols.
  • FIG. 3 shows the case of four dimensions.
  • the boxes showing the same number represent a group of 4-D rotated constellation symbols.
  • the number shown by each box indicates the group number of the corresponding group.
  • each box indicates a constellation component of one dimension.
  • Shown below "Constellation symbols” in FIG. 3 is a state where six groups of 4-D rotated constellation symbols are aligned. Shown below “Complex symbols” in FIG. 3 are twelve complex symbols, which are obtained by rearranging the six groups of 4-D rotated constellation symbols shown below “Constellation symbols” in FIG. 3 . Note that FIG. 3 shows three forms of "Complex symbols” as examples. At the time of actual transmission, a pair of two constellation components that are vertically aligned below “Complex symbols” (the result of rearrangement) is modulated and transmitted as one complex symbol.
  • the symbol interleaver/mapper 250 performs symbol interleaving on the complex symbols input from the complex symbol mapper 240, and thereafter maps the complex symbols to different time slots, frequencies, transmitter antennas, or combinations thereof.
  • the symbol interleaving can be block interleaving or convolution interleaving.
  • the modulation chains 260-1 to 260-M are provided in one-to-one correspondence with the transmitter antennas 270-1 to 270-M.
  • Each of the modulation chains 260-1 to 260-M inserts pilots for estimating the fading coefficients into the corresponding input from the symbol interleaver/mapper 250, and also performs various processing, such as conversion into the time domain, digital-to-analog (D/A) conversion, transmission filtering and orthogonal modulation, on the corresponding input. Then, each of the modulation chains 260-1 to 260-M transmits the transmission signal via a corresponding one of the transmitter antennas 270-1 to 270-M.
  • D/A digital-to-analog
  • FIG. 4 shows a block diagram of a reception apparatus corresponding to the transmission apparatus whose block diagram is shown in FIG. 2 .
  • the reception apparatus is composed of receiver antennas 410-1 to 410-M, demodulation chains 420-1 to 420-M, a symbol demapper/deinterleaver 430, a complex symbol demapper 440, a rotated constellation demapper 450, a bit deinterleaver 460, and an FEC decoder 470.
  • the demodulation chains 420-1 to 420-M are provided in one-to-one correspondence with the receiver antennas 410-1 to 410-M.
  • Each of the demodulation chains 420-1 to 420-M performs processing such as A/D conversion, reception filtering, and orthogonal demodulation on the signal transmitted by the transmission apparatus of FIG. 2 and received by a corresponding one of the receiver antennas 410-1 to 410-M.
  • the demodulation chains 420-1 to 420-M estimate (i) the amplitude values (fading coefficients) of the channel characteristics by using the pilots and (ii) noise variance, and output the estimated amplitude values and noise variance together with the phase-corrected received signal.
  • the symbol demapper/deinterleaver 430 performs the inverse processing of the processing performed by the symbol interleaver/mapper 230 in the transmission apparatus on the inputs from the demodulation chains 420-1 to 420-M.
  • the complex symbol demapper 440 performs the inverse processing of the processing performed by the complex symbol mapper 240 in the transmission apparatus on the input from the symbol demapper/deinterleaver 430. Through this processing, N-dimensional rotated constellation symbols can be obtained.
  • the rotated constellation demapper 450 performs demapping processing on the N-dimensional rotated constellation symbols, and outputs a decision result of each bit included in the N-dimensional rotated constellation.
  • the bit deinterleaver 460 performs the inverse processing of the processing performed by the bit interleaver 220 in the transmission apparatus on the input from the rotated constellation demapper 450.
  • the FEC decoder 470 performs FEC decoding on the input from the bit deinterleaver 470.
  • the rotated constellation demapper 450 can perform the processing of demapping N-dimensional rotated constellation symbols in the following two ways (i) and (ii).
  • the first solution (the above (i)) is the most simple, its performance is suboptimal and even worse for rotated constellations than for non-rotated constellations. Due to its simplicity, this solution may be used in some low-cost reception apparatuses.
  • the second solution (the above (ii)) is more complex, it offers much better performance in terms of BER at a given SNR. In the following, the second solution will be described in greater detail.
  • a preferred embodiment of the reception apparatus includes the FEC decoder 470 after the rotated constellation demapper 450, with the optional bit deinterleaver 460 in between, as shown in FIG. 4 .
  • the rotated constellation demapper 450 which performs the rotated constellation demapping, receives N-dimensional symbol vectors (y 1 , ..., y N ) and the estimated fading coefficient vectors (h 1 ..., h N ), and extracts data of N*B bits (b 1 , ..., b N*B ) from each symbol, as shown in FIG. 5 .
  • k is the bit index
  • y is the received symbol vector
  • H is the diagonal matrix having the associated (estimated) fading coefficients as elements on the main diagonal
  • S is a constellation point vector
  • ⁇ 2 is the squared norm
  • ⁇ 2 is the noise variance
  • the squared norm represents the squared Euclidean distance from the received symbol vector y to the faded constellation symbol vector Hs in the N-dimensional space.
  • Each bit b k divides the constellation into two partitions of equal size, S k 0 and S k 1, corresponding to those points for which b k is 0 and 1, respectively. Examples are shown in FIGs. 6A and 6B for a classical 16-QAM constellation with Gray encoding.
  • FIG. 6A shows the constellation encoding and
  • FIG. 6B shows the two partitions for each bit b k .
  • the LLR demapper is composed of a counter 710, a rotated constellation mapper 720, a squared Euclidean distance calculator 730, minimizers 740-1 to 740-4, and adders 750-1 to 750-4.
  • the rotated constellation mapper 720 selects the 2-D rotated constellation point from a look-up table by using the counter values provided by the counter 710 as an indexes, and outputs two constellation components s 1 and s 2 obtained through this selection to the squared Euclidean distance calculator 730.
  • the squared Euclidean distance calculator 730 calculates the squared Euclidean distances (see FIG. 8 ).
  • the minimizers 740-1 to 410-4 maintain the corresponding minimum squared Euclidean distances for the two partitions (see FIG. 9 ).
  • the two constellation partitions for each bit are simply indicated by the corresponding bit of the counter 710.
  • Each of the adders 750-1 to 750-4 subtracts the output of min1 (corresponding to bit 1) from the output of min0 (corresponding to bit 0), the min1 and min0 being provided in each of the minimizers 740-1 to 740-4. Thereafter, the adders 750-1 to 750-4 output the results of the subtraction as L(b 1 ) to L(b 4 ), respectively.
  • the squared Euclidean distance calculator is composed of multipliers 810-1 to 810-N, adders 820-1 to 820-N, multipliers 830-1 to 830-N, an adder 840, and a multiplier 850.
  • the multipliers 810-1 to 810-N multiply h 1 to h N by s 1 to s N , respectively.
  • the adders 820-1 to 820-N subtract h 1 s 1 to h N s N from y 1 to y N , respectively.
  • the multipliers 830-1 to 830-N multiply (y 1 - h 1 s 1 ) to (y N - h N s N ) by (y 1 - h 1 s 1 ) to (y N - h N s N ), respectively.
  • the adder 840 adds together the outputs of the multipliers 830-1 to 830-N.
  • the multiplier 850 multiplies the output of the adder 840 by 1 / (2 ⁇ 2 ) .
  • the output of the multiplier 850 is the N-dimensional squared Euclidean distance.
  • FIG. 9 is a circuit diagram of the minimizers 740-1 to 740-4 that each calculate the minimum squared Euclidean distances for each bit.
  • the 1-bit subset (or partition) input indicates the current position.
  • Each of the minimizers 740-1 to 740-4 is composed of a comparator 910, a selector 920, an inverter 930, D flip-flops 940-0 and 940-1, and a selector 950.
  • the selector 950 selects and outputs the former.
  • the comparator 910 compares din (A), which indicates the squared Euclidean distance calculated by the squared Euclidian distance calculator 730, with the output (B) of the selector 950. In a case where B is smaller than A, the comparator 910 outputs "0". In this case, from among din and the output of the selector 950, the selector 920 selects and outputs the latter based on "0" received from the comparator 910. On the other hand, in a case where A is smaller than B, the comparator 910 outputs "1". In this case, from among din and the output of the selector 950, the selector 920 selects and outputs the former based on "1" received from the comparator 910. Note that in a case where A is equal to B, the same result will be obtained whether the selector 920 selects din or the output of the selector 950. Accordingly, in this case, the comparator 910 may output either one of "0" and "1".
  • the inverter 930 inverts the subset value "0". Thus, "1" is input to the enable terminal of the D flip-flop 940-0. As the D flip-flop 940-0 is enabled, it latches the output of the selector 920. Meanwhile, “0" is input to the enable terminal of the D flip-flop 940-1. As the D flip-flop 940-1 is disabled, it does not latch the output of the selector 920.
  • the selector 950 selects and outputs the latter.
  • the comparator 910 compares din (A) with the output (B) from the selector 950. In a case where B is smaller than A, the comparator 910 outputs "0". In this case, from among din and the output of the selector 950, the selector 920 selects and outputs the latter based on "0" received from the comparator 910. On the other hand, in a case where A is smaller than B, the comparator 910 outputs "1". In this case, from among din and the output of the selector 950, the selector 920 selects and outputs the former based on "1" received from the comparator 910. Note that in a case where A is equal to B, the same result will be obtained whether the selector 920 selects din or the output of the selector 950. Accordingly, in this case, the comparator 910 may output either one of "0" and "1".
  • the reception apparatus configured to utilize such iterative decoding is composed of a rotated constellation demapper 1010, a bit deinterleaver 1020, an FEC decoder 1030, an adder 1040, and a bit interleaver 1050.
  • the rotated constellation demapper 1010 and the FEC decoder 1030 are connected in a loop.
  • the rotated constellation demapper 1010 performs demapping processing on N-dimensional rotated constellation symbols, and outputs L (see FIG. 11 ).
  • the bit deinterleaver 1020 performs the inverse processing of the processing performed by the bit interleaver 220 in the transmission apparatus on the input from the rotated constellation demapper 1010.
  • the FEC decoder 1030 performs FEC decoding on the input from the bit deinterleaver 1020.
  • the adder 1040 subtracts the input from the FEC decoder 1030 from the output of the FEC decoder 1030.
  • the bit interleaver 1050 performs the same processing as the processing performed by the bit interleaver 220 in the transmission apparatus on the output of the adder 1040, and then outputs L E .
  • L E also referred to as extrinsic information, is fed back to the rotated constellation demapper 1010 in order to aid the demapping processing performed by the rotated constellation demapper 1010, i.e., the processing of demapping the N-dimensional rotated constellation symbols.
  • X k 0 and X k 1 represent the two constellation partitions associated with bit k, each constellation point being represented by the N*B bits instead of the N bits of integer coordinates.
  • S is expressed as s(x) and represents the constellation mapping function.
  • X 3 0 and X 3 1 are shown in the following Math. 18.
  • X 3 0 X 3 1 0000 0100 0001 0101 0010 0110 0011 0111 1000 1100 1001 1101 1010 1110 1011 1111
  • FIG. 11 shows an example of the structure of the rotated constellation demapper 1010 for iterative decoding. Note that the rotated constellation demapper 1010 for iterative decoding is similar to a rotated constellation demapper for non-iterative decoding. Below, the elements that are the same as those described above are assigned the same reference numerals thereas, and a detailed description thereof is omitted.
  • the rotated constellation demapper 1010 is composed of a counter 710, a rotated constellation mapper 720, a squared Euclidean distance calculator 730, minimizers 740-1 to 740-4, adders 750-1 to 750-4, logical AND operators 1110-1 to 1110-4, an adder 1120, adders 1130-1 to 1130-4, and adders 1140-1 to 1140-4.
  • the logical AND operators 1110-1 to 1110-4 perform logical AND operations on the outputs of the bit interleaver 1050, namely L E (b1) to L E (b4), and the outputs of the counter 710, namely b1 to b4.
  • the adder 1120 adds together the outputs of the logical AND operators 1110-1 to 1110-4.
  • Each of the adders 1130-1 to 1130-4 subtracts, from the output of the adder 1120, the output of a corresponding one of the logical AND operators 1110-1 to 1110-4.
  • Each of the adders 1140-1 to 1140-4 subtracts, from the output of the squared Euclidean distance calculator 730, the output of a corresponding one of the adders 1130-1 to 1130-4. Then, each of the adders 1140-1 to 1140-4 outputs the value obtained through the subtraction to din of a corresponding one of the minimizers 740-1 to 740-4.
  • NPL 2 introduces an approach that makes use of a Givens rotation.
  • the problem with this approach is that the number of parameters for generating an optimal multi-dimensional rotated constellation increases by the order of the square of the number of dimensions in the constellation.
  • NPL 3 introduces two approaches.
  • the first approach makes use of canonical embedding.
  • the method of generating a multi-dimensional rotation matrix is uniquely determined based on the number of dimensions, and does not have a parameter enabling the optimization for different constellation sizes. Therefore, the problem with this approach is that it does not allow maximizing the effect of modulation diversity for various constellation sizes.
  • the second approach introduced by NPL 3 generates a multi-dimensional rotation matrix having a larger number of dimensions by using stacked expansion where 2-D and 3-D rotation matrices are stacked.
  • the problem with this approach is that the algebraic relationships between the stacked rotation matrices become more complicated as the number of dimensions increases, rendering the optimization difficult.
  • a transmission apparatus of the present invention transmits a block of data over a plurality of transmission channels.
  • the transmission apparatus comprises: a modulator operable to select one of a plurality of constellation points in accordance with the block of data to be transmitted, each of the plurality of constellation points having a plurality of components; and a transmitter operable to transmit each component of the selected constellation point over a different one of the plurality of transmission channels, wherein (i) the plurality of constellation points are defined by positions thereof within an N-dimensional space, the positions being obtained by applying an orthogonal transformation to a subset of , which is an N-dimensional integer lattice, (ii) N is a multiple of four, and (iii) the orthogonal transformation has an N-by-N matrix representation with absolute values of all elements on a main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the above transmission apparatus allows efficiently generating a multi-dimensional rotated constellation (a multi-dimensional rotation matrix) for digital transmission with a high degree of modulation diversity with respect to various constellation sizes. Due to the multi-dimensional rotated constellation obtained by using the generated multi-dimensional rotation matrix, the above transmission apparatus also enables data transmission that yields the effect of a high-degree of modulation diversity.
  • the present invention provides a first transmission apparatus for transmitting a block of data over a plurality of transmission channels, the first transmission apparatus comprising: a modulator operable to select one of a plurality of constellation points in accordance with the block of data to be transmitted, each of the plurality of constellation points having a plurality of components; and a transmitter operable to transmit each component of the selected constellation point over a different one of the plurality of transmission channels, wherein (i) the plurality of constellation points are defined by positions thereof within an N-dimensional space, the positions being obtained by applying an orthogonal transformation to a subset of , which is an N-dimensional integer lattice, (ii) N is a multiple of four, and (iii) the orthogonal transformation has an N-by-N matrix representation with absolute values of all elements on a main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the present invention also provides a first transmission method for transmitting a block of data over a plurality of transmission channels, the first transmission method comprising the steps of: selecting one of a plurality of constellation points in accordance with the block of data to be transmitted, each of the plurality of constellation points having a plurality of components; and transmitting each component of the selected constellation point over a different one of the plurality of transmission channels, wherein (i) the plurality of constellation points are defined by positions thereof within an N-dimensional space, the positions being obtained by applying an orthogonal transformation to a subset of , which is an N-dimensional integer lattice, (ii) N is a multiple of four, and (iii) the orthogonal transformation has an N-by-N matrix representation with absolute values of all elements on a main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the above transmission apparatus and transmission method allow efficiently generating a multi-dimensional rotated constellation (a multi-dimensional rotation matrix) for digital transmission with a high degree of modulation diversity with respect to various constellation sizes. Due to the multi-dimensional rotated constellation obtained by using the generated multi-dimensional rotation matrix, the above transmission apparatus and transmission method also enable data transmission that yields the effect of a high-degree of modulation diversity.
  • the present invention also provides a second transmission apparatus and a second transmission method, which are the first transmission apparatus and the second transmission apparatus, respectively, wherein instead of the N-by-N matrix representation, the orthogonal transformation has a matrix representation obtained by permuting rows and/or columns in the N-by-N matrix representation.
  • the above structure produces the same effect as the effect produced by the N-by-N matrix representation with absolute values of all elements on the main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the present invention also provides a third transmission apparatus, which is the first transmission apparatus further comprising a mapper operable to map each component of the selected constellation point to the corresponding one of the plurality of transmission channels over which the component is to be transmitted, such that fading of each of the plurality of transmission channels is uncorrelated with fading of any other one of the plurality of transmission channels.
  • the present invention also provides a third transmission method, which is the first transmission method further comprising the step of mapping each component of the selected constellation point to the corresponding one of the plurality of transmission channels over which the component is to be transmitted, such that fading of each of the plurality of transmission channels is uncorrelated with fading of any other one of the plurality of transmission channels.
  • the above structure can optimize the transmission performance, even in the presence of fading.
  • the present invention also provides a fourth transmission apparatus, which is the first transmission apparatus wherein the transmitter is adapted for transmitting each component of the selected constellation point over a different one of a plurality of time slots, frequencies, transmitter antennas, or combinations thereof.
  • the present invention also provides a fifth transmission apparatus and a fourth transmission method, which are the first transmission apparatus and the first transmission method, respectively, wherein the plurality of transmission channels comprise a plurality of different carriers in an orthogonal frequency-division multiplexing scheme.
  • the present invention also provides a sixth transmission apparatus and a fifth transmission method, which are the first transmission apparatus and the first transmission method, respectively, wherein the plurality of transmission channels comprise a plurality of different symbols in an orthogonal frequency-division multiplexing scheme.
  • the present invention also provides a first reception apparatus for receiving a block of data over a plurality of transmission channels, the first reception apparatus comprising: a receiver operable to receive a plurality of component signals over the plurality of transmission channels; and a demodulator operable to select one of a plurality of constellation points in accordance with the plurality of received component signals, wherein (i) the plurality of constellation points are defined by positions thereof within an N-dimensional space, the positions being obtained by applying an orthogonal transformation to a subset of , which is an N-dimensional integer lattice, (ii) N is a multiple of four, and (iii) the orthogonal transformation has an N-by-N matrix representation with absolute values of all elements on a main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the present invention also provides a first reception method for receiving a block of data over a plurality of transmission channels, the first reception method comprising the steps of: receiving a plurality of component signals over the plurality of transmission channels; and selecting one of a plurality of constellation points in accordance with the plurality of received component signals, wherein (i) the plurality of constellation points are defined by positions thereof within an N-dimensional space, the positions being obtained by applying an orthogonal transformation to a subset of , which is an N-dimensional integer lattice, (ii) N is a multiple of four, and (iii) the orthogonal transformation has an N-by-N matrix representation with absolute values of all elements on a main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the above reception apparatus and reception method allow efficiently generating a multi-dimensional rotated constellation (a multi-dimensional rotation matrix) for digital transmission with a high degree of modulation diversity with respect to various constellation sizes. Due to the multi-dimensional rotated constellation obtained by using the generated multi-dimensional rotation matrix, the above reception apparatus and reception method also enable data reception that yields the effect of a high-degree of modulation diversity.
  • the present invention also provides a second reception apparatus and a second reception method, which are the first reception apparatus and the first reception method, respectively, wherein instead of the N-by-N matrix representation, the orthogonal transformation has a matrix representation obtained by permuting rows and/or columns in the N-by-N matrix representation.
  • the above structure produces the same effect as the effect produced by the N-by-N matrix representation with absolute values of all elements on the main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the present invention also provides a third reception apparatus and a third reception method, which are the first reception apparatus and the first reception method, respectively, wherein the plurality of transmission channels comprise a plurality of different carriers in an orthogonal frequency-division multiplexing scheme.
  • the present invention also provides a fourth reception apparatus and a fourth reception method, which are the first reception apparatus and the first reception method, respectively, wherein the plurality of transmission channels comprise a plurality of different symbols in an orthogonal frequency-division multiplexing scheme.
  • the present invention also provides a first generation method for generating a multi-dimensional constellation for a digital modulation scheme in a data communication system, the first generation method comprising the steps of: receiving a plurality of vectors of a multi-dimensional vector space; and obtaining constellation points of the multi-dimensional constellation by applying an orthogonal transformation to the plurality of vectors received, wherein (i) the orthogonal transformation is adapted for increasing a minimum number of different values in components of any two distinct multi-dimensional constellation points relative to a minimum number of different values in components of any two distinct vectors received, and (ii) the orthogonal transformation has an N-by-N matrix representation, N being a multiple of four, with absolute values of all elements on a main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the above generation method allows efficiently generating a multi-dimensional rotated constellation (a multi-dimensional rotation matrix) for digital transmission with a high degree of modulation diversity with respect to various constellation sizes.
  • the present invention also provides a second generation method for generating a multi-dimensional constellation, the second generation method being the first generation method wherein instead of the N-by-N matrix representation, the orthogonal transformation has a matrix representation obtained by permuting rows and/or columns in the N-by-N matrix representation.
  • the above structure produces the same effect as the effect produced by the N-by-N matrix representation with absolute values of all elements on the main diagonal equal to a first value, and with absolute values of all elements not on the main diagonal equal to a non-zero second value.
  • the present invention also provides a fourth generation method for generating a multi-dimensional constellation, the fourth generation method being the third generation method wherein the selected rotation factor r maximizes the minimum number of different values in the components of any two distinct multi-dimensional constellation points.
  • the above structure makes it possible to achieve a high-degree of modulation diversity and therewith increased robustness in the presence of fading, while preserving spectral efficiency.
  • the present invention also provides a fifth generation method for generating a multi-dimensional constellation, the fifth generation method being the first generation method wherein the plurality of vectors received represent a subset of , which is an N-dimensional integer lattice.
  • Multi-dimensional rotation matrices have a single independent parameter and a structure that is as regular as possible.
  • the parameter can be configured in order to minimize the error probability for various constellation sizes. Specifically, the following two conditions (i) and (ii) are imposed on the multi-dimensional rotation matrix employed for obtaining a multi-dimensional rotated constellation.
  • a and b denote real parameters, with each sign value s i,j satisfying s i , j ⁇ - 1 , + 1 . Note that values of the parameters a and b that fulfill the above conditions (i) and (ii) satisfy a relational expression a > b > 0.
  • the matrix shown in Math. 20 can be used as the multi-dimensional rotation matrix.
  • the matrix shown in Math. 20 and the matrix obtained by permuting rows and/or columns of the matrix shown in Math. 20 have the following features: (i) each row contains an element having a real parameter a; (ii) each column contains an element having a real parameter a; and (iii) the rest of the elements in each row/column have a real parameter b.
  • the advantage of using the "rotation factor” r is that the range is always 0 to 1 regardless of the number of dimensions.
  • the optimal value for the "rotation factor” r depends on the constellation size, that is, the number of dimensions N and the number of bits B per dimension for square/cubic constellations. Note that the value of r satisfying the above conditions (i) and (ii) is greater than 0 and smaller than 1.
  • the multi-dimensional rotation matrix for rotating a multi-dimensional constellation may be normalized or unnormalized.
  • the number of dimensions of a constellation according to the present invention is preferably a multiple of four (e.g., 4, 8, 12 and 16).
  • the resulting multi-dimensional rotation matrix R may be optimized for a certain constellation size, i.e., the number of bits or constellation points per dimension, by performing the following steps: selecting the "rotation factor” r accordingly; and calculating parameters a and b by substituting the selected "rotation factor” r into the above Math. 23.
  • any suitable optimization algorithm may be employed.
  • the minimum number of different values in the components of any two distinct multi-dimensional rotated constellation points may be employed.
  • Other optimization targets may be used as well.
  • a cost function is defined that takes the minimum absolute differences between corresponding components of any two distinct multi-dimensional rotated constellation points into account.
  • An example of such a cost function calculates the minimum over all N absolute differences between corresponding components of two multi-dimensional rotated constellation points and sums these minimum values, or their squares over all pairs of multi-dimensional rotated constellation points.
  • the multi-dimensional rotated constellation may already be useful if the minimum number of different values in the components of any two distinct multi-dimensional rotated constellation points is larger than that pertaining to the multi-dimensional unrotated constellation. Also, the multi-dimensional rotated constellation may already be useful if the minimum absolute difference of two corresponding components of any two distinct multi-dimensional rotated constellation points is larger than that pertaining to the multi-dimensional unrotated constellation.
  • the entire transmission process including the transmission channel and the decoder is simulated in order to determine the bit error rate.
  • the "rotation factor" r may then be adapted so as to minimize the determined bit error rate.
  • the present invention allows generating a multi-dimensional rotated constellation that can be used for modulating and transmitting data over a plurality of fading (sub-) channels or slots at optimum spectral efficiency.
  • a conventional hyper-cubic constellation with the desired number of dimensions N and the desired number of bits per dimension (i.e., the number of constellation points per direction) is set up, for instance, by selecting an appropriate subset of , which is the N-dimensional integer lattice.
  • This hyper-cubic constellation may, for instance, be a generalization of a conventional regular QAM constellation to N dimensions.
  • other initial constellations may be used, such as generalizations of circular constellation to N dimensions, and so on.
  • the initial constellation may be subjected to a rotation by applying the above defined multi-dimensional rotation matrix R to each of the initial constellation points so as to obtain a rotated set of constellation points, i.e., a multi-dimensional rotated constellation.
  • the multi-dimensional rotated constellation may be more favorable than the initial constellation in terms of the degree of modulation diversity provided, depending on the particular choice of the "rotation factor" r.
  • the "rotation factor" r, and therewith the rotated constellation may be varied, as described above, so as to obtain a constellation that provides maximum modulation diversity, or at least a certain minimum degree of modulation diversity, as required by the specific application.
  • the present invention also provides a method and an apparatus for efficiently transmitting and receiving data over a plurality of fading (sub-) channels or slots on the basis of a modulation scheme that employs a multi-dimensional rotated constellation as obtained by the above described method.
  • the inventive method or apparatus may either perform the above described method in order to obtain the desired multi-dimensional rotated constellation, or use a set of predefined and prestored constellation points of the multi-dimensional rotated constellation that have been calculated using the above described method. In the latter case, the inventive method or apparatus may access a storage means, wherein information indicating the positions of at least some of the constellation points is stored.
  • Another aspect of the present invention concerns the separation and mapping of the N dimensions of the N-dimensional rotated constellation so that they experience independent fading during transmission. This is a key aspect necessary for achieving the expected diversity performance.
  • the phrase "a different one of a plurality of transmission channels” may refer to a different one of a plurality of time slots, frequencies, transmitter antennas, or combinations thereof.
  • OFDM orthogonal frequency-division multiplexing
  • the phrase "a different one of a plurality of transmission channels” may in particular refer to a different one of a plurality of active carriers, OFDM symbols, or combinations thereof.
  • the phrase "a different one of a plurality of transmission channels” may in particular refer to a different one of a plurality of symbols or time slots.
  • the critical aspect is that fading experienced by each of the N dimensions must be different from, or ideally uncorrelated with, fading experienced by any other one of the N dimensions.
  • the spreading of the N dimensions across different time slots, frequencies, and transmitter antennas can be achieved for example through appropriate interleaving and mapping.
  • Another aspect of the present invention concerns the mapping of the N real dimensions of the N-dimensional rotated constellation to complex symbols for transmission. Since fading of the in-phase component and the quadrature component of a given channel is typically identical, a complex symbol may not be made up of two different components of the same constellation point. Instead, the N components of a constellation point must be mapped to different complex symbols in order to ensure the desired diversity.
  • the complex symbols generated in this manner are then spread in a conventional manner over the available time slots, frequencies, and/or antennas, e.g. through interleaving and mapping, so that fading experienced by each of the N dimensions is uncorrelated with fading experienced by any other one of the N dimensions.
  • the following describes an example flow of a method for generating a multi-dimensional constellation for a digital modulation scheme in data transmission. This flow is achieved by, for example, a computer system. Each of the following steps is executed by a central processing unit (CPU).
  • CPU central processing unit
  • FIG. 12 is a block diagram of a transmission apparatus according to an embodiment of the present invention, which is similar to the one shown in FIG. 2 .
  • the elements that are the same as those described above are assigned the same reference numerals thereas, and a detailed explanation thereof is omitted.
  • the transmission apparatus of FIG. 12 differs from that of FIG. 2 in that the rotated constellation demapper 230 is replaced with a rotated constellation demapper 1230.
  • the rotated constellation demapper 1230 performs processing on the basis of an N-dimensional rotated constellation that has a plurality of constellation points defined by positions thereof within an N-dimensional space, the positions being obtained by applying either the N-dimensional rotation matrix shown in the above Math. 20, or an N-dimensional rotation matrix obtained by permuting rows and/or columns of the N-dimensional rotation matrix shown in the above Math. 20, to a subset of , which is the N-dimensional integer lattice.
  • this processing is to map the output of the bit interleaver 220 to the rotated constellation.
  • FIG. 13 is a block diagram of a reception apparatus according to an embodiment of the present invention, which is similar to the one shown in FIG. 4 .
  • the elements that are the same as those described above are assigned the same reference numerals thereas, and a detailed explanation thereof is omitted.
  • the reception apparatus of FIG. 13 differs from that of FIG. 4 in that the rotated constellation demapper 450 is replaced with a rotated constellation demapper 1350.
  • the rotated constellation demapper 1350 performs processing on the basis of an N-dimensional rotated constellation that has a plurality of constellation points defined by positions thereof within an N-dimensional space, the positions being obtained by applying either the N-dimensional rotation matrix shown in the above Math. 20, or an N-dimensional rotation matrix obtained by permuting rows and/or columns of the N-dimensional rotation matrix shown in the above Math. 20, to a subset of , which is the N-dimensional integer lattice.
  • the rotated constellation demapper 1350 of FIG. 13 includes a rotated constellation mapper 1420, instead of the rotated constellation mapper 720 shown in FIG. 7 .
  • the rotated constellation mapper 1420 maps the outputs b 1 to b 4 from the counter 710 to an N-dimensional rotated constellation that has a plurality of constellation points defined by positions thereof within an N-dimensional space, the positions being obtained by applying either the N-dimensional rotation matrix shown in the above Math. 20, or an N-dimensional rotation matrix obtained by permuting rows and/or columns of the N-dimensional rotation matrix shown in the above Math. 20, to a subset of , which is the N-dimensional integer lattice. Then, the rotated constellation mapper 1420 outputs the resulting constellation components s 1 to s 4 to the squared Euclidean distance calculator 730.
  • the structures of the transmission apparatus and the reception apparatus are not limited to those described above.
  • the reception apparatus may have either one of the structures shown in FIGs. 10 and 11 .
  • the rotated constellation demapper 1010 or 720 performs processing on the basis of an N-dimensional rotated constellation that has a plurality of constellation points defined by positions thereof within an N-dimensional space, the positions being obtained by applying either the N-dimensional rotation matrix shown in the above Math. 20, or an N-dimensional rotation matrix obtained by permuting rows and/or columns of the N-dimensional rotation matrix shown in the above Math. 20, to a subset of , which is the N-dimensional integer lattice.
  • the present invention relates to digital data communication and provides an efficient method for generating multi-dimensional constellations for digital data modulation with a high degree of modulation diversity, a method for transmitting and receiving data on the basis of such constellations, and a corresponding apparatus. This is achieved by considering only multi-dimensional rotation matrices with all elements on the diagonal having the same first absolute value and all other elements having the same second absolute value. In this manner, multi-dimensional rotation matrices can be generated having a single independent parameter and a structure that is as regular as possible. The independent parameter can be configured in order to minimize the error probability for various constellation sizes.
  • the present invention is applicable to a communication apparatus that performs modulation/demodulation by using a constellation.

Claims (5)

  1. Appareil de transmission pour transmettre un bloc de données via une pluralité de canaux de transmission, l'appareil de transmission comprenant :
    un modulateur utilisable pour obtenir N composants de constellation conformément au bloc de données à transmettre ; et
    un transmetteur utilisable pour transmettre chacun des N composants de constellation obtenus, dans lequel
    les N composants de constellation sont obtenus en utilisant une transformation orthogonale,
    N est un multiple de quatre, et
    la transformation orthogonale comporte une représentation parmi (i) une représentation matricielle R de dimension N sur N dans laquelle les valeurs absolues de tous les éléments qui se trouvent sur la diagonale principale sont égales à une première valeur, et les valeurs absolues de tous les éléments qui ne se trouvent pas sur la diagonale principale sont égales à une deuxième valeur non nulle, et (ii) une représentation matricielle obtenue en permutant des lignes et/ou des colonnes de la représentation matricielle R de dimension N sur N R = s 1 , 1 ⁢ a s 1 , 2 ⁢ b ⋯ s 1 , N ⁢ b s 2 , 1 ⁢ b s 2 , 2 ⁢ a ⋮ ⋮ ⋱ s N - 1 , N ⁢ b s N , 1 ⁢ b ⋯ s N , N - 1 ⁢ b s N , N ⁢ a
    Figure imgb0057
    dans laquelle a et b désignent des paramètres réels,
    chaque valeur de signe si,j répond à l'équation si,j ∈ {-1,+1}, et
    les paramètres réels a et b répondent à l'équation a2 +(N-1)b 2=1.
  2. Appareil de réception pour recevoir un bloc de données via une pluralité de canaux de transmission, l'appareil de réception comprenant :
    un récepteur utilisable pour recevoir une pluralité de signaux de composant ; et
    un démodulateur utilisable pour mettre en oeuvre un traitement de démappage de N composants de constellation conformément à la pluralité de signaux de composant reçus, dans lequel
    les N composants de constellation sont obtenus en utilisant une transformation orthogonale,
    N est un multiple de quatre, et
    la transformation orthogonale comporte une représentation parmi (i) une représentation matricielle R de dimension N sur N dans laquelle les valeurs absolues de tous les éléments qui se trouvent sur la diagonale principale sont égales à une première valeur, et les valeurs absolues de tous les éléments qui ne se trouvent pas sur la diagonale principale sont égales à une deuxième valeur non nulle, et (ii) une représentation matricielle obtenue en permutant des lignes et/ou des colonnes de la représentation matricielle R de dimension N sur N R = s 1 , 1 ⁢ a s 1 , 2 ⁢ b ⋯ s 1 , N ⁢ b s 2 , 1 ⁢ b s 2 , 2 ⁢ a ⋮ ⋮ ⋱ s N - 1 , N ⁢ b s N , 1 ⁢ b ⋯ s N , N - 1 ⁢ b s N , N ⁢ a
    Figure imgb0058
    dans laquelle a et b désignent des paramètres réels,
    chaque valeur de signe s ¡,j répond à l'équation si,j ∈{-1,+1}, et
    les paramètres réels a et b répondent à l'équation a 2+(N-1)b 2=1.
  3. Procédé de transmission pour transmettre un bloc de données via une pluralité de canaux de transmission, le procédé de transmission comprenant :
    l'obtention de N composants de constellation conformément au bloc de données à transmettre ; et
    la transmission de chacun des N composants de constellation obtenus, dans lequel
    les N composants de constellation sont obtenus en utilisant une transformation orthogonale,
    N est un multiple de quatre, et
    la transformation orthogonale comporte une représentation parmi (i) une représentation matricielle R de dimension N sur N dans laquelle les valeurs absolues de tous les éléments qui se trouvent sur la diagonale principale sont égales à une première valeur, et les valeurs absolues de tous les éléments qui ne se trouvent pas sur la diagonale principale sont égales à une deuxième valeur non nulle, et (ii) une représentation matricielle obtenue en permutant des lignes et/ou des colonnes de la représentation matricielle R de dimension N sur N R = s 1 , 1 ⁢ a s 1 , 2 ⁢ b ⋯ s 1 , N ⁢ b s 2 , 1 ⁢ b s 2 , 2 ⁢ a ⋮ ⋮ ⋱ s N - 1 , N ⁢ b s N , 1 ⁢ b ⋯ s N , N - 1 ⁢ b s N , N ⁢ a
    Figure imgb0059
    dans laquelle a et b désignent des paramètres réels,
    chaque valeur de signe si,j répond à l'équation si,j ∈ {-1,+1}, et
    les paramètres réels a et b répondent à l'équation a 2+(N-1)b 2 =1.
  4. Procédé de réception pour recevoir un bloc de données via une pluralité de canaux de transmission, le procédé de réception comprenant :
    la réception d'une pluralité de signaux de composant ; et
    la mise en oeuvre d'un traitement de démappage de N composants de constellation conformément à la pluralité de signaux de composant reçus, dans lequel
    les N composants de constellation sont obtenus en utilisant une transformation orthogonale,
    N est un multiple de quatre, et
    la transformation orthogonale comporte une représentation parmi (i) une représentation matricielle R de dimension N sur N dans laquelle les valeurs absolues de tous les éléments qui se trouvent sur la diagonale principale sont égales à une première valeur, et les valeurs absolues de tous les éléments qui ne se trouvent pas sur la diagonale principale sont égales à une deuxième valeur non nulle, et (ii) une représentation matricielle obtenue en permutant des lignes et/ou des colonnes de la représentation matricielle R de dimension N sur N R = s 1 , 1 ⁢ a s 1 , 2 ⁢ b ⋯ s 1 , N ⁢ b s 2 , 1 ⁢ b s 2 , 2 ⁢ a ⋮ ⋮ ⋱ s N - 1 , N ⁢ b s N , 1 ⁢ b ⋯ s N , N - 1 ⁢ b s N , N ⁢ a
    Figure imgb0060
    dans laquelle a et b désignent des paramètres réels,
    chaque valeur de signe si,j répond à l'équation si,j ∈ {-1,+1}, et
    les paramètres réels a et b répondent à l'équation a 2 +(N-1)b 2=1.
  5. Procédé de génération pour générer une constellation à N dimensions pour un schéma de modulation numérique dans un système de communication de données, N étant un multiple de quatre, le procédé de génération comprenant :
    la réception d'une pluralité de vecteurs d'un espace à N dimensions ; et
    l'obtention de points de constellation de la constellation à N dimensions en appliquant une transformation orthogonale à la pluralité de vecteurs reçus,
    dans lequel la transformation orthogonale comporte une représentation parmi (i) une représentation matricielle R de dimension N sur N dans laquelle les valeurs absolues de tous les éléments qui se trouvent sur la diagonale principale sont égales à une première valeur, et les valeurs absolues de tous les éléments qui ne se trouvent pas sur la diagonale principale sont égales à une deuxième valeur non nulle, et (ii) une représentation matricielle R obtenue en permutant des lignes et/ou des colonnes de la représentation matricielle de dimension N sur N R = s 1 , 1 ⁢ a s 1 , 2 ⁢ b ⋯ s 1 , N ⁢ b s 2 , 1 ⁢ b s 2 , 2 ⁢ a ⋮ ⋮ ⋱ s N - 1 , N ⁢ b s N , 1 ⁢ b ⋯ s N , N - 1 ⁢ b s N , N ⁢ a
    Figure imgb0061
    dans laquelle a et b désignent des paramètres réels,
    chaque valeur de signe si,j répond à l'équation si,j ∈ {-1,+1} , et
    les paramètres réels a et b répondent à l'équation a 2+(N-1)b 2=1.
EP13170158.3A 2009-08-21 2010-08-17 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement Active EP2634930B1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PL13170158T PL2634930T3 (pl) 2009-08-21 2010-08-17 Wielowymiarowe konstelacje obrócone dla ulepszenia różnorodności w kanałach zanikających
EP13170158.3A EP2634930B1 (fr) 2009-08-21 2010-08-17 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP09168370A EP2288048A1 (fr) 2009-08-21 2009-08-21 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
EP13170158.3A EP2634930B1 (fr) 2009-08-21 2010-08-17 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
EP10754598.0A EP2454822B1 (fr) 2009-08-21 2010-08-17 Appareil d'emission, appareil de reception, procede d'emission, procede de reception et procede pour generer des constellations pluridimensionnelles orientées

Related Parent Applications (3)

Application Number Title Priority Date Filing Date
EP10754598.0 Division 2010-08-17
EP10754598.0A Division-Into EP2454822B1 (fr) 2009-08-21 2010-08-17 Appareil d'emission, appareil de reception, procede d'emission, procede de reception et procede pour generer des constellations pluridimensionnelles orientées
EP10754598.0A Division EP2454822B1 (fr) 2009-08-21 2010-08-17 Appareil d'emission, appareil de reception, procede d'emission, procede de reception et procede pour generer des constellations pluridimensionnelles orientées

Publications (3)

Publication Number Publication Date
EP2634930A2 EP2634930A2 (fr) 2013-09-04
EP2634930A3 EP2634930A3 (fr) 2014-07-30
EP2634930B1 true EP2634930B1 (fr) 2015-12-02

Family

ID=41560884

Family Applications (4)

Application Number Title Priority Date Filing Date
EP09168370A Withdrawn EP2288048A1 (fr) 2009-08-21 2009-08-21 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
EP13170157.5A Active EP2634929B1 (fr) 2009-08-21 2010-08-17 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
EP10754598.0A Active EP2454822B1 (fr) 2009-08-21 2010-08-17 Appareil d'emission, appareil de reception, procede d'emission, procede de reception et procede pour generer des constellations pluridimensionnelles orientées
EP13170158.3A Active EP2634930B1 (fr) 2009-08-21 2010-08-17 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement

Family Applications Before (3)

Application Number Title Priority Date Filing Date
EP09168370A Withdrawn EP2288048A1 (fr) 2009-08-21 2009-08-21 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
EP13170157.5A Active EP2634929B1 (fr) 2009-08-21 2010-08-17 Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
EP10754598.0A Active EP2454822B1 (fr) 2009-08-21 2010-08-17 Appareil d'emission, appareil de reception, procede d'emission, procede de reception et procede pour generer des constellations pluridimensionnelles orientées

Country Status (17)

Country Link
US (3) US8792324B2 (fr)
EP (4) EP2288048A1 (fr)
JP (4) JP5475869B2 (fr)
KR (3) KR101430378B1 (fr)
CN (3) CN102474313B (fr)
AU (1) AU2010285975B2 (fr)
BR (1) BR112012003377B1 (fr)
CA (1) CA2768661C (fr)
EA (2) EA024628B1 (fr)
ES (3) ES2453142T3 (fr)
HU (2) HUE026687T2 (fr)
MX (1) MX2012001744A (fr)
MY (3) MY156813A (fr)
PL (3) PL2634930T3 (fr)
SG (3) SG10201404868WA (fr)
WO (1) WO2011021382A2 (fr)
ZA (3) ZA201200858B (fr)

Families Citing this family (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2288048A1 (fr) * 2009-08-21 2011-02-23 Panasonic Corporation Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
KR20120110376A (ko) * 2011-03-29 2012-10-10 삼성전자주식회사 데이터 복조 방법 및 데이터 통신 방법
EP2523412B1 (fr) * 2011-05-11 2018-09-26 Samsung Electronics Co., Ltd. Appareil et procédé de démappage pondéré
KR20120132994A (ko) * 2011-05-30 2012-12-10 삼성전자주식회사 소프트 디맵핑 장치 및 방법
EP2566119A1 (fr) 2011-08-29 2013-03-06 Panasonic Corporation Constellations pivotées généralisées pour tranchage temps-fréquence
EP2592773A1 (fr) 2011-11-10 2013-05-15 Panasonic Corporation Diversité améliorée pour constellations pivotées avec tranchage de la fréquence temporelle
EP3258631B1 (fr) 2011-11-10 2019-08-14 Sun Patent Trust Procédé de transmission, procédé de réception, émetteur et récepteur
EP2592772A1 (fr) 2011-11-10 2013-05-15 Panasonic Corporation Diversité temporelle améliorée pour constellations pivotées
EP2618532A1 (fr) 2012-01-19 2013-07-24 Panasonic Corporation Entrelacement de composant amélioré pour constellations rotatives
KR102024796B1 (ko) * 2012-04-13 2019-11-04 한국전자통신연구원 계층변조 신호의 전송 장치 및 방법
EP2690813A1 (fr) * 2012-07-27 2014-01-29 Panasonic Corporation Entrelacement de composant transparent pour constellations rotatives
JP5844905B2 (ja) 2012-07-27 2016-01-20 パナソニック株式会社 送信方法、送信機、受信方法、及び受信機
US9325427B1 (en) 2012-10-31 2016-04-26 Ciena Corporation Maximum likelihood decoding
US9106470B2 (en) 2012-12-03 2015-08-11 Qualcomm Incorporated Enhanced decoding and demapping method and apparatus for QAM data signals
US9385905B2 (en) * 2013-03-04 2016-07-05 Intel Corporation Block-based time-frequency interleaving and de-interleaving
GB201312243D0 (en) 2013-07-08 2013-08-21 Samsung Electronics Co Ltd Non-Uniform Constellations
KR101461886B1 (ko) 2013-09-10 2014-11-13 현대자동차 주식회사 쇼트키 배리어 다이오드 및 그 제조 방법
EP2879318A1 (fr) 2013-11-29 2015-06-03 Panasonic Corporation Entrelacement de composant efficace de constellations en rotation avec découpage temps-fréquence
WO2015079665A1 (fr) 2013-11-29 2015-06-04 パナソニック株式会社 Procédé d'émission, dispositif d'émission, procédé de réception et dispositif de réception
CN105471603B (zh) * 2014-08-19 2020-12-11 中兴通讯股份有限公司 一种远程配置光网络单元ptp业务的方法、装置和系统
KR101628986B1 (ko) * 2015-01-12 2016-06-10 강릉원주대학교산학협력단 송신 장치, 수신 장치, 신호 송신 방법 및 신호 수신 방법
US9780854B2 (en) * 2015-03-30 2017-10-03 Taiwan Semiconductor Manufacturing Co., Ltd. Multi-layer wireless streaming with adaptive constellation mapping (ACM)
EP3226501B1 (fr) * 2016-03-31 2020-02-19 Intel IP Corporation Dispositif de communication et procédé de transmission de données
CN106130949B (zh) * 2016-08-12 2019-05-10 上海交通大学 高维星座生成方法及系统
US10601521B2 (en) 2018-05-14 2020-03-24 Nokia Solutions And Networks Oy Coherent optical communication with constellations having coordinates on circles
US11309972B2 (en) 2019-09-20 2022-04-19 Nokia Solutions And Networks Oy Optical communication system employing a multidimensional constellation with an increased minimum distance
KR102460091B1 (ko) 2021-02-09 2022-10-27 한양대학교 산학협력단 링크 적응을 위한 적응적 신호 성상도 설계 방법 및 장치
CN113206695B (zh) * 2021-05-07 2022-08-19 温州大学智能锁具研究院 基于星座图和天线联合的索引矢量调制方法及装置
WO2023117845A1 (fr) * 2021-12-22 2023-06-29 Sony Group Corporation Procédés de communication de n+1 bits et nœuds associés
CN114301753B (zh) * 2022-01-04 2024-01-05 哈尔滨工业大学 一种正交功率分层复用传输方法

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5832044A (en) 1996-09-27 1998-11-03 Elvino S. Sousa Transmitter antenna diversity and fading-resistant modulation for wireless communication systems
US6633614B1 (en) * 1999-09-15 2003-10-14 Telcordia Technologies, Inc. Multicarrier personal access communication system
JP3696013B2 (ja) * 1999-11-30 2005-09-14 株式会社豊田中央研究所 マルチキャリア変調用ダイバーシチ受信方式及びマルチキャリア変調用ダイバーシチ受信装置
US6418170B1 (en) * 2000-02-07 2002-07-09 Motorola, Inc. Method and apparatus for achieving 180° phase invariant transmission in a PCM modem system
CA2403621A1 (fr) * 2000-04-18 2002-09-19 Linkair Communications, Inc. Procede de transformation orthogonale par etalement de spectre de codes multiadresses
JP4174030B2 (ja) * 2001-08-23 2008-10-29 ノーテル・ネットワークス・リミテッド コセットと強調的にコード化されたコセット識別子とを組み合わせることにより直交振幅変調を実行するシステムおよび方法
US7095812B2 (en) * 2002-06-24 2006-08-22 Agere Systems Inc. Reduced complexity receiver for space-time- bit-interleaved coded modulation
JP4353774B2 (ja) * 2002-12-04 2009-10-28 パナソニック株式会社 データ送信方法とデータ受信方法およびそれらを用いた送信装置と受信装置
JP4052388B2 (ja) 2003-03-31 2008-02-27 アイコム株式会社 送信装置、受信装置、送信方法、受信方法及びプログラム
CN100589475C (zh) * 2003-04-21 2010-02-10 Rgb网络有限公司 有线电视信号的宽频带多通道正交振幅调制
EP1635495A1 (fr) * 2003-07-14 2006-03-15 Matsushita Electric Industrial Co., Ltd. Appareil de transmission multi-porteuse, appareil de reception multi-porteuse, et procede de communication multi-porteuse
CN1846382A (zh) * 2003-09-30 2006-10-11 松下电器产业株式会社 无线发送装置、无线接收装置以及无线发送方法
KR20050041346A (ko) 2003-10-30 2005-05-04 엘지전자 주식회사 미모 시스템의 최적 엠시에스 레벨 선택 방법
KR100757963B1 (ko) 2003-12-24 2007-09-11 삼성전자주식회사 통신시스템에서 부호화 방법 및 장치
CN101263679A (zh) * 2005-08-12 2008-09-10 诺基亚公司 用于在多载波mimo系统中布置导频的方法、系统、装置和计算机程序产品
JP4611864B2 (ja) * 2005-10-28 2011-01-12 Ｋｄｄｉ株式会社 伝送方式
JP4684852B2 (ja) * 2005-11-02 2011-05-18 Ｋｄｄｉ株式会社 符号拡散方法及び符号拡散装置
CN101796790B (zh) * 2005-12-12 2013-12-18 皇家飞利浦电子股份有限公司 增加qam调制的通信系统分集的系统、发射器和方法
CN100518165C (zh) * 2006-12-07 2009-07-22 杭州电子科技大学 一种适于实现的多电平正交幅度调制硬判决方法
CN101295989B (zh) * 2007-04-29 2011-12-07 中兴通讯股份有限公司 一种用于正交频分复用空时和空频块编码方法
US8867662B2 (en) * 2008-03-31 2014-10-21 Qualcomm Incorporated Multidimensional constellations for coded transmission
CN101404642A (zh) * 2008-11-14 2009-04-08 南京航空航天大学 一种32进制正交幅度调制的软解调方法
EP2288048A1 (fr) * 2009-08-21 2011-02-23 Panasonic Corporation Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
CN102263580A (zh) * 2010-05-24 2011-11-30 华为技术有限公司 广播信号发射方法和装置

Also Published As

Publication number Publication date
ZA201200858B (en) 2014-08-27
US20140307535A1 (en) 2014-10-16
AU2010285975A1 (en) 2012-02-23
KR20130108478A (ko) 2013-10-02
ES2453142T3 (es) 2014-04-04
ES2558580T3 (es) 2016-02-05
US9225451B2 (en) 2015-12-29
KR20130108479A (ko) 2013-10-02
CA2768661C (fr) 2015-01-27
EP2454822B1 (fr) 2014-03-05
AU2010285975B2 (en) 2014-07-24
JP2014116976A (ja) 2014-06-26
US8792324B2 (en) 2014-07-29
US20120140612A1 (en) 2012-06-07
EP2634930A3 (fr) 2014-07-30
CN104135311B (zh) 2017-10-24
HUE027490T2 (en) 2016-11-28
MX2012001744A (es) 2012-03-21
EP2634930A2 (fr) 2013-09-04
JP5896320B2 (ja) 2016-03-30
JP5475869B2 (ja) 2014-04-16
SG10201404868WA (en) 2014-10-30
WO2011021382A4 (fr) 2011-09-15
EP2634929B1 (fr) 2015-10-28
PL2634929T3 (pl) 2016-04-29
KR20120050448A (ko) 2012-05-18
JP2015159544A (ja) 2015-09-03
EP2454822A2 (fr) 2012-05-23
JP2014123967A (ja) 2014-07-03
JP5789785B2 (ja) 2015-10-07
MY156813A (en) 2016-03-31
CA2768661A1 (fr) 2011-02-24
ZA201403925B (en) 2015-04-29
CN102474313A (zh) 2012-05-23
PL2454822T3 (pl) 2014-08-29
US20140307822A1 (en) 2014-10-16
KR101430320B1 (ko) 2014-08-13
JP2013501387A (ja) 2013-01-10
EA201690493A3 (ru) 2016-10-31
KR101430378B1 (ko) 2014-08-13
BR112012003377B1 (pt) 2021-03-23
WO2011021382A3 (fr) 2011-05-26
SG10201404873XA (en) 2014-10-30
EA201270163A1 (ru) 2012-08-30
EP2288048A1 (fr) 2011-02-23
WO2011021382A2 (fr) 2011-02-24
MY175483A (en) 2020-06-30
BR112012003377A2 (pt) 2016-02-16
EP2634929A2 (fr) 2013-09-04
EP2634929A3 (fr) 2014-07-30
CN102474313B (zh) 2014-09-10
US9215027B2 (en) 2015-12-15
EA027617B1 (ru) 2017-08-31
CN104135311A (zh) 2014-11-05
JP5789763B2 (ja) 2015-10-07
MY172697A (en) 2019-12-10
CN104158571B (zh) 2018-06-05
PL2634930T3 (pl) 2016-05-31
SG178396A1 (en) 2012-04-27
KR101430379B1 (ko) 2014-08-13
CN104158571A (zh) 2014-11-19
EA024628B1 (ru) 2016-10-31
ZA201403924B (en) 2015-04-29
ES2562481T3 (es) 2016-03-04
EA201690493A2 (ru) 2016-06-30
HUE026687T2 (en) 2016-07-28

Similar Documents

Publication Publication Date Title
EP2634930B1 (fr) Constellations pluridimensionnelles orientées pour augmenter la diversité des canaux à évanouissement
Pokamestov et al. Dynamically changing SCMA codebooks
AU2014253523B2 (en) Transmission apparatus, reception apparatus, transmission method, reception method, and method for generating rotated multi - dimensional constellations
JP2010246095A (ja) 送信ウェイト決定方法
Kafi et al. Performance Analysis of MGSTC BLAST Spatial Multiplexing Scheme Aided mmWave System on Encrypted Color Image Transmission
Pfletschinger et al. Broadcasting of multiple data streams in overlapping beams and suitable decoding methods

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20130624

AC Divisional application: reference to earlier application

Ref document number: 2454822

Country of ref document: EP

Kind code of ref document: P

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

RIC1 Information provided on ipc code assigned before grant

Ipc: H04B 7/02 20060101AFI20140624BHEP

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LT

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: H04B 7/02 20060101AFI20150423BHEP

Ipc: H04J 11/00 20060101ALI20150423BHEP

INTG Intention to grant announced

Effective date: 20150520

GRAR Information related to intention to grant a patent recorded

Free format text: ORIGINAL CODE: EPIDOSNIGR71

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

INTG Intention to grant announced

Effective date: 20151013

AC Divisional application: reference to earlier application

Ref document number: 2454822

Country of ref document: EP

Kind code of ref document: P

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 764028

Country of ref document: AT

Kind code of ref document: T

Effective date: 20151215

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602010029435

Country of ref document: DE

REG Reference to a national code

Ref country code: RO

Ref legal event code: EPE

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2562481

Country of ref document: ES

Kind code of ref document: T3

Effective date: 20160304

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20160302

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 764028

Country of ref document: AT

Kind code of ref document: T

Effective date: 20151202

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20160302

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20160303

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

REG Reference to a national code

Ref country code: SK

Ref legal event code: T3

Ref document number: E 20549

Country of ref document: SK

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: SUN PATENT TRUST

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 7

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20160402

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20160404

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602010029435

Country of ref document: DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 602010029435

Country of ref document: DE

Owner name: SUN PATENT TRUST, NEW YORK, US

Free format text: FORMER OWNER: PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LTD., OSAKA-SHI, OSAKA-FU, JP

Ref country code: DE

Ref legal event code: R081

Ref document number: 602010029435

Country of ref document: DE

Owner name: SUN PATENT TRUST, NEW YORK, US

Free format text: FORMER OWNER: PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LTD., OSAKA-SHI, JP

Ref country code: DE

Ref legal event code: R081

Ref document number: 602010029435

Country of ref document: DE

Owner name: SUN PATENT TRUST, NEW YORK, US

Free format text: FORMER OWNER: PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LTD., OSAKA, JP

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

26N No opposition filed

Effective date: 20160905

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

Owner name: SUN PATENT TRUST, US

Effective date: 20161011

REG Reference to a national code

Ref country code: HU

Ref legal event code: AG4A

Ref document number: E027490

Country of ref document: HU

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

REG Reference to a national code

Ref country code: SK

Ref legal event code: PC4A

Ref document number: E 20549

Country of ref document: SK

Owner name: SUN PATENT TRUST, NEW YORK NY, US

Free format text: FORMER OWNER: PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LTD., OSAKA, JP

Effective date: 20160326

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160831

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160831

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160817

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 8

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20170727 AND 20170802

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160817

REG Reference to a national code

Ref country code: HU

Ref legal event code: GB9C

Owner name: SUN PATENT TRUST, US

Free format text: FORMER OWNER(S): PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LTD., JP

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

Ref country code: MT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160831

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151202

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: TR

Payment date: 20230815

Year of fee payment: 14

Ref country code: RO

Payment date: 20230803

Year of fee payment: 14

Ref country code: IT

Payment date: 20230825

Year of fee payment: 14

Ref country code: GB

Payment date: 20230822

Year of fee payment: 14

Ref country code: CZ

Payment date: 20230807

Year of fee payment: 14

Ref country code: BG

Payment date: 20230823

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SK

Payment date: 20230803

Year of fee payment: 14

Ref country code: PL

Payment date: 20230811

Year of fee payment: 14

Ref country code: HU

Payment date: 20230823

Year of fee payment: 14

Ref country code: FR

Payment date: 20230824

Year of fee payment: 14

Ref country code: DE

Payment date: 20230821

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: ES

Payment date: 20231027

Year of fee payment: 14