Sphere Decoder Soft Data Quality via Bit Flipping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Sphere decoders in MIMO communications face challenges in preserving the quality of soft data while reducing complexity, as the scope of search is often drastically cut back, leading to impaired soft information in error correction processes.
Innovation Solution
A modified sphere decoder method that computes log-likelihood ratios (LLRs) not only for the most likely binary string but also for all strings obtained by flipping bits of the most likely string, using a new cost function and a shrinking radius search to augment the candidate set for improved soft data quality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a shrinking radius search is used to reduce complexity, then device complexity is reduced, but the quality of soft data deteriorates
Solution Approach 1:
The patent segments the candidate set into two parts: (1) candidates from the shrinking radius sphere search, and (2) additional candidates generated by flipping bits of the most likely string. This segmentation allows the system to use the low-complexity sphere search for initial candidate generation while supplementing with additional candidates to maintain soft data quality for iterative decoding.
Solution Approach 2:
The patent applies partial action by using the shrinking radius search to obtain a subset of candidates rather than all possible candidates. Then it compensates for the incomplete search by generating additional candidates through bit flipping operations, ensuring sufficient candidate coverage for accurate soft information generation without the full computational burden of exhaustive search.
2Device complexity
If the scope of search is drastically cut back, then device complexity is reduced, but reliability of soft information deteriorates
Solution Approach 1:
The patent merges two candidate generation methods: the shrinking radius sphere search and the bit-flipping method. By combining the candidate sets from both approaches, the system achieves a balance between search complexity and soft information reliability, using the sphere search for efficiency and bit flipping for comprehensive candidate coverage.
Solution Approach 2:
The patent uses feedback from the sphere search results (specifically the most likely string and its associated cost function) to generate additional candidates through bit flipping. This feedback mechanism ensures that the additional candidates are strategically selected to complement the sphere search results, improving soft information reliability without proportionally increasing complexity.
3Reliability
If exhaustive searching is performed, then reliability of detection is improved, but device complexity becomes intractable
Solution Approach 1:
The patent segments the exhaustive search space into manageable portions by using the shrinking radius sphere search to identify a core set of likely candidates, then supplements this with bit-flipped candidates. This segmentation approach maintains detection reliability by covering the essential search space while avoiding the intractable complexity of examining all possible candidates.
Solution Approach 2:
The patent changes the search parameter from a fixed comprehensive search to a dynamic candidate generation process. By adjusting the candidate generation strategy based on the most likely string and its cost function, the system achieves reliable detection without the fixed high complexity of exhaustive search, adapting the search scope to actual signal characteristics.
Data Source
AI summary
A symbol vector received from a multiple antenna transmitting array is detected using a sphere decoder. The sphere decoder is used to select from a set of candidate binary strings that string which is most likely to have been transmitted. Soft information for use in a turbo decoder or the like is obtained by considering cost functions for a set of candidate strings, including strings derived from the most likely string by flipping one or more bits thereof.