SCMA Decoder State Reduction for Low-Latency Sparse Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current decoding techniques for sparsely encoded data in SCMA systems, such as MPA and MLSE, face challenges with complexity, latency, and handling larger data sequences or codebooks, particularly in 5G networks where rapid decoding is required.
Innovation Solution
A method is introduced to reduce the search space for decoding by determining a subset of states centered on an estimate of the received signal, based on characteristics like SNR, signal power, and channel factors, allowing for more efficient decoding using MPA or MLSE within this reduced space.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If MPA or MLSE decoding techniques are used for SCMA systems, then decoding accuracy is maintained, but computational complexity and latency increase significantly
Solution Approach 1:
The patent segments the full search space into multiple reduced search spaces by dividing the codeword sequence into segments and performing decoding on each segment separately. This segmentation reduces the computational complexity from exponential to linear or polynomial scale while maintaining decoding accuracy through iterative refinement of segment boundaries and states.
Solution Approach 2:
The patent introduces dynamic state reduction where the search space size adapts based on received signal quality metrics such as SNR. When signal quality is high, the search space is reduced more aggressively; when quality is low, the search space is maintained larger to ensure accuracy. This dynamic adjustment resolves the contradiction by matching computational effort to actual decoding needs.
2Reliability
If full search space decoding is performed, then decoding accuracy is maximized, but decoding latency increases
Solution Approach 1:
The patent performs preliminary actions by pre-calculating and storing metrics such as Euclidean distances between received signals and codeword estimates, as well as pre-determining segment boundaries and initial state sets. These preliminary calculations enable the main decoding process to proceed with reduced search spaces, significantly lowering latency while maintaining accuracy through the pre-computed information.
Solution Approach 2:
The patent changes the parameter of search space size dynamically based on signal characteristics. By adjusting the number of states to explore based on SNR, signal power, and other received signal parameters, the system achieves accurate decoding only when necessary, reducing overall decoding latency for typical operating conditions while preserving accuracy when signal quality demands it.
3Device complexity
If reduced search space decoding is applied, then computational complexity is reduced, but decoding accuracy may deteriorate
Solution Approach 1:
The patent implements feedback mechanisms where decoding results from reduced search spaces are evaluated against quality metrics, and the search space is adjusted accordingly. If initial reduced search space decoding produces results below a threshold, the system feeds back to expand the search space or redecode with more states, ensuring accuracy is maintained while still benefiting from complexity reduction in successful cases.
Solution Approach 2:
The patent makes the search space size dynamic rather than statically reduced. The number of states explored adapts in real-time based on received signal quality, allowing the system to maintain high accuracy when signals are weak or ambiguous while achieving complexity reduction when signals are strong and clear. This dynamic approach resolves the accuracy-complexity tradeoff by matching computational effort to actual decoding difficulty.
4Productivity
If larger codebooks are used to increase data throughput, then productivity improves, but decoding complexity increases
Solution Approach 1:
The patent segments large codebooks into smaller subsets organized by data sequences or resource elements. Instead of searching through the entire large codebook at once, the system divides the codebook into manageable segments and performs decoding on each segment independently or in a hierarchical manner. This segmentation enables the use of larger codebooks for higher throughput while keeping per-segment decoding complexity manageable.
Solution Approach 2:
The patent dynamically adjusts the effective codebook size used for decoding based on signal quality and system conditions. When channel conditions are good, the system can afford to use smaller effective codebook portions; when conditions are poor, it expands the search within the larger codebook structure. This dynamic approach enables support for large codebooks that increase productivity while adapting the actual decoding complexity to current operational needs.
Data Source
AI summary
Methods and devices are disclosed for receiving and decoding sparsely encoded data sequences using a message passing algorithm (MPA) or maximum likelihood sequence estimation (MLSE). Such data sequences may be used in wireless communications systems supporting multiple access, such as sparse code multiple access (SCMA) systems. The Methods and devices reduce the number of states in a search space for each received signal and associated function node based on a search threshold based on a characteristic related to the received signal and/or to a quality of a resource element over which the received signal is transmitted.