METHOD FOR OPTIMAL AND SCALABLE QUADRATURE SPACE-TIME MODULATION
Scalable space-time quadrature spatial modulation for multidimensional wireless systems is performed by configuring a plurality of transmit antennas to each represent an in-phase spatial constellation symbol within an in-phase spatial constellation, and a quadrature spatial constellation symbol within a quadrature spatial constellation, mapping source data to the in-phase spatial constellation symbols and the quadrature spatial constellation symbols represented by the plurality of transmit antennas, wherein the method constructs the set which has equal multiplicities of the transmit antenna activation, which ensures maximum possible transmit diversity and reduces the required complexity, making this feasible for larger number of antennas.
1 . A computer-implemented optimal and scalable quadrature space-time modulation (OS-QSM) method for configuring a plurality of transmit antennas, the method comprising:
configuring the plurality of transmit antennas to each represent an in-phase spatial constellation symbol within an in-phase spatial constellation, and a quadrature spatial constellation symbol within a quadrature spatial constellation,
mapping source data to the in-phase spatial constellation symbols and the quadrature spatial constellation symbols represented by the plurality of transmit antennas,
wherein the method is applying an optimal and scalable quadrature spatial modulation scheme (OS-QSM) resulting in a maximum possible coding gain in the resultant quadrature spatial modulation.
2 . The method of claim 1 , wherein a modification to the iterative shrinkage-thresholding algorithm (ISTA) via boxing, range limiting, and hard-thresholding is performed.
3 . The method of claim 1 , further comprising: proceeding the iterative shrinkage-thresholding algorithm via boxing-hard (ISTA), a greedy selection of the positions of the antennas index and the symbol estimates, and their independent decoding of the corresponding antenna modulated and symbol modulated bits.
4 . The method of claim 3 , wherein process working parallel to the greedy detections, to ensure valid estimates of the index vectors from the given finite set of index vectors are produced as an output and to apply interference cancellation with the confirmed values,
while keeping track of which indices have been retrieved from the greedy selections, before every iteration check whether from the currently decoded indices, a final confirmation can be calculated,
if it cannot be made, remove the interference by the previous greedy selection and make the next iteration.
5 . The method of claim 1 , further comprising: generalization of Golden code and in combination with spatial modulation an operating calculation with a highly sparse received signal is done, without causing large multi-user interference for the overlapping of multiple users.
6 . The method of claim 5 , further comprising: making the signals per-user more-sparse, again allowing for even more users to be overlapped without increasing effective multi-user interference.
7 . A receiver of a communication system having a processor, volatile and/or non-volatile memory, at least one interface adapted to receive a signal in an communication channel, wherein the non-volatile memory stores computer program instructions which, when executed by the microprocessor, configure the receiver to perform operations comprising:
configuring a plurality of transmit antennas to each represent an in-phase spatial constellation symbol within an in-phase spatial constellation, and
a quadrature spatial constellation symbol within a quadrature spatial constellation,
mapping source data to the in-phase spatial constellation symbols and the quadrature spatial constellation symbols represented by the plurality of transmit antennas,
wherein applying an optimal and scalable quadrature spatial modulation scheme (OS-OSM) results in a maximum possible coding gain in the resultant quadrature spatial modulation.
8 . (canceled)
9 . (canceled)
10 . (canceled)
11 . (canceled)
12 . The receiver of claim 7 , wherein a modification to the iterative shrinkage-thresholding algorithm (ISTA) via boxing, range limiting, and hard-thresholding is performed.
13 . The receiver of claim 7 , further comprising: proceeding the iterative shrinkage-thresholding algorithm via boxing-hard (ISTA), a greedy selection of the positions of the antennas index and the symbol estimates, and their independent decoding of the corresponding antenna modulated and symbol modulated bits.
14 . The receiver of claim 7 , wherein process working parallel to the greedy detections, to ensure valid estimates of the index vectors from the given finite set of index vectors are produced as an output and to apply interference cancellation with the confirmed values,
while keeping track of which indices have been retrieved from the greedy selections, before every iteration check whether from the currently decoded indices, a final confirmation can be calculated,
if it cannot be made, remove the interference by the previous greedy selection and make the next iteration.
15 . The receiver of claim 7 , further comprising: generalization of Golden code and in combination with spatial modulation an operating calculation with a highly sparse received signal is done, without causing large multi-user interference for the overlapping of multiple users.
16 . The receiver of claim 15 , further comprising: making the signals per-user more-sparse, again allowing for even more users to be overlapped without increasing effective multi-user interference.