MIMO Decoder Segmentation via QR Decomposition
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of maximum likelihood decoding for multiple-input multiple-output (MIMO) systems increases dramatically with the number of streams, making it challenging to efficiently decode multiple channels, particularly in scenarios with n streams where the computation of hard and soft metrics becomes cumbersome.
Innovation Solution
A reduced complexity maximum likelihood decoder is implemented, which generates transformed data streams using QR matrix decomposition and Hermitian transformations, allowing for the creation of tables with entries representing possible symbol values and distance metrics, ensuring each bit has a competitor and enabling efficient hard and soft decision calculations through LLR metric computations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If maximum likelihood decoding is implemented for MIMO systems with multiple streams, then decoding accuracy is improved, but computational complexity increases dramatically
Solution Approach 1:
The patent segments the MIMO decoding problem into separate processing paths for different streams. By transforming the received signal through QR decomposition, the system divides the joint decoding of n streams into n separate detection stages, where each stream can be processed independently based on its corresponding row in the transformed signal vector. This segmentation dramatically reduces the computational complexity from exponential to linear in the number of streams while maintaining maximum likelihood decoding performance.
2Productivity
If the number of streams n increases, then channel capacity is improved, but the computation of hard and soft metrics becomes cumbersome
Solution Approach 1:
The patent applies segmentation by separating the metric computation for each stream into independent calculations. After QR transformation, each stream's hard decision and soft metric can be computed separately using only its corresponding received signal component and channel row, rather than computing joint metrics over all n streams simultaneously. This reduces the metric computation complexity from O(k^n) to O(n×k) where k is the constellation size.
Solution Approach 2:
The patent changes the parameter representation by transforming the received signal from the original MIMO domain to the QR-decomposed domain. This parameter transformation enables the system to handle increased numbers of streams efficiently, as the transformed parameters (rows of Q^H Y) directly provide the sufficient statistics for each stream's detection without requiring exhaustive joint search over all stream combinations.
3Measurement precision
If QR transformation is applied to separate superpositioned streams, then stream separation is improved, but additional computational steps are required
Solution Approach 1:
The patent applies preliminary action by performing QR decomposition of the channel matrix before the actual detection process. The Q matrix from the QR decomposition is pre-computed and stored, then used to transform the received signal. This preliminary transformation simplifies all subsequent detection operations, as the separated stream metrics can be directly computed from the transformed signal without requiring repeated complex matrix operations during the actual decoding of each received frame.
Data Source
AI summary
A reduced complexity maximum likelihood decoder receives a stream of symbols Y and channel estimate H. A transformation converts Y and H into Z and R by computing matrix R, such that the product of R and Q produces matrix H. A second transformation column-swaps matrix H to form H′, thereafter generating Q′ and R′ subject to the same constraints as was described for Q and R. Transformed variables Z and Z′ are formed by multiplying Y by QH and Q′H, respectively. Table entries with Z and R and Z′ and R′ have entries of all possible x2 accompanied by estimates of x1 derived from x2 and Z, and similar entries of all possible x1 accompanied by estimates of x2 derived from x1 and Z′. Hard and soft decisions are made by finding the minimum distance metric of the combined entries of the first and second table.