MIMO-OFDM Signal Detection via Lattice Reduction and Dynamic K-Value
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO-OFDM wireless signal detection methods face challenges in optimizing frequency selective channels, dynamic K-value allocation, and maximizing channel coding and decoding gain, particularly in large-scale antenna systems with high constellation sizes, leading to increased complexity and reduced performance.
Innovation Solution
A low-complexity MIMO-OFDM wireless signal detection method that involves channel matrix preprocessing through lattice reduction and dynamic K-value allocation, enabling efficient K-best search expansion and optimized soft value generation for stable throughput and high channel coding gain.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the K-value is increased to ensure certain reception performance in large-scale antenna systems, then the detection performance improves, but the complexity increases rapidly
Solution Approach 1:
The patent performs channel matrix preprocessing (QR decomposition and lattice reduction) before the actual detection process. This preliminary action transforms the channel matrix into a form that enables more efficient search, reducing the complexity of subsequent detection operations while maintaining reception performance
Solution Approach 2:
The patent introduces dynamic K-value adjustment where the K-factor is not fixed but adapted based on channel conditions and detection requirements. This allows the system to optimize the balance between detection performance and complexity dynamically, rather than using a static high K-value that always increases complexity
2Productivity
If the number of antennas and constellation size are increased to improve data rate and spectrum utilization, then the system capacity improves, but the detection complexity increases exponentially
Solution Approach 1:
The patent applies lattice reduction preprocessing to the channel matrix before detection, which transforms the detection problem into a form where the search space can be more efficiently explored. This preliminary transformation reduces the exponential complexity growth that would otherwise occur with increased antennas and constellation size
Solution Approach 2:
The patent changes the parameter representation of the detection problem by transforming to the lattice reduced domain. This parameter transformation allows the system to handle larger antenna arrays and higher constellation sizes without exponential complexity increase, as the transformed problem has more favorable mathematical properties
3Device complexity
If linear detection methods (ZF, MMSE) are used to minimize complexity, then the device complexity is reduced, but the bit error performance deteriorates due to low Receiver Diversity Gain
Solution Approach 1:
The patent introduces an intermediary processing stage (lattice reduction) between the received signal and the final detection. This intermediary transformation improves the geometric properties of the detection problem, enabling nonlinear search methods to achieve better performance than linear methods while keeping complexity manageable
Solution Approach 2:
The patent employs dynamic K-value adjustment in the search-based detection, allowing the system to adapt the search depth and precision based on channel conditions. This dynamic approach enables the system to achieve performance close to optimal detection when needed, while maintaining lower complexity in favorable conditions
Data Source
AI summary
A signal detection method for a MIMO-OFDM wireless communication system includes obtaining a channel matrix of each subcarrier through channel estimation for each MIMO-OFDM data packet in a plurality of MIMO-OFDM data packets; receiving a reception vector of each subcarrier; performing channel matrix preprocessing for the channel matrix of each subcarrier to generate a global dynamic K-value table, in which the global dynamic K-value table includes a global dynamic K-value corresponding to each search layer of each subcarrier; performing MIMO detection for each OFDM symbol in the MIMO-OFDM data packet, in which the MIMO detection includes performing the following steps for each subcarrier of a current OFDM symbol: reading channel matrix preprocessing results and reception vector of the current subcarrier; transforming the reception vector of the current subcarrier into an LR search domain; and performing K-best search for the current subcarrier to obtain an LR domain candidate transmission vector of the current subcarrier, in which a K-value applied to each search layer of the current subcarrier during the K-best search is a global dynamic K-value in the global dynamic K-value table corresponding to the search layer.