A method for constructing ldpc codes based on cyclic group generator sets in primitive domain
A technology of LDPC code and construction method, applied in the field of channel coding
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0034] The present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments. The following examples are used to illustrate the present invention, but should not be used to limit the scope of the present invention.
[0035]figure 1 It is a flow chart of a traditional LDPC code construction method based on the original domain cyclic group to generate a tuple set; the method comprises the following steps:
[0036] S1. Determine the code length L according to the communication requirements, and determine the original domain GF(p) according to the code length L, where p represents the size of the original domain, which is a prime number; the LDPC constructed by the original domain GF(p) The maximum length of the code is (K+1)p, and the maximum length (K+1)p of the LDPC code constructed based on the original domain GF(p) is to be greater than the code length L, wherein K represents the original domain GF( p) The number of gen...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


