ldpc encoder and encoding method in cmmb based on block row cycle
A technology of LDPC codes and encoders, which is applied in the field of efficient implementation of LDPC encoders, can solve problems such as complex backward recursive operations, long encoding time, and large storage capacity, and achieve reduced memory and logic resource requirements and consistency Strong, improve the effect of encoding speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0020] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments, but not as a limitation of the present invention.
[0021] A regular LDPC code can be defined by a parameter set (n, ρ, λ), where n is the code length, ρ and λ are the row weight and column weight of the parity check matrix H, respectively. The LDPC code satisfies the following relationship:
[0022] Hc Τ =0 (1)
[0023] where superscript Τ Indicates transposition, 0 is an all-zero vector (or matrix), and c is the following 1×n order codeword
[0024] c=[c i ] (2)
[0025] Among them, 0≤i
[0026] For LDPC codes in systematic form, H can be transformed into figure 1 The approximate lower triangular shape H shown ALT . In the figure, k is the number of information bits, r is the number of parity bits, and they satisfy k+r=n. It can be seen from the figure that the H ALT Divided horizontally into 3 parts
[0027] h ALT =[H 0 T h ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


