Incremental Lattice Reduction for MIMO Detection Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional MIMO symbol detection systems face high processing complexity and power costs due to iterative computational algorithms, especially in LR-aided detection processes, which hinder efficient hardware implementation and performance.
Innovation Solution
The implementation of an incremental lattice reduction method that terminates early if a reliability assessment condition is satisfied, using a CLLL-MMSE-SIC process, which reduces the number of lattice reduction iterations and basis updates, thereby decreasing processing complexity and power consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional iterative lattice reduction algorithms are used, then detection performance approaches ML performance, but processing complexity and power consumption increase significantly
Solution Approach 1:
The patent implements dynamic early termination of the lattice reduction algorithm by continuously monitoring a reliability metric during iteration. When the metric indicates sufficient detection accuracy, the algorithm terminates prematurely, adapting the processing depth to actual channel conditions rather than always executing the full iterative process
Solution Approach 2:
The patent changes the operational parameters of the lattice reduction algorithm by introducing a reliability assessment metric and using it to dynamically adjust the number of iterations and basis updates. This transforms the fixed-parameter algorithm into a variable-parameter system that optimizes complexity-performance tradeoff
2Reliability
If conventional iterative lattice reduction algorithms are used, then detection performance approaches ML performance, but power consumption increases significantly
Solution Approach 1:
The patent implements dynamic early termination of the lattice reduction algorithm by continuously monitoring a reliability metric during iteration. When the metric indicates sufficient detection accuracy, the algorithm terminates prematurely, adapting the processing depth to actual channel conditions rather than always executing the full iterative process
Solution Approach 2:
The patent changes the operational parameters of the lattice reduction algorithm by introducing a reliability assessment metric and using it to dynamically adjust the number of iterations and basis updates. This transforms the fixed-parameter algorithm into a variable-parameter system that optimizes complexity-performance tradeoff
3Device complexity
If linear detection or SIC methods are used, then processing complexity is reduced, but detection performance and diversity collection are greatly reduced
Solution Approach 1:
The patent segments the detection process into two distinct phases: preprocessing (lattice reduction) and symbol-rate processing (linear detection or SIC). By performing lattice reduction once per packet rather than per symbol, it separates the high-complexity operations from the low-complexity operations, achieving near-ML performance with manageable real-time processing requirements
Data Source
AI summary
An exemplary embodiment of the present invention provides an incremental lattice reduction method comprising: receiving an input signal at a plurality of input terminals; evaluating a reliability assessment condition using a primary symbol vector estimate of at least a portion of the input signal; terminating the incremental lattice reduction method if the reliability assessment condition is satisfied; and if the reliability assessment condition is not satisfied, performing at least one iteration of a lattice reduction detection sub-method to obtain a secondary symbol vector estimate.