QQ客服 官方微博 反馈留言

	A QC-LDPC construction algorithm for increasing the throughput of layered decoders
	Zhang, Jianjun ; Dong, Mingke ; Jin, Ye
	2013
英文摘要	Pipelined layered decoder (PLD) of quasi-cyclic low-density parity-check (QC-LDPC) codes is one of most popular high-throughput decoder in modern communication systems. However, the traditional QC-LDPC codes are not suitable for PLD and lead to memory access conflict problems (MACPs) that reduce the throughput of PLD. Therefore, an efficient layered block progressive edge-growth (EL-BPEG) algorithm is proposed to construct a class of QC-LDPC codes that can avoid MACPs and increase throughput. EL-BPEG appends check nodes, rather than variable nodes, progressively into Tanner Graph with strict concentrated check-node degrees. And it establishes edges according to the latency of the pipelines in PLD; thus, all idle clocks can be eliminated for the PLD with EL-BPEG codes. Result indicates that the throughput of PLD can be improved by 50.2% to 99.2% by using the EL-BPEG codes compared with the traditional QC-LDPC codes. Simulations show that the error performances of EL-BPEG codes are as well as the codes in standards. ? 2013 IEEE.; EI; 0
语种	英语
DOI标识	10.1109/ICCT.2013.6820446
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/294620]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zhang, Jianjun,Dong, Mingke,Jin, Ye. A QC-LDPC construction algorithm for increasing the throughput of layered decoders. 2013-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。