Sphere Decoding for MIMO Transmission Complexity Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO decoding methods, such as standard Maximum Likelihood Decoding (MLD), face significant complexity issues that result in high power consumption and processing time, especially as the number of antennas and modulation order increase, making them inefficient for practical applications.
Innovation Solution
The method employs successive reduction of bounded regions, using hypercubes to eliminate candidate solutions, reducing complexity by representing received points and candidates with a small number of bits, and performing logical bit operations to determine if candidates fall within these regions, thereby simplifying the decoding process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If standard Maximum Likelihood Decoding (MLD) is used to achieve optimal detection performance, then decoding accuracy is improved, but complexity and power consumption increase exponentially
Solution Approach 1:
The patent segments the complex MLD process into two phases: a coarse phase that eliminates obviously incorrect candidates using simplified distance calculations, and a fine phase that performs precise distance calculations only on remaining candidates. This segmentation reduces complexity by avoiding exhaustive calculations for all candidates while maintaining optimal detection performance.
Solution Approach 2:
The patent applies partial action by performing full precision distance calculations only on a subset of candidates that survive the coarse elimination phase. Instead of calculating distances for all possible candidates (excessive action), the method performs partial calculations only where necessary, significantly reducing computational complexity while preserving decoding accuracy.
2Productivity
If the number of antennas and modulation order increase to improve spectral efficiency, then system capacity is improved, but processing time and complexity increase
Solution Approach 1:
The patent segments the candidate evaluation process into coarse and fine phases, allowing the system to handle larger numbers of antennas and higher modulation orders efficiently. The coarse phase quickly eliminates candidates using simplified calculations, while the fine phase processes only the remaining candidates with full precision, preventing processing time from increasing proportionally with system capacity improvements.
Solution Approach 2:
The patent performs preliminary candidate elimination using coarse distance calculations before committing to full precision calculations. This preliminary action filters out unlikely candidates early in the process, reducing the computational burden that would otherwise scale with the number of antennas and modulation order, thus maintaining acceptable processing times even as system capacity increases.
3Reliability
If exhaustive candidate evaluation is performed to ensure optimal detection, then decoding reliability is improved, but power consumption increases
Solution Approach 1:
The patent applies partial action by performing exhaustive evaluation only on a reduced set of candidates that survive the coarse elimination phase. Instead of evaluating all possible candidates (which would consume excessive power), the method performs partial exhaustive evaluation only where needed to maintain detection reliability, significantly reducing power consumption while preserving optimal detection performance.
Solution Approach 2:
The patent extracts and eliminates obviously incorrect candidates using coarse distance calculations before performing power-intensive full precision calculations. This extraction of unnecessary candidates from the evaluation set reduces the number of operations that consume power, maintaining detection reliability while lowering overall power consumption.
Data Source
Figure 1A~1B
Figure 2A~2C
Figure 3
AI summary
Received point coordinates and estimated candidate coordinates are represented by a reduced bit representation, dividing each dimension into uniformly sized segments. A bounded region surrounding the received point is defined in the total number of dimensions, the bounded region being a hypercube. For each candidate, an elimination process is carried out including : determining whether the candidate is inside or outside the bounded region, eliminating the candidate if it is outside, storing it if it is inside, adding a further bit thereby reducing a size of the bounded region; repeating the elimination process for the candidates stored as potential solutions until a single solution is obtained; determining the transmitted symbols from the single solution found.