List Decoding Parity Check Before CRC to Cut Latency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication systems, list-based decoding schemes consume excessive processing resources and increase latency due to the performance of cyclic redundancy check (CRC) operations during decoding, which are not optimized for reducing candidate codewords effectively.
Innovation Solution
Implementing a parity check during the list-based decoding process to prune invalid candidate codewords before performing CRC operations, thereby reducing the number of codewords that require further processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If CRC operations are performed during list-based decoding to verify candidate codewords, then decoding reliability is improved, but processing resources and latency increase
Solution Approach 1:
The patent applies preliminary action by performing parity check operations before CRC verification on candidate codewords. The parity check serves as a preliminary filtering step that quickly identifies and eliminates invalid candidate lists before they undergo the more resource-intensive CRC operations, thereby reducing overall decoding latency while maintaining reliability
Solution Approach 2:
The patent segments the decoding verification process into two distinct stages: first parity check operations on candidate lists, then CRC operations on remaining valid candidates. This segmentation allows the system to apply different verification strategies at different stages, optimizing resource usage by performing lightweight parity checks before heavier CRC operations
2Measurement precision
If CRC operations are performed on all candidate codewords during list-based decoding, then decoding accuracy is improved, but processing complexity increases
Solution Approach 1:
The parity check operation serves as a preliminary filtering mechanism that reduces the number of candidate lists before CRC verification. By eliminating invalid candidates early through simple parity checks, the system maintains high decoding accuracy while significantly reducing the computational complexity of subsequent CRC operations
Solution Approach 2:
The patent applies partial action by performing parity checks on all candidate lists but only performing CRC operations on a subset of lists that pass the parity check. This partial application of the more complex CRC operation reduces overall processing complexity while maintaining decoding accuracy for valid candidates
3Reliability
If multiple lists of decoded information are processed through CRC operations, then error detection capability is improved, but power consumption increases
Solution Approach 1:
The parity check operation acts as a preliminary energy-efficient filtering step that eliminates invalid candidate lists before they consume power during CRC operations. By reducing the number of lists that proceed to power-intensive CRC processing, the system maintains error detection capability while significantly reducing overall power consumption
Data Source
AI summary
Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a first network entity may receive, from a second network entity, an encoded communication. The first network entity may decode the encoded communication to obtain a communication via a list-based decoding scheme that includes respective parity check operations for each list of decoded information of a set of one or more lists of decoded information, the parity check operations being configured to be performed prior to a cyclic redundancy check (CRC) operation for the one or more lists of decoded information. Numerous other aspects are described.