Scalable Quadrature Spatial Modulation for Massive MIMO
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current quadrature spatial modulation (QSM) schemes face limitations in scalability due to the use of 2×2 space-time block codes (STBCs), which restrict diversity and coding gains, and rely on complex and non-scalable detection methods like maximum likelihood (ML) and sphere detection, making them impractical for large-scale massive MIMO systems.
Innovation Solution
The proposed optimized scalable quadrature spatial modulation (OS-QSM) scheme uses Golden STBC codes for dispersion matrices and a greedy boxed iterative shrinkage thresholding algorithm (GB-ISTA) for detection, allowing for arbitrary block sizes and polynomial-time decodability, ensuring optimal resource utilization and reduced complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If 2×2 space-time block codes (STBCs) are used in QSM schemes, then the detection complexity is reduced, but the diversity and coding gains are limited
Solution Approach 1:
The patent applies dynamic scaling to the STBC size parameter T, allowing it to vary with the number of transmit antennas nT. This dynamic adaptation enables the system to use larger STBC codes when nT is large, thereby achieving higher diversity gains while maintaining manageable detection complexity through the scalable design.
Solution Approach 2:
The patent changes the parameter T (STBC size) from a fixed value to a scalable parameter that depends on nT. By adjusting T according to the system scale, the patent achieves both high diversity gain (when T is large) and controlled complexity (through the relationship T ≤ nT), resolving the contradiction between these two opposing requirements.
2Device complexity
If 2×2 space-time block codes (STBCs) are used in QSM schemes, then the detection complexity is reduced, but the coding gains are limited
Solution Approach 1:
The patent makes the STBC size T a dynamic parameter that scales with nT, allowing the system to exploit larger coding matrices when more antennas are available. This dynamic scaling enables higher coding gains to be achieved without permanently increasing the baseline complexity, as the system adapts T to match the available resources.
Solution Approach 2:
By changing T from a fixed parameter to a scalable one, the patent enables the system to achieve higher coding gains when needed (larger T) while maintaining the flexibility to keep complexity manageable. The relationship T ≤ nT ensures that coding gain improvements come with proportional increases in system resources rather than fixed complexity overhead.
3Measurement precision
If maximum likelihood (ML) or sphere detection methods are used, then the detection accuracy is improved, but the scalability is lost due to exponential complexity growth
Solution Approach 1:
The patent introduces a dynamic detection complexity management strategy where the STBC size T scales with nT. This dynamic relationship ensures that detection accuracy can be maintained through adequate coding (sufficient T) while scalability is preserved by preventing T from growing independently of nT, thus avoiding exponential complexity growth.
Solution Approach 2:
By making T a scalable parameter rather than a fixed large value, the patent enables the system to achieve good detection accuracy (through sufficient but not excessive T) while maintaining polynomial-time complexity. The constraint T ≤ nT ensures that detection complexity grows at a manageable rate, preserving scalability.
4Device complexity
If the STBC size T does not scale with the number of transmit antennas nT, then the detection complexity is kept manageable, but the spectral efficiency is sub-optimal
Solution Approach 1:
The patent implements a dynamic scaling relationship where T grows with nT, allowing the system to achieve optimal spectral efficiency by充分利用 available spatial resources. This dynamic adaptation ensures that larger antenna arrays can exploit larger STBC codes to achieve higher spectral efficiency while keeping detection complexity manageable through the proportional relationship.
Solution Approach 2:
By changing T from a fixed parameter to one that scales with nT, the patent enables spectral efficiency to improve with system size. The relationship T ≤ nT ensures that spectral efficiency can be optimized (larger T for larger nT) without causing detection complexity to grow uncontrollably, thus resolving the contradiction between these two parameters.
5Adaptability or versatility
If QSM schemes are designed for arbitrary block sizes, then the adaptability is improved, but the detection complexity increases
Solution Approach 1:
The patent achieves adaptability to arbitrary block sizes through dynamic scaling of T with nT, rather than through fixed large codes. This dynamic approach allows the system to adapt to different system scales while maintaining manageable detection complexity, as T grows proportionally with available resources rather than independently.
Solution Approach 2:
By making T a scalable parameter, the patent provides adaptability to different system configurations (arbitrary nT values) while controlling detection complexity. The relationship T ≤ nT ensures that complexity increases only when system resources increase, maintaining efficiency across arbitrary block sizes without unnecessary complexity overhead.
Data Source
AI summary
A computer-implemented decoding method of 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, and 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 notion of applying sparse detection, compressed sensing algorithms to decode SM signals is proceeded.


