Parallel Soft Sphere Decoding for Low-Complexity MIMO Receivers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO receiver technologies face high complexity and inefficiency in decoding multiple-input multiple-output (MIMO) signals, particularly in separating multiplexed user signals over multiple transmit antennas, and in achieving low complexity while maintaining performance.
Innovation Solution
A parallel sphere decoding method that adaptively determines the radius of a hyper-sphere and the number of nodes to retain, based on channel conditions, to reduce complexity and improve decoding efficiency, combining sphere decoding and m-algorithm approaches for iterative joint detection and decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If sphere decoding is used to achieve near ML performance, then detection accuracy is improved, but computational complexity increases exponentially
Solution Approach 1:
The patent segments the exponential search space by organizing lattice points into a tree structure with levels and branches. Instead of evaluating all points simultaneously, the algorithm processes nodes level-by-level, dividing the complex detection problem into manageable segments that can be pruned independently based on metric thresholds.
Solution Approach 2:
The patent extracts and evaluates only the most promising lattice points by computing branch metrics and comparing them against a threshold. Nodes with metrics below the threshold are extracted from further consideration through pruning, while only the most likely candidates are pursued deeper in the search tree, significantly reducing the number of points that need full evaluation.
2Device complexity
If list sphere decoding is used to control search size, then complexity is reduced, but list size stability and radius selection become unstable
Solution Approach 1:
The patent implements dynamic adaptation of the search radius and pruning threshold based on the evolving state of the search tree. The radius is adjusted according to the depth level and the metrics of nodes encountered, allowing the algorithm to respond to channel conditions and signal characteristics in real-time, thereby stabilizing list size while maintaining detection accuracy.
Solution Approach 2:
The algorithm incorporates feedback mechanisms where the metrics of evaluated nodes feed back into the pruning decisions and radius adjustments for subsequent levels. This feedback loop allows the algorithm to learn from previous evaluations and adapt its search strategy, ensuring stable list size control while maintaining near-ML performance across varying channel conditions.
3Reliability
If iterative soft-input soft-output detection is used, then performance is improved, but complexity increases due to enumerating all lattice points
Solution Approach 1:
The patent applies partial action by computing soft outputs for only the most probable lattice points identified through pruning, rather than enumerating all possible points. By focusing computational effort on a subset of high-probability candidates, the algorithm achieves most of the performance benefit of full enumeration with significantly reduced complexity, making iterative detection feasible for practical systems.
Data Source
AI summary
A method and system for detecting and decoding multiple signals. A low-complexity MIMO detector that combines sphere decoding and m-algorithm approaches, while accounting for the effect of channel condition on the decoding operation, is provided. Taking into account the channel condition effectively controls the size of the search tree, and consequently the search complexity, in an adaptive manner. The channel condition is exploited in the construction of the tree to manage the number of branches in the tree and to avoid undesirable growth.