检索结果-内蒙古大学图书馆

6th International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Liu Yuan-hua Zhang Mei-ling Niu Xin-liang Xian Univ Posts & Telecommun Sch Telecommun & Informat Engn Xian Peoples R China China Acad Space Technol Xian Branch Xian Peoples R China

ISBN: (纸本)9781509011957

Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation submatrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.

关键词： QC-LDPC codes construction algorithm peg algorithm girth cycle

来源：评论

学校读者我要写书评

暂无评论

LDPC Codes Based on Hamming and BIBD Codes

LDPC Codes Based on Hamming and BIBD Codes

引用

2016 IEEE 13th International Conference on Signal Processing（ICSP2016）

作者： Huan Ma Lijun Zhang School of Electr.and Inform.Eng Beijing Jiaotong Univ.

A hybrid construction for LDPC codes based on(14, 8) extended Hamming code and(7, 7, 3, 3, 1) BIBD is proposed. The two short codes are used as components in the parity-check matrix of LDPC codes due to elegant decoding performance and structure properties. The new construction algorithm results in LDPC codes with high code rate, and graceful performance using sum-product algorithm(SPA). Experimental results show that hybrid codes constructed with progressive edgegrowth(peg) algorithm and(14, 8) extended Hamming code or(7, 7, 3, 3, 1) BIBD perform well. Code with peg algorithm and(7, 7, 3, 3, 1) BIBD is 2 d B away from Shannon limit in AWGN channel.

关键词： dispersed matrix (14,8) extended Hamming code hybrid construction peg algorithm Rayleigh fading channel (7,7,3,3,1) BIBD

来源：评论

学校读者我要写书评

暂无评论

Hybrid Construction of LDPC Codes with (14,8) Hamming Code 9

Hybrid Construction of LDPC Codes with (14,8) Hamming Code

引用

IEEE 9th International Conference on Anti-counterfeiting, Security, and Identification (ASID)

作者： Ma, Huan Yu, Yangwen Zhang, Lijun Cheng, Lee Lung Beijing Jiaotong Univ Sch Elect & Inform Engn Beijing 100044 Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781467371407

A method for constructing LDPC codes is presented based on a (14, 8) extended Hamming code which is formed via column splitting of the (7, 4) Hamming code. With this code and hybrid construction, it is effortless to generate an LDPC code by mapping the (14, 8) extended Hamming code to components of the parity-check matrix of the LDPC code. Simulation results show that the capacity of hybrid construction of peg code and the (14, 8) extended Hamming code with rate 11.9288 is only a difference of 2 dB around to the Shannon limit owing to the gorgeous property of the (14, 8) code with sum-product algorithm decoding.

关键词： hybrid construction (14,8) Hamming code column splitting Gallager codes peg algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid Construction of LDPC Codes with(14,8) Hamming Code

Hybrid Construction of LDPC Codes with(14,8) Hamming Code

引用

2015 IEEE 9th International Conference on Anti-counterfeiting,Security, and Identification(ASID)

作者： Huan Ma Yangwen Yu Lijun Zhang Lee Lung Cheng School of Electr.and Inform.Eng Beijing Jiaotong Univ Dept.of Electronic Engineering City Univ.of Hong Kong

A method for constructing LDPC codes is presented based on a(14, 8) extended Hamming code which is formed via column splitting of the(7, 4) Hamming code. With this code and hybrid construction, it is effortless to generate an LDPC code by mapping the(14, 8) extended Hamming code to components of the parity-check matrix of the LDPC code. Simulation results show that the capacity of hybrid construction of peg code and the(14, 8) extended Hamming code with rate 0.9288 is only a difference of 2 dB around to the Shannon limit owing to the gorgeous property of the(14, 8) code with sum-product algorithm decoding.

关键词： hybrid construction (14,8) Hamming code column splitting Gallager codes peg algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid construction of LDPC codes of code length within 2,000 with (14, 8) extended Hamming code

Hybrid construction of LDPC codes of code length within 2,00...

引用

6th International Conference on Wireless, Mobile and Multi-Media (ICWMMN 2015)

作者： Huan Ma Yangwen Yu Lijun Zhang School of Electr. and Inform. Eng Beijing Jiaotong Univ. 100044 China

ISBN: (纸本)9781510822030

Based on a (14, 8) extended Hamming code constructed via column splitting of the (7, 4) Hamming code, a method for constructing LDPC codes of code length within 2,000 and of column weight 3 is presented. By using the (14, 8) code and hybrid construction, it is effortless to generate an LDPC code with code rate generally higher than 0.9 by mapping the this code to component of the parity-check matrix. Simulation results show that compared with hybrid construction of Gallager codes and (14, 8) code, that of peg codes and (14, 8) code performs better and the capacity of it is only a difference of 1.5 dB around to the Shannon limit with sum-product algorithm decoding.

关键词： Hybrid construction (14 8) extended Hamming code Column splitting Gallager codes peg algorithm low density parity check codes Codes Fourteen code length Shannon limit code rate

来源：评论

学校读者我要写书评

暂无评论

Design of Quasi-Cyclic LDPC Codes with Maximized Girth Property

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2013年第11期E96A卷 2128-2133页

