Soft MIMO Receiver Using LLR Pruning for Fixed-Throughput Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO detection schemes face high computational complexity, especially for high-order constellation schemes and large numbers of transmit antennas, leading to performance losses and inefficiencies in hardware implementation, as they require exhaustive searches and have SNR-dependent throughput.
Innovation Solution
A low-complexity optimal soft MIMO detector is introduced, using efficient Log-likelihood ratio (LLR) calculations and generator matrices to reduce computational complexity, allowing for linear growth with constellation order and independent operation from SNR, suitable for implementation on DSPs, FPGAs, or ASICs, and applicable in WiMax receivers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If maximum-likelihood (ML) detector is used to achieve optimal detection performance, then detection accuracy is improved, but computational complexity grows exponentially with modulation level and number of transmit antennas
Solution Approach 1:
The patent segments the exhaustive search space into multiple subsets organized in a tree structure, where each node represents a partial search. The detector traverses this tree and prunes branches that cannot lead to the optimal solution, thereby segmenting the computational workload while preserving ML performance.
Solution Approach 2:
The patent performs partial search by exploring only the necessary portions of the search space required to guarantee ML optimality. Through pruning techniques, it avoids excessive computation on branches that would not contribute to the final optimal solution, achieving linear complexity while maintaining exact ML detection.
2Reliability
If exhaustive search is performed over all possible input vectors to achieve ML performance, then detection performance is optimized, but the complexity grows exponentially with the number of transmit antennas
Solution Approach 1:
The patent performs preliminary actions by pre-ordering the search space and establishing pruning criteria before the actual detection. The tree structure is built in advance with nodes representing potential solutions, and pruning rules are predetermined based on metric comparisons, enabling efficient traversal without exhaustive enumeration.
Solution Approach 2:
The patent introduces dynamic pruning during the search process, where the traversal adapts by eliminating suboptimal branches based on real-time metric comparisons. This dynamic adjustment of the search space allows the algorithm to maintain optimal performance while adapting computational effort to the specific channel and signal conditions.
3Device complexity
If linear receivers such as Zero-forcing or MMSE are used to reduce complexity, then computational complexity is reduced to linear level, but diversity order is limited to NR−NT+1 resulting in significant performance loss
Solution Approach 1:
The patent changes the fundamental parameter of search methodology from linear algebraic operations to tree-based metric comparison. By transforming the detection problem into a search optimization framework with pruning, it achieves both linear complexity and full diversity order, overcoming the performance limitation of linear receivers.
4Device complexity
If suboptimal ML receivers with limited search space are used to reduce complexity, then computational complexity is reduced, but the optimal ML solution may not be included in the search space generating performance loss
Solution Approach 1:
The patent implements feedback through the pruning mechanism, where each node's metric is compared against the current best solution found. This feedback loop ensures that branches potentially containing the optimal solution are retained, while suboptimal branches are pruned, guaranteeing that the ML solution is included in the final result.
Data Source
AI summary
A low-complexity optimal soft MIMO detector is provided for a general spatial multiplexing (SM) systems with two transmit and NR receive antennas. The computational complexity of the proposed scheme is independent from the operating signal-to-noise ratio (SNR) and grows linearly with the constellation order. It provides the optimal maximum likelihood (ML) solution through the introduction of an efficient Log-likelihood ratio (LLR) calculation method, avoiding the exhaustive search over all possible nodes. The intrinsic parallelism makes it an appropriate option for implementation on DSPs, FPGAs, or ASICs. In specific, this MIMO detection architecture is very suitable to be applied in WiMax receivers based on IEEE 802.16e/m in both downlink (subscriber station) and uplink (base station).