MIMO Signal Detection Using Relaxed LLL Lattice Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional lattice-based signal detection techniques face significant complexity issues in lattice reduction, particularly in MIMO systems, which becomes prohibitive as the dimension increases and when channel matrices or lattice bases change frequently, hindering efficient signal detection and decoding.
Innovation Solution
The use of a relaxed Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm, which reduces the complexity of lattice reduction operations by relaxing constraints, allowing for fewer basis vector swaps and adjustable performance gaps, enabling efficient signal detection and decoding in MIMO systems.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional LLL lattice reduction algorithm is used, then detection performance is improved, but computational complexity increases significantly
Solution Approach 1:
The patent applies parameter changes by modifying the LLL algorithm's reduction factor parameter δ. Instead of using the conventional fixed value δ=3/4, the patent dynamically adjusts δ to be less than 3/4 (0 < δ < 3/4), thereby changing the algorithm's behavior to reduce basis vector swapping operations while maintaining adequate detection performance. This parameter modification directly addresses the contradiction by lowering computational complexity without completely sacrificing detection accuracy.
2Measurement precision
If lattice reduction is performed frequently to handle changing channel matrices, then detection accuracy is maintained, but processing delay increases
Solution Approach 1:
The patent applies partial action by performing a reduced version of lattice reduction that doesn't fully satisfy the conventional LLL conditions. By using a relaxed reduction factor δ < 3/4, the algorithm performs only partial basis vector swapping operations needed to achieve adequate reduction, rather than exhaustively applying full LLL reduction. This partial action maintains sufficient detection accuracy while significantly reducing the time required for each reduction operation, thereby lowering processing delay.
3Manufacturing precision
If full LLL reduction with basis vector swapping is applied, then lattice basis quality is improved, but computational overhead increases
Solution Approach 1:
The patent applies local quality by making the lattice reduction process adaptive to local conditions rather than applying uniform full reduction. The relaxed parameter δ < 3/4 allows the algorithm to achieve sufficient local quality in critical areas (maintaining detection performance) while avoiding excessive reduction operations in areas where they are not needed. This selective approach improves lattice basis quality where necessary while reducing overall computational overhead.
Data Source
AI summary
System and methodologies for reduced-complexity signal detection and decoding in a wireless communication system are provided herein. Systems and methodologies presented herein can utilize a relaxed form of the Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm to reduce the complexity of lattice reduction operations in the context of MIMO detection. Additional systems and methodologies presented herein can apply lattice reduction in the context of a maximum likelihood (ML) detector for spherical or elliptical lattice space-time (LAST) codes.