作者： Phakphisut, Watid Prompakdee, Patanasak Supnithi, Pomchai King Mongkuts Inst Technol Ladkrabang Fac Engn Bangkok 10520 Thailand Fabrinet Co Ltd Patumthanee 12120 Thailand

In this paper, we propose the construction of quasi-cyclic (QC) LDPC codes based on the modified progressive edge-growth (peg) algorithm to achieve the maximum local girth. Although the previously designed QC-LDPC codes based on the peg algorithm has more flexible code rates than the conventional QC-LDPC code, in the design process, multiple choices of the edges may be chosen. In the proposed algorithm, we aim to maximize the girth property by choosing the suitable edges and thus improve the error correcting performance. Simulation results show that the QC-LDPC codes constructed from the proposed method give higher proportion of high local girths than other methods, particularly, at high code rates. In addition, the proposed codes offer superior bit error rate and block error rate performances to the previous peg-QC codes over the additive white Gaussian noise (AWGN) channel.

关键词： QC-LDPC codes peg algorithm local girth

来源：评论

学校读者我要写书评

暂无评论

On the Performance of 1-level LDPC Lattices

On the Performance of 1-level LDPC Lattices

引用

Iran Workshop on Communication and Information Theory (IWCIT)

作者： Sadeghi, Mohammad-Reza Sakzad, Amin Amirkabir Univ Technol Fac Math & Comp Sci Tehran Iran Monash Univ Dept ECSE Clayton Vic 3800 Australia

ISBN: (纸本)9781467350204;9781467350235

The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work, we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1 level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type of lattices allows us to run it for higher dimensions easily. Our simulation results show that a 1-level LDPC lattice of size 10000 can work as close as 1.1 dB at normalized error probability (NEP) of 10(-5). This can also be reported as 0.6 dB at symbol error rate (SER) of 10(-5) with sum-product algorithm.

关键词： LDPC lattice generalized min-sum algorithm peg algorithm lattice decoder

来源：评论

学校读者我要写书评

暂无评论

Construction of Quasi-Cyclic Low-Density Parity-Check Codes for Simplifying Shuffle Networks in Layered Decoder

引用

China Communications 2013年第12期10卷 102-113页

作者：张建军董明科王达金野项海格 State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer SciencePeking University

Offset Shuffle Networks(OSNs) interleave a-posterior probability messages in the Block Row-Layered Decoder(BRLD) of QuasiCyclic Low-Density Parity-Check(QC-LDPC)***,OSNs usually consume a significant amount of computational resources and limit the clock frequency,particularly when the size of the Circulant Permutation Matrix(CPM)is *** simplify the architecture of the OSN,we propose a Simplified Offset Shuffle Network Block Progressive Edge-Growth(SOSNBpeg) algorithm to construct a class of QCLDPC *** SOSN-Bpeg algorithm constrains the shift values of CPMs and the difference of the shift values in the same column by progressively appending check *** results indicate that the error performance of the SOSN-Bpeg codes is the same as that of the codes in WiMAX and *** SOSNBpeg codes can reduce the complexity of the OSNs by up to 54.3%,and can improve the maximum frequency by up to 21.7%for various code lengths and rates.

关键词： QC-LDPC codes construction alg-orithm peg algorithm row-layered decoder shuffle network

来源：评论

学校读者我要写书评

暂无评论

Hybrid Construction of Long LDPC Codes with Very Low Density

Hybrid Construction of Long LDPC Codes with Very Low Density

引用

76th IEEE Vehicular Technology Conference (VTC Fall)

作者： Zhang, Lijun Zhang, Yanjing Cheng, L. L. Beijing Jiaotong Univ Sch Electr & Inform Eng Beijing 100044 Peoples R China City Univ Hong Kong Dept Elect Engn Hong Hom Hong Kong Peoples R China

ISBN: (纸本)9781467318792

By combining an algebraic method and a random method, a hybrid method is proposed to construct LDPC codes, which can easily ensure the girth is at least six. The complexity of construction for the hybrid code is only a fraction of that for peg code, which facilitates the construction of long LDPC codes with very low density. Simulation results show that the hybrid code from EG-LDPC code and peg code has the identical error performance and convergence rate to the peg code with the same length.

关键词： LDPC codes hybrid construction EG-LDPC codes peg algorithm

来源：评论

学校读者我要写书评

暂无评论

Construction of LDPC Codes for the Layered Decoding algorithm

引用

China Communications 2012年第7期9卷 99-107页

作者： Wang Da Dong Mingke Chen Chen Jin Ye Xiang Haige State Key Laboratory of Advanced Optical Communication Systems&Networks School of Electronics Engineering and Computer SciencePeking UniversityBeijing 100871P.R.China

Abstract： The layered decoding algorithm has been widely used in the implementation of Low Density Parity Check （LDPC） decoders, due to its high convergence speed. However, the pipeline operation of the layered decoder may introduce memory access conflicts, which heavily deteriorates the decoder throughput. To essentially deal with the issue of memory access conflicts,

关键词： LDPC codes construction algorithm peg algorithm layered decoding algorithm memory access conflicts

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：