Layered LDPC Decoding Schedules for Breaking Trapping Sets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low-density parity check (LDPC) codes face challenges in achieving low bit-error rates, particularly in high signal-to-noise ratio applications due to error floors and trapping sets, which limit their decoding efficiency and throughput in communication systems.
Innovation Solution
A machine-implemented method for generating a population of decoding schedules for a layered decoder, where triads are defined as sequences of three layers, and decoding schedules are selected based on these triads to optimize the decoding process, allowing for reconfiguration and selection of different schedules to break trapping sets and improve convergence.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional LDPC decoding is used, then implementation complexity is low and parallelization is achieved, but error floors occur at high SNR and bit-error rates cannot be sufficiently reduced
Solution Approach 1:
The patent applies dynamics by making the decoding schedule adaptive rather than fixed. The system dynamically selects from multiple pre-generated decoding schedules based on real-time channel conditions and decoding progress. This allows the decoder to transition between different layer processing sequences to break trapping sets and escape error floors, thereby improving bit-error rate performance without permanently increasing hardware complexity
Solution Approach 2:
The patent changes the parameter of decoding schedule selection by generating multiple schedules with different layer processing sequences and selecting among them based on performance metrics. This parameter change enables the system to adapt to different channel conditions and break trapping sets, improving reliability while maintaining manageable complexity through software-controlled selection rather than hardware multiplication
2Productivity
If fixed decoding schedules are used, then implementation is simple, but trapping sets cause error floors that limit throughput improvement
Solution Approach 1:
The system implements dynamic schedule selection where multiple decoding schedules are pre-generated with different layer processing sequences. During operation, the system dynamically selects the most appropriate schedule based on channel conditions and decoding performance, enabling it to break trapping sets and escape error floors while maintaining high throughput
Solution Approach 2:
The patent applies preliminary action by pre-generating a library of decoding schedules with different layer processing sequences before actual decoding operations. This preparation allows the system to quickly select an appropriate schedule when trapping sets are detected, rather than computing new schedules in real-time, thus improving both throughput and error floor performance
3Reliability
If multiple decoding schedules are tested offline, then better schedule selection improves BER performance, but the testing process requires significant computational resources and time
Solution Approach 1:
The patent applies preliminary action by pre-generating and storing multiple decoding schedules with different layer processing sequences before deployment. This offline preparation allows comprehensive schedule evaluation to be performed once during system setup, and then the selected schedules can be rapidly applied during actual operation without repeated testing, thus improving BER performance while minimizing ongoing time loss
Solution Approach 2:
The system creates multiple copies of decoding schedules with different layer processing sequences and stores them in a schedule library. Instead of re-testing schedules during operation, the system copies the appropriate pre-tested schedule from the library for immediate use, thereby achieving good BER performance through thorough offline testing while avoiding time loss during actual decoding operations
Data Source
AI summary
A method for selecting a population of schedules of an n-layer decoder for offline schedule testing. The method identifies one or more triads, where a triad is a sequence of three layers where no layer is repeated. The method selects a set of schedules where each of the identified triads is contained in at least one schedule. The method associates each selected schedule with one or more key-layer values, where a key layer is the middle layer of a triad contained within the schedule.