Soft-Output K-Best MIMO Detection for Low Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO detection technologies face challenges in achieving low complexity and high throughput for near-optimum 4×4 MIMO detectors, particularly for high-order quadrature amplitude modulation schemes, due to high computational complexity and resource requirements.
Innovation Solution
The proposed method and system implement a soft-output K-Best MIMO detection algorithm that computes estimated symbol vectors and Log-likelihood Ratio (LLR) values, incorporating processes like relevant discarded paths selection, last-stage on-demand expansion, and relaxed LLR computation to reduce computational complexity while maintaining Bit Error Rate (BER) performance, and are implemented in a deeply pipelined and parallel architecture.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional MIMO detection algorithms are used to achieve near-optimum performance, then Bit Error Rate performance is improved, but computational complexity and resource requirements increase
Solution Approach 1:
The detection process is divided into multiple tree levels where at each level only the K best paths are retained and processed, while other paths are discarded. This segmentation of the search space into manageable levels with selective path retention dramatically reduces computational complexity while maintaining near-optimum BER performance through controlled exploration of the detection tree.
Solution Approach 2:
Instead of exhaustively processing all possible paths through the detection tree, the algorithm performs partial action by processing only the K best paths at each level. This partial processing approach achieves acceptable detection performance with significantly reduced computational effort, trading off complete exhaustiveness for practical complexity reduction.
2Reliability
If conventional MIMO detection algorithms are used to achieve near-optimum performance, then Bit Error Rate performance is improved, but hardware resources and area increase
Solution Approach 1:
The hardware architecture is segmented into multiple processing levels corresponding to different stages of the detection tree. Each level processes only the K best paths, allowing the hardware to be compact while maintaining detection performance. The segmented approach avoids the need for large-scale exhaustive search hardware.
Solution Approach 2:
The hardware implements partial processing by dedicating resources to process only the K best paths at each level rather than all possible paths. This partial action principle enables the hardware design to achieve acceptable performance with reduced area requirements by avoiding exhaustive processing hardware.
3Productivity
If conventional MIMO detection algorithms are used to achieve high throughput, then detection speed is improved, but computational complexity increases
Solution Approach 1:
The detection process is segmented into parallel processing levels where K best paths are identified and processed at each stage. This segmentation enables high throughput by organizing computations into manageable, parallelizable units while controlling complexity through selective path retention rather than exhaustive processing.
Solution Approach 2:
The algorithm achieves high throughput by performing partial processing of only the K best paths rather than exhaustive processing of all paths. This partial action approach enables faster detection by reducing the total computational workload while maintaining acceptable performance through focused processing of the most promising paths.
Data Source
AI summary
An approach for Soft-output K-Best MIMO detection comprises computing an estimated symbol vector and Log-Likelihood Ratio (LLR) values for transmitted bits. The approach includes a relevant discarded paths selection process, a last-stage on-demand expansion process, and a relaxed LLR computation process. The relevant discarded paths selection process includes analyzing the K-Best paths and discarded paths at each intermediate tree level and selecting only those discarded paths for further processing that will help in LLR computation for at least one of the transmitted bits. The last-stage on-demand expansion process includes expanding K paths at the tree level 2NT−1 (NT=number of transmit antennas) on-demand to only 2K−1 lowest Partial Euclidean Distance (PED) paths at last tree level 2NT. The relaxed LLR computation scheme includes approximating LLR computations by assuming that discarded path PED is greater than or equal K-Best path PED.