The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Low-Complexity Optimization Algorithm for Irregular Low-Density Parity-Check Codes
Author(s): 
Pages: 330-335
Year: Issue:  4
Journal: Journal of Donghua University(English Edition)

Keyword:  irregular low-density parity-check(LDPC)codesTurbo codesoptimization;
Abstract: A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check( LDPC)codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation results show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.
Related Articles
No related articles found