MIMO Decoder Dynamic Search Area Eigenvalue Weighting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
MIMO systems face challenges in maintaining stable quality and low complexity in varying radiowave propagation environments, particularly when encountering biased dispersion states caused by non-uniform reflectors, which limits the effectiveness of signal separation and increases detection errors.
Innovation Solution
A MIMO decoder that calculates a Moore-Penrose generalized inverse matrix and adjusts the search area for the transmission signal vector based on eigenvalues and eigenvectors, weighting them inversely proportional to their square roots, allowing for efficient signal separation even in biased dispersion states with low complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a fixed search area is used for transmission signal vector detection, then the device complexity is reduced, but the reliability deteriorates in biased dispersion states caused by non-uniform reflectors
Solution Approach 1:
The patent implements a dynamic search area that adapts to channel conditions by calculating eigenvalues and eigenvectors of the channel matrix. The search area is adjusted based on the ratio of maximum to minimum eigenvalues, allowing the decoder to maintain reliability in varying propagation environments including biased dispersion states without requiring excessive complexity
Solution Approach 2:
The patent changes the parameter of search area size based on channel characteristics. By computing eigenvalues of the channel matrix and adjusting the search area radius according to the eigenvalue ratio, the system adapts to different propagation conditions (line-of-sight, non-line-of-sight, biased dispersion) to maintain detection reliability
2Reliability
If the search area is expanded to cover biased dispersion states, then the reliability is improved, but the loss of time increases due to larger search space
Solution Approach 1:
The patent applies local quality by concentrating the search effort in the most probable region. By identifying the dominant eigenvector direction and restricting the search to an ellipsoidal region aligned with this direction, the decoder achieves high detection accuracy without exhaustively searching the entire signal space, thus reducing detection time
3Adaptability or versatility
If conventional fixed search area methods are used, then the ease of operation is maintained, but the adaptability deteriorates in varying radiowave propagation environments
Solution Approach 1:
The patent performs preliminary calculation of eigenvalues and eigenvectors of the channel matrix before the actual signal detection. This preliminary action characterizes the propagation environment and pre-determines the optimal search area parameters, enabling the decoder to adapt to different environments (line-of-sight, non-line-of-sight, biased dispersion) without complex real-time adjustments during detection
Data Source
AI summary
A MIMO decoder, which is capable of changing a search area of a transmission signal vector in accordance with a change in a channel matrix, includes: a generalized inverse vector matrix calculation unit for calculating a generalized inverse matrix of Moore-Penrose derived from a channel matrix indicative of a radiowave propagation environment; a search area limiting processing unit for performing weighting for each eigenvector calculated from the channel matrix in inverse proportion to a square root of an eigenvalue corresponding to the eigenvector, and determines the search area of the transmission signal vector centered at the generalized inverse matrix solution of Moore-Penrose based on the weighted result; and a most likelihood estimation unit for searching for a transmission signal vector by use of a most likelihood estimation based on the search area determined by the search area limiting processing unit.