Accumulate-Repeat-Delay-Partial-Delay codes
文献类型：会议论文
| 作者 | Li, Zhongliang; Xia, Guojiang |
| 出版日期 | 2012 |
| 会议名称 | 2011 WASE Global Conference on Science Engineering, GCSE 2011 |
| 会议日期 | December 10, 2011 - December 11, 2011 |
| 会议地点 | Taiyuan and Xian, China |
| 页码 | 167-170 |
| 通讯作者 | Li, Z. (lizl340@sina.com) |
| 中文摘要 | Inspired by Accumulate-Repeat-Accumulate (ARA) codes, in this letter we propose a new channel coding scheme called Accumulate-Repeat-Delay-Partial-Delay (ARDPD) codes. Contrary to ARA codes, ARDPD codes simultaneously achieve good threshold and linear minimum distance. Based on EXIT for LDPC codes, we show that for maximum variable node degree 5, the threshold of ARDPD codes outperforms the best known unstructured irregular LDPC codes. Iterative decoding simulation results show that the proposed codes perform as predicted. |
| 英文摘要 | Inspired by Accumulate-Repeat-Accumulate (ARA) codes, in this letter we propose a new channel coding scheme called Accumulate-Repeat-Delay-Partial-Delay (ARDPD) codes. Contrary to ARA codes, ARDPD codes simultaneously achieve good threshold and linear minimum distance. Based on EXIT for LDPC codes, we show that for maximum variable node degree 5, the threshold of ARDPD codes outperforms the best known unstructured irregular LDPC codes. Iterative decoding simulation results show that the proposed codes perform as predicted. |
| 收录类别 | EI |
| 会议主办者 | World Association of Science Engineering (WASE) |
| 会议录 | Applied Mechanics and Materials
 |
| 会议录出版者 | Trans Tech Publications, P.O. Box 1254, Clausthal-Zellerfeld, D-38670, Germany |
| 学科主题 | 空间技术 |
| 语种 | 英语 |
| ISSN号 | 1660-9336 |
| ISBN号 | 9783037852903 |
| 源URL | [http://ir.nssc.ac.cn/handle/122/2947]  |
| 专题 | 国家空间科学中心_空间技术部 |
| 推荐引用方式 GB/T 7714 | Li, Zhongliang,Xia, Guojiang. Accumulate-Repeat-Delay-Partial-Delay codes[C]. 见:2011 WASE Global Conference on Science Engineering, GCSE 2011. Taiyuan and Xian, China. December 10, 2011 - December 11, 2011. |
入库方式： OAI收割
来源：国家空间科学中心
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。