MIMO Receiver Symbol Estimation via Segmented QR Decomposition
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO systems face complexity issues in signal decoding, particularly with increasing numbers of antennas, leading to high computational complexity and infeasibility for real-time high data rate transmission, especially with methods like sphere decoding and QRM-MLD, which cannot be parallelized and are inefficient for high modulation schemes.
Innovation Solution
A method that reduces the complexity of signal decoding by limiting the search space using sphere decoding to define intervals for each symbol, followed by QR decomposition and maximum likelihood-based decoding, allowing for parallel hardware implementation and efficient real-time processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If maximum likelihood detection methods are used to decode received signals in MIMO systems, then detection accuracy is improved, but computational complexity increases significantly with the number of antennas
Solution Approach 1:
The patent applies segmentation by dividing the complex MIMO detection problem into multiple processing stages: QR decomposition to transform the channel matrix, followed by ordered statistics decoding to process symbols in a predetermined order. This segmentation breaks down the exponentially complex ML detection into manageable linear complexity operations while maintaining acceptable detection accuracy.
Solution Approach 2:
The patent changes the detection parameter from exhaustive search over all possible symbol combinations to ordered statistics-based detection. By using QR decomposition to transform the detection metric and processing symbols in a predetermined order based on reliability metrics, the complexity is reduced from exponential to linear while maintaining reasonable detection performance.
2Device complexity
If sphere decoding or QRM-MLD algorithms are used to reduce complexity, then computational complexity decreases, but the algorithms cannot be parallelized for real-time high data rate transmission
Solution Approach 1:
The patent segments the detection process into independent parallelizable stages: QR decomposition of the channel matrix, followed by ordered statistics decoding of individual symbols. Each symbol can be processed independently in a predetermined order, enabling parallel hardware implementation across multiple antennas and processing units, thus achieving real-time high data rate capability.
Solution Approach 2:
The patent introduces dynamic ordering of symbol detection based on reliability metrics calculated from the QR decomposition. Symbols are processed in a predetermined order determined by their reliability, allowing the system to adaptively prioritize more reliable symbols while maintaining parallel processing capability through systematic ordering rather than sequential exploration.
3Productivity
If the number of antennas is increased to improve communication performance, then bitrate and reliability are improved, but the receiver's decoding task becomes very complex
Solution Approach 1:
The patent applies segmentation by using QR decomposition to transform the MIMO detection problem into a set of independent or lightly coupled symbol detection problems. Each antenna's symbol can be detected independently in a predetermined order, reducing the joint detection complexity from exponential in the number of antennas to linear, thus enabling high antenna counts to achieve high bitrate without prohibitive complexity.
Solution Approach 2:
The patent changes the detection approach from joint maximum likelihood detection of all symbols to ordered statistics detection processing symbols one at a time in a predetermined order. This parameter change transforms the complexity from exponential O(M^N) to linear O(N*M) where N is the number of antennas and M is the modulation order, enabling scalability to high antenna counts.
4Productivity
If QRM-MLD techniques are used to keep the best M candidates, then throughput is fixed and hardware implementation is suitable, but complexity is very high for higher modulation schemes like 256 QAM
Solution Approach 1:
The patent extracts and removes the computationally intensive candidate selection and re-evaluation steps from QRM-MLD. Instead of maintaining and re-evaluating M candidates at each detection stage, the patent directly processes symbols in a predetermined order based on reliability metrics from QR decomposition, eliminating the redundant candidate management overhead that causes high complexity in QRM-MLD for high-order modulations.
Solution Approach 2:
The patent changes the detection parameter from maintaining a fixed number M of candidates (QRM-MLD) to processing all symbols systematically in a predetermined order (OSD). This parameter change eliminates the need for candidate pruning and re-evaluation, reducing complexity from O(M^2) per stage to O(1) per stage, making it suitable for 256 QAM and higher modulations.
Data Source
Figure 1~3
Figure 2~6a
Figure 4~5
AI summary
Receiver adapted for estimating a vector of emitted symbols (x) over a MIMO transmission channel (TC) emitted by a first plurality of emitting antennas, by receiving a vector (y) of received symbols on a second plurality of receiving antennas. The receiver is adapted for estimating said vector of emitted symbols (x) by calculating a metric associated with a criterion for each vector of a subset of all possible vectors of emitted symbols and by selecting an estimation for said vector of emitted symbol as the vector of emitted symbols (x) among said subset which minimizes said metric.