QC-LDPC H-Matrix Generation With Compressed Shift Information
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing H matrix generating circuits for QC-LDPC codes are inefficient in terms of memory usage and complexity, as they require storing the entire H matrix for encoding and decoding operations, which can be cumbersome and resource-intensive.
Innovation Solution
A circuit and method that calculates conversion values for column sections of the original H matrix, circularly shifts circulant matrices to generate an advanced H matrix with identity matrices in column sections, and compresses this information into H matrix information, reducing memory requirements by excluding shift values of identity matrices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the entire H matrix is stored for encoding and decoding operations, then the decoding function can be performed, but the memory capacity requirement increases and device complexity increases
Solution Approach 1:
The patent extracts only the essential information needed to reconstruct the H matrix - specifically the positions of circulant matrices and their shift values - rather than storing the entire H matrix. This allows the decoder to regenerate the H matrix on-demand, significantly reducing memory capacity requirements while maintaining full decoding functionality.
Solution Approach 2:
The patent pre-calculates and stores the conversion values (shift values) for circulant matrices during the H matrix generation phase. These pre-computed values are then used during decoding to efficiently reconstruct the H matrix without requiring storage of the complete matrix, thereby reducing memory usage while ensuring decoding can proceed correctly.
2Reliability
If the entire H matrix is stored for encoding and decoding operations, then the decoding function can be performed, but the device complexity increases
Solution Approach 1:
The patent extracts only the essential information needed to reconstruct the H matrix - specifically the positions of circulant matrices and their shift values - rather than storing the entire H matrix. This allows the decoder to regenerate the H matrix on-demand, significantly reducing memory capacity requirements while maintaining full decoding functionality.
Solution Approach 2:
The patent creates a multi-functional system where the stored H matrix information serves multiple purposes: it enables both encoding operations and decoding operations, and can be used to generate the full H matrix when needed. This universal approach reduces overall device complexity by eliminating redundant storage and processing paths.
3Quantity of substance
If conversion values are calculated and circulant matrices are shifted to generate advanced H matrix with identity matrices, then memory capacity is reduced, but the generation process becomes more complex
Solution Approach 1:
The patent segments the H matrix into column sections, each containing circulant matrices. By processing and storing information for each segment independently (positions and shift values rather than full matrices), the system reduces overall memory requirements while making the generation process more manageable through modular operations.
Solution Approach 2:
The patent transforms the H matrix representation from storing complete matrix data to storing parameter information (positions of circulant matrices and their shift values). This parameter-based approach reduces memory capacity while the computational complexity of generation is managed through systematic application of conversion values to generate the required shifts.
Data Source
AI summary
An H matrix generating circuit for generating an H matrix of a QC-LDPC code may include: a conversion value calculation unit calculating conversion values corresponding to column sections of an original H matrix including a plurality of circulant matrices; and a shift unit generating an advanced H matrix by circularly shifting circulant matrices positioned in column sections of the original H matrix by amounts of the conversion values, respectively.