Fano Decoding Scheme Switching for Low-Latency Bit Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication systems, decoding data using a search tree scheme can result in high latency and high block error rates due to the need to revisit reference nodes when bit reliability is below a threshold, leading to increased time consumption and errors.
Innovation Solution
A method where a receiving node decodes information bits using a first scheme from a first information bit to a designated information bit, and then switches to a second scheme, such as Fano decoding, to identify and decode subsequent information bits in parallel across groups of nodes with varying bit levels, including reference nodes and nodes with higher bit levels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a search tree scheme is used for decoding, then decoding can be performed systematically, but latency increases and block error rates increase due to revisiting reference nodes
Solution Approach 1:
The patent segments the decoding process into two distinct schemes: a first decoding scheme for initial decoding attempts and a second decoding scheme for subsequent attempts. This segmentation allows the system to switch between different decoding strategies based on success/failure conditions, avoiding the need to revisit reference nodes in the traditional search tree approach, thereby reducing latency while maintaining reliability
Solution Approach 2:
The patent implements a dynamic decoding approach where the decoding scheme is adaptively switched based on whether the first decoding scheme succeeds or fails. The system dynamically transitions between decoding modes without requiring backtracking to reference nodes, making the decoding process more efficient and reducing the time loss associated with systematic re-searching
2Measurement precision
If a search tree scheme is used for decoding, then comprehensive bit verification can be performed, but time consumption increases due to revisiting reference nodes
Solution Approach 1:
The patent divides the decoding verification process into two phases: initial verification using the first decoding scheme, and subsequent verification using the second decoding scheme. This segmentation ensures comprehensive bit verification is performed across both schemes while avoiding redundant time consumption from revisiting reference nodes in a traditional search tree approach
Solution Approach 2:
The patent performs preliminary decoding and verification using the first decoding scheme before attempting the second decoding scheme. This preliminary action allows the system to catch errors early and switch schemes only when necessary, reducing overall time consumption while maintaining thorough verification
Data Source
AI summary
The present disclosure relates to a 5G communication system or a 6G communication system for supporting higher data rates beyond a 4G communication system such as long term evolution (LTE). A method performed by a receiving node in a wireless communication system is provided. The method may include receiving data including a plurality of information bits from a transmitting node, sequentially decoding information bits from a first information bit to a designated information bit among the received plurality of information bits by using a first scheme, and decoding information bits from a second information bit following the designated information bit among the plurality of information bits by using a second scheme that is different from the first scheme.