SCMA Message Passing Decoder With Early Belief Propagation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing sparse code multiple access (SCMA) decoder implementations, such as those using the message passing algorithm (MPA), are resource-intensive due to the need for parallel updates and processing of messages across all nodes, which can be inefficient and redundant.
Innovation Solution
The proposed solution involves a device and method that utilize early belief message propagation and serial scheduling in the MPA decoder, where messages are updated and propagated immediately, allowing for the use of early belief information in subsequent calculations, reducing the need for redundant processing and improving decoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If parallel updates and processing of messages across all nodes are used in MPA decoder, then decoding accuracy is improved, but resource consumption and computational overhead increase
Solution Approach 1:
The patent segments the parallel message passing process into sequential stages, where messages are updated and propagated in a structured sequence rather than simultaneously across all nodes. This segmentation maintains decoding accuracy by ensuring all necessary message updates occur, while reducing resource consumption by eliminating the need for full parallel processing infrastructure.
Solution Approach 2:
The patent implements early belief message propagation, where preliminary message updates are performed and propagated before completing all iterative updates. This allows subsequent calculations to utilize early belief information, reducing the total computational overhead while maintaining final decoding accuracy through continued iterative refinement.
2Measurement precision
If iterative message passing is performed across all nodes, then codeword detection quality is improved, but latency increases
Solution Approach 1:
The patent performs preliminary message updates and propagations in early iterations, making belief information available sooner for subsequent calculations. This preliminary action reduces the effective latency by enabling earlier codeword detection decisions while maintaining quality through continued iterative refinement of the belief messages.
Solution Approach 2:
The patent maintains continuous useful action by immediately utilizing propagated belief messages in subsequent calculations without waiting for complete iterative cycles. This continuity reduces idle time and latency while preserving detection quality, as each calculation build upon the most recent available belief information rather than waiting for full iteration completion.
3Reliability
If redundant processing is performed to ensure accurate decoding, then reliability is improved, but computational overhead increases
Solution Approach 1:
The patent implements feedback mechanisms where propagated belief messages are immediately utilized in subsequent calculations. This feedback loop ensures reliability by continuously refining decoding decisions with updated information, while improving computational efficiency by eliminating redundant recalculations that would otherwise be performed without leveraging previous message updates.
Solution Approach 2:
The decoding process serves itself by using propagated belief messages to guide subsequent calculations automatically. This self-service mechanism ensures reliability through consistent use of updated information while improving productivity by reducing the need for external control and redundant processing steps.
Data Source
AI summary
Methods and devices are disclosed for receiving and detecting sparse data sequences using a message passing algorithm (MPA) with early propagation of belief messages. Such data sequences may be used in wireless communications systems supporting multiple access, such as sparse code multiple access (SCMA) systems. The determination and passing of one or more messages for an edge between a function node and a variable node in a factor graph representation of the system may be performed in serial with determined values available early for subsequent computations. The serial computations may be scheduled based on various factors.