期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 57, 期 2, 页码 835-857出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2010.2095211
关键词
Block codes; convolutional codes; low-density parity-check (LDPC) codes; message-passing iterative decoding; pseudocodewords; pseudoweights; quasi-cyclic codes; unwrapping; wrapping
资金
- National Science Foundation (NSF) [CCR-0205310, CCF-0830650, DMS-0708033, CCF-0830608]
- NASA [NNX09AI66G]
- Center for Applied Mathematics, University of Notre Dame, Notre Dame, IN
- NASA [NNX09AI66G, 117331] Funding Source: Federal RePORTER
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0830608, 0830650] Funding Source: National Science Foundation
Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper, we discuss several graph-cover-based methods for deriving families of time-invariant and time-varying LDPC convolutional codes from LDPC block codes and show how earlier proposed LDPC convolutional code constructions can be presented within this framework. Some of the constructed convolutional codes significantly outperform the underlying LDPC block codes. We investigate some possible reasons for this convolutional gain, and we also discuss the-mostly moderate-decoder cost increase that is incurred by going from LDPC block to LDPC convolutional codes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据