MIMO Decoding Hybrid Hard Soft Decision QAM
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current MIMO decoding methods, particularly those using QAM, face high computational overhead, which hampers efficiency in processing MIMO signals.
Innovation Solution
A hybrid decoding approach combining hard decision decoding with soft decision decoding, employing a technique to limit calculations by determining the most likely symbol and its counter hypothesis symbols, thereby reducing the number of required calculations while maintaining near-optimum performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If hard decision decoding is used for MIMO QAM signals, then decoding speed is improved, but decoding accuracy deteriorates
Solution Approach 1:
The decoding process is segmented into two distinct phases: hard decision decoding for rapid initial symbol estimation, followed by soft decision decoding for refined bit-level probability calculation. This segmentation allows the system to leverage the speed of hard decision while incorporating the accuracy of soft decision only where necessary, resolving the contradiction between decoding speed and accuracy.
Solution Approach 2:
The patent applies soft decision decoding partially - not to all symbols, but only to those where the hard decision decoding uncertainty is highest. By calculating soft bit probabilities selectively based on the hard decision results, the system achieves near-optimum decoding accuracy while avoiding the full computational overhead of complete soft decision decoding, thus maintaining high speed.
2Measurement precision
If soft decision decoding is used for MIMO QAM signals, then decoding accuracy is improved, but computational complexity increases
Solution Approach 1:
The patent implements partial soft decision decoding by calculating soft bit probabilities only for symbols where hard decision uncertainty is significant. This selective approach maintains decoding accuracy for critical symbols while dramatically reducing the overall computational complexity compared to applying soft decision decoding to all symbols.
Solution Approach 2:
Hard decision decoding is performed as a preliminary step before soft decision decoding. This preliminary action provides initial symbol estimates that guide the subsequent soft decision process, allowing the system to focus computational resources only on resolving ambiguous cases rather than performing exhaustive soft decision calculations on all symbols.
3Reliability
If full soft decision decoding is implemented, then near-optimum performance is achieved, but hardware implementation complexity increases
Solution Approach 1:
The hardware implementation is segmented into two functional blocks: a hard decision decoding unit for rapid initial processing and a soft decision decoding unit for refined probability calculation. This segmentation allows each unit to be optimized independently, with the hard decision unit handling the bulk of processing in simple hardware and the soft decision unit handling only the necessary refinements, thereby achieving near-optimum performance with reduced hardware complexity.
Solution Approach 2:
The hard decision decoding results serve the soft decision decoding process by providing initial symbol estimates that guide the soft decision calculations. This self-service relationship allows the system to reuse computation results across different decoding stages, reducing redundant calculations and simplifying hardware requirements while maintaining near-optimum performance.
Data Source
Figure 1~3
Figure 4~6
Figure 7~10.
AI summary
A method of decoding a MIMO signal comprises steps of determining a vector of the MIMO signal and for all possible constellation points in a chosen QAM constellation undertaking a selection process to determine a likelihood. The selection process comprises determining a most likely symbol for the vector, determining a distance for the most likely symbol and determining counter hypothesis symbols. For the counter hypothesis symbols a distance from the vector for each of the bit positions in the symbols is then determined. The lowest of the distance values for each of the bit positions in the symbol when the bit is zero and when the bit is one is determined. Using the lowest distance values a likelihood value is then calculated and outputted.