Codebook Searching Apparatus Using Inverse MSE Matrix Diagonal Cofactors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO wireless communication systems face high complexity and computational burden in codebook searching due to the need for full searches every time period T, especially when dealing with a large number of pre-coding matrices, which can lead to inefficient operations and memory usage.
Innovation Solution
The proposed method calculates inversed mean square error (MSE) matrices for pre-coding matrices and selectively performs calculations based on whether the matrices are square or non-square, focusing on cofactors and determinants to reduce the search complexity by eliminating unnecessary calculations and optimizing the selection of pre-coding matrices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If full search is performed to all codebooks every time period T, then the highest searching accuracy is achieved, but the computational complexity and time consumption increase significantly
Solution Approach 1:
The patent pre-calculates and stores the inverse MSE matrices for all L pre-coding matrices before the search process begins. This preliminary action allows the receiver to avoid performing complex matrix inversion operations during each time period T, significantly reducing computational complexity while maintaining searching accuracy.
Solution Approach 2:
The patent segments the codebook search process into two phases: an offline phase where inverse MSE matrices are pre-calculated for all pre-coding matrices, and an online phase where only simple comparisons of pre-computed values are performed. This segmentation separates the heavy computational workload from the real-time search operation.
2Measurement precision
If full search is performed every time period T, then the most accurate pre-coding matrix is selected, but the time consumption and processing burden increase
Solution Approach 1:
The inverse MSE matrices are pre-computed and stored during an offline phase, eliminating the need to perform time-consuming matrix inversion operations during each time period T. This preliminary action preserves selection accuracy while dramatically reducing time consumption during the actual search process.
Solution Approach 2:
The patent creates a copy of the MSE matrix values (specifically the diagonal elements) and stores them for comparison purposes. This copying approach allows the receiver to compare pre-coding matrices based on pre-computed values rather than performing complex calculations in real-time, reducing processing time while maintaining accuracy.
3Reliability
If the codebook contains more pre-coding matrices, then the pre-coding performance is improved, but the searching complexity and memory requirements increase
Solution Approach 1:
The patent pre-calculates and stores inverse MSE matrices for all L pre-coding matrices in advance. This allows the system to handle larger codebooks with more matrices without increasing the computational complexity during the search process, as the heavy calculations are performed offline rather than online.
Solution Approach 2:
The patent calculates and stores only the necessary diagonal elements of the inverse MSE matrices rather than the complete matrices. This partial action reduces memory requirements and computational burden while still providing sufficient information for accurate pre-coding matrix selection, allowing the codebook to contain more matrices without proportional increases in complexity.
Data Source
AI summary
Exemplary embodiments of the present disclosure propose multiple codebook searching methods for a receiver in a communication system, wherein the communication system uses a codebook having L pre-coding matrices. First, L matrices are calculated according to the L pre-coding matrices, and the L matrices are inversed mean square error matrices of the L pre-encoding matrices. Then, diagonal cofactors or determinants of at least S matrices of the L matrices are calculated, and a pre-coding matrix used by the receiver is found according to the maximum cofactors of the diagonal of the at least S matrices or ratios between the maximum cofactors of the diagonals and the determinants of the at least S matrices.