Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY

Design and Optimization of Degree Distributions of Irregular LDPC

Erbao Li, Jing Lei, XU Fu-bing

Published Apr 20, 2011• 0 citations
Publisher

Abstract

摘要: 一对好的度分布可以有效降低LDPC的错误平层和编译码复杂度,在AWGN信道下,通过高斯近似分析方法可近似计算给定度分布的LDPC译码门限,利用差分进化算法可优化度分布以获得具有最大门限的度分布,仿真结果表明获得的度分布的译码门限比线性算法优化结果要好0.15dB左右。 关键词: LDPC / 差分进化 / 高斯近似 / 门限值 / 度分布

DOI
10.3724/sp.j.1146.2007.00799

Related papers

A-6-1 Design of Irregular LDPC Codes with Uniform Check Node Degree Distributions

Kenta Kasai, Kohichi Sakaniwa

電子情報通信学会ソサイエティ大会講演論文集•Sep 7, 2005•0 citations

Construction of Quasi-Cyclic LDPC Codes From Prime Fields

Guo-qing Lin, Ru-wei Chen, Xinmei Wang +1 more

摘要: 该文提出一种基于素域构造准循环低密度校验码的方法。该方法是Lan等所提出基于有限域构造准循环低密度校验码的方法在素域上的推广,给出了一类更广泛的基于素域构造的准循环低密度校验码。通过仿真结果证实:所构造的这一类准循环低密度校验码在高斯白噪声信道上采用迭代译码时具有优良的纠错性能。 关键词: 低密度校验码; 准循环码; 素域; 本原元

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Apr 19, 2010•0 citations

Irregular LDPC 부호용 적응 정규화 UMP-BP 복호 알고리즘

김용준, 김남식, 박현철

•Nov 20, 2004•2 citations

Irregular low-density parity-check code design based on integer lattices

Wataru Matsumoto, Hirotaka Imai

We propose an irregular low-density parity-check (LDPC) code design scheme by extension of a regular LDPC code using Latin square matrices of random sequence. Our scheme is a deterministic method that enables to easily design good irregular LDPC code for any code rate and degree distributions. We optimize LDPC codes by Gaussian approximation (GA) Chung, S-Y et al., (2001) method and construct irregular LDPC codes based on integer lattices Vasic, B et al., (2002).

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•1 citation

Design and Optimization of Degree Distributions of Irregular LDPC

Pla Navy

Good degree distributions can improve the error-floor and reduce the complication in encoding and decoding of LDPC.Under AWGN channel,Gaussian approximation algorithm can analyze the decoding threshold of LDPC presented by their degree distributions.Using differential evolution,the degree distributions that possess maximal threshold can be gotten.Through simulation results,the optimized degree distributions which possess a 0.15dB better noisy threshold than using linear algorithm.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Jan 1, 2008•0 citations

On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree

Kyuhyuk Chung

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree d v,max . To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths (5×10²≤N≤4×10³). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree d v,max . We also present some simulation results which show how a block length can be optimized.

한국통신학회논문지•Nov 1, 2010•0 citations
摘要: 一对好的度分布可以有效降低LDPC的错误平层和编译码复杂度,在AWGN信道下,通过高斯近似分析方法可近似计算给定度分布的LDPC译码门限,利用差分进化算法可优化度分布以获得具有最大门限的度分布,仿真结果表明获得的度分布的译码门限比线性算法优化结果要好0.15dB左右。 关键词: LDPC / 差分进化 / 高斯近似 / 门限值 / 度分布
This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree d v,max . To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths (5×10²≤N≤4×10³). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree d v,max . We also present some simulation results which show how a block length can be optimized.