Leaf-Node Prediction for MIMO Detection Complexity

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing MIMO detection algorithms face challenges in achieving a favorable performance-complexity trade-off, with many methods either being too complex or sacrificing performance for reduced complexity.

Innovation Solution

The Leaf-Node Prediction (LNP) detector simplifies MIMO detection by predicting the best candidate vectors and computing log-likelihood ratios (LLR) with reduced complexity, using novel channel metrics and a tree-search approach to minimize the number of leaf nodes and resources required.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the number of transmit and receive antennas is increased to increase system capacity and transmission reliability, then the capacity increases linearly and fading probability decreases exponentially, but the complexity of recovering transmitted information increases significantly

Engineering Contradiction:
Improvetransmission reliabilityVSAvoiddetection complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the detection process into two distinct phases: (1) a low-complexity phase that generates an initial estimate using simplified algorithms, and (2) a refinement phase that applies more complex processing only to correct residual errors. This segmentation allows the system to handle large MIMO configurations by breaking down the exponentially complex detection problem into manageable sequential steps, thereby maintaining reliability while controlling complexity.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary detection actions using low-complexity algorithms to generate initial estimates before applying more sophisticated refinement techniques. By performing this preliminary action, the system eliminates the need to apply high-complexity algorithms to all possible signal combinations, thereby reducing overall detection complexity while preserving transmission reliability in large MIMO systems.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If optimal MIMO detection algorithms are used to achieve maximum performance, then detection accuracy is maximized, but the complexity increases exponentially with the number of channel inputs

Engineering Contradiction:
Improvedetection accuracyVSAvoidalgorithm complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent implements a dynamic detection algorithm that adapts its complexity based on the specific MIMO channel conditions and the desired detection accuracy. The algorithm dynamically selects between different detection strategies (e.g., switching between linear detection and more complex iterative refinement) depending on the channel state information and performance requirements, thereby achieving high detection accuracy only when necessary while reducing complexity in favorable conditions.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes key detection parameters such as the detection threshold, list size, and refinement iteration count based on channel conditions and performance requirements. By dynamically adjusting these parameters, the system can achieve optimal detection accuracy for given complexity constraints, effectively navigating the trade-off between measurement precision and algorithm complexity in large MIMO systems.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If list-sphere detection is used to compute log-likelihood ratios with better performance, then reliability information is obtained, but the processing resources and complexity increase significantly

Engineering Contradiction:
Improvelog-likelihood ratio accuracyVSAvoidprocessing resources
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent segments the log-likelihood ratio computation into two stages: (1) a coarse computation stage that provides approximate LLR values using simplified algorithms, and (2) a refinement stage that computes accurate LLR values only for the most probable signal candidates. This segmentation dramatically reduces the number of complex operations required while maintaining the reliability benefits of accurate LLR computation for decision-making processes.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies partial action by computing full-accuracy log-likelihood ratios only for a limited subset of the most probable signal candidates rather than exhaustively computing them for all possible candidates. This approach provides sufficient reliability information for practical decision-making while significantly reducing the processing resources and energy consumption compared to complete list-sphere detection.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS8223870B2Systems and methods for N-dimensional leaf-node prediction for MIMO detection
Publication Date: 2012.07.17 TEXAS INSTRUMENTS INC
  • US8223870B2 patent drawing
  • US8223870B2 patent drawing
  • US8223870B2 patent drawing

AI summary

Embodiments achieve favorable performance-complexity trade-offs in MIMO detection for three or more channel inputs. Some embodiments describe systems and methods comprising a leaf node predictor for receiving a processed communications stream, determining at least one channel metric corresponding to the communications stream for a given channel realization, and generating at least three instructions to output, which at least one instruction corresponds to at least one predicted best leaf node candidate for the given channel realization. Further embodiments alternatively describe systems and methods which enumerate N1 best values of a first symbol, enumerate N2(i) best values of a second symbol for an i-th best value of the first symbol, enumerate N3(i, j) best values of a third symbol for an i-th best value of the first symbol and j-th best value of the second symbol, combine enumerated best values of each symbol into a leaf-node value, and compute the cost of each leaf-node value enumerated.