LDPC Encoder Sequence Layout for 16200-Length 3/15 Codewords
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current terrestrial TV broadcasting systems face significant co-channel interference, leading to white spaces where frequency reuse is not possible, resulting in deteriorated spectrum efficiency, and existing LDPC codes are not optimized for the DVB broadcast standard or specific LDPC encoding methods.
Innovation Solution
A new LDPC codeword of length 16200 with a code rate of 3/15 is developed, utilizing an LDPC encoding technique that efficiently performs encoding using a sequence derived from a parity check matrix, specifically a circulant permutation matrix, to facilitate efficient LDPC encoding and decoding in a wireless channel, reducing memory requirements and improving spectrum efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a new LDPC codeword with length 16200 and code rate 3/15 is used, then spectrum efficiency and frequency reuse capability are improved, but device complexity and encoding/decoding computational requirements increase
Solution Approach 1:
The LDPC codeword of length 16200 is segmented into multiple blocks or segments that can be processed independently or in parallel. The encoding process divides the large parity check matrix into smaller sub-matrices, allowing the system to handle the complex 3/15 code rate through modular computation, thereby improving spectrum efficiency without overwhelming device complexity
Solution Approach 2:
The patent optimizes specific parameters of the LDPC code including the code rate 3/15, codeword length 16200, and the structure of the parity check matrix. By carefully selecting and adjusting these parameters, the system achieves improved spectrum efficiency and frequency reuse capability while keeping the computational complexity within manageable bounds for practical implementation
2Quantity of substance
If LDPC encoding is performed using a sequence derived from parity check matrix, then memory requirements are reduced, but encoding speed and processing time may be affected
Solution Approach 1:
The patent extracts and utilizes only the essential elements of the parity check matrix structure needed for encoding, rather than storing or processing the entire matrix. By taking out and using only the necessary sequence elements derived from the parity check matrix, the system reduces memory requirements while maintaining encoding functionality through efficient use of extracted structural information
Data Source
AI summary
A low density parity check (LDPC) encoder, an LDPC decoder, and an LDPC encoding method are disclosed. The LDPC encoder includes first memory, second memory, and a processor. The first memory stores an LDPC codeword having a length of 16200 and a code rate of 3/15. The second memory is initialized to 0. The processor generates the LDPC codeword corresponding to information bits by performing accumulation with respect to the second memory using a sequence corresponding to a parity check matrix (PCM).