Minimum Euclidean Distance Finder for MIMO Symbol Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The burden of symbol detection increases with higher modulation orders and ranks in next-generation wireless communication systems, particularly in MIMO systems, necessitating more efficient methods for calculating minimum Euclidean distances for log-likelihood ratio calculations.
Innovation Solution
A modem chip-based method and hardware structure that compares Euclidean distances of symbol vector candidates, calculates and updates minimum distances for bit values, and uses index-based comparators to reduce the number of required comparators, thereby reducing hardware size and overhead in symbol detection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If the modulation order and rank are increased to achieve higher data transmission speed, then the data transmission speed is improved, but the burden of symbol detection increases
Solution Approach 1:
The patent segments the symbol detection process into multiple stages: first calculating Euclidean distances for all candidate symbols, then performing iterative minimum distance searches for each bit position. This segmentation allows the system to handle high-order modulation by breaking down the complex detection task into manageable steps, reducing the overall computational burden while maintaining high data transmission speeds
Solution Approach 2:
The patent implements a partial action approach by performing minimum distance searches only for necessary bit positions rather than processing all possible symbol combinations. The iterative search stops when sufficient precision is achieved, avoiding excessive computation while still providing accurate symbol detection for high-order modulation schemes
2Measurement precision
If the number of comparators is increased to achieve precise minimum Euclidean distance calculation, then the measurement precision is improved, but the hardware size increases
Solution Approach 1:
The patent merges multiple comparator functions into a single common comparator that is reused across different bit positions and symbol candidates. Instead of having dedicated comparators for each calculation, the same comparator unit is shared and reused iteratively, significantly reducing the total number of comparators required while maintaining precise minimum Euclidean distance calculation
Solution Approach 2:
The common comparator is designed with universal functionality to handle multiple comparison tasks. It can compare Euclidean distances for any symbol candidate against any bit position requirement, making it a multi-functional unit that replaces numerous specialized comparators. This universality achieves precise measurements without proportionally increasing hardware size
Data Source
AI summary
An operating method of a modem chip includes receiving a first Euclidean distance (ED) set including an ED of first symbol vector candidates, comparing magnitudes of the EDs of the first ED set, calculating each of a first minimum ED corresponding to a bit value of a first bit being 1 and a second minimum ED corresponding to the bit value of the first bit being 0, the first bit being from among a plurality of bits of a plurality of layers of the transmission symbol, based on first index information including results of the comparing the magnitudes of the EDs of the first ED set, updating the first minimum ED and the second minimum ED with a smallest first minimum ED and a smallest second minimum ED, respectively, and detecting the transmission symbol based on the updated first minimum ED and the updated second minimum ED.