LDPC Decoder Segmentation for Variable Bit-Length Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
LDPC decoders face challenges in supporting multiple bit lengths, leading to inconsistent processing performance where long codes consume many resources and short codes have low processing performance, failing to meet traffic requirements.
Innovation Solution
A decoding method and decoder that segment, transpose, cyclically shift, and group LDPC codes based on the decoder's bit length, allowing flexible control of parallel decoding operations, reducing resource consumption for long codes and enhancing performance for short codes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If an LDPC decoder is designed in compliance with the maximum bit length (L=360), then long codes can be decoded with high processing performance, but resources are excessively consumed and timing becomes difficult to achieve
Solution Approach 1:
The patent segments the LDPC code into multiple subcodes based on the actual bit length. Instead of always using a decoder configured for maximum bit length (L=360), the code is divided into k subcodes of length l=n/k, where only the necessary number of processing units are activated. This segmentation allows the system to use minimal resources for short codes while maintaining high processing performance for long codes by dynamically adjusting the number of parallel operations.
2Adaptability or versatility
If an LDPC decoder is designed for maximum bit length, then it can support all code lengths, but short codes have low processing performance due to limited parallel operations
Solution Approach 1:
The patent implements a dynamic configuration where the number of parallel processing units is adjusted based on the actual code length being decoded. For short codes, the system activates fewer processing units to match the reduced computational requirements, thereby improving processing performance. The segmentation and transposition operations enable flexible reconfiguration of the decoder to optimize parallel operations for different code lengths while maintaining support for all required bit lengths.
3Quantity of substance
If the decoder bit length is fixed at d, then resource usage is reduced, but the decoder must handle codes of varying lengths through segmentation and grouping
Solution Approach 1:
The patent applies segmentation by dividing the received LDPC code of length n into k subcodes of length l=n/k. These subcodes are then transposed and grouped into m groups of subcodes, where each group contains t subcodes and m=⌈l/d⌉. This segmentation approach allows a fixed-bit-length decoder to efficiently process variable-length codes by breaking them down into manageable chunks that fit the decoder's capacity, reducing resource usage while systematically handling the complexity through structured operations.
Data Source
AI summary
A decoding method and a decoder for a low-density parity-check (LDPC) code, where the method includes dividing, by a decoder, an LDPC code C whose bit length is n into k LDPC codes D={D1,D2,K,Dk-1,Dk}, arranging, by the decoder, Di, i=1,2,K,k−1,k by column to obtain transpose codes DT={D1T,D2T,K,Dk-1T,DkT} of the LDPC codes D, performing cyclic shift on DiT,i=1,2,K,k−1,k by row according to values of corresponding elements in a target check matrix to obtain shift codes E={E1,E2,K,Et-1,Et}, where t is equal to a quantity of rows of the target check matrix, obtaining, by the decoder, t*m groups of LDPC subcodes F1,F2,K,Ftm-1,Ftm according to the shift codes E and a bit length d of the decoder, where Ej is divided into m groups, Ej={(Ej)1d,(Ej)d+12d,K,(Ej)(m-2)d+1(m-1)d,(Ej)(m-1)d+1md}={F(j-1)m+1,F(j-1)m+2,K,Fjm-1,Fjm}, and m=┌l/d┐, and decoding, by the decoder, the m groups of LDPC subcodes to obtain a decoding result of the LDPC code C.