Paper Info
Title
An Improvement on LDPC Coded Queued Codes
Abstract
The queued-code based on low-density parity-check (LDPC) codes, which exploit both the near Shannon-limit performance LDPC codes and the instantaneous channel state information (CSI), can provide excellent performance in the block fading channels. The existing work utilized the conventional random puncturing and repetition operation, which may lead to considerable performance loss due to the changed intrinsic connections of parity-check matrix (PCM) for the receiver. In this paper, we present a reversed sequential puncturing (RSP) scheme and a construction method with modified dual-diagonal structure for the LDPC coded queued-code. The consecutive puncturing pattern in reversed direction can ensure the uniform row-weight distribution of the punctured PCM. The modified dual-diagonal form and the RSP scheme can ensure no more than one punctured symbol involved in each check-sum equation. The simulation results demonstrate that our proposed scheme can achieve noticeable performance gains.
Year
DOI
Venue
2008
10.1109/GLOCOM.2008.ECP.769
IEEE Global Telecommunications Conference (Globecom)
Keywords
Field
DocType
parity check matrix,ldpc code,fading,forward error correction,channel state information,low density parity check,gain,channel coding,fading channel,queueing theory,weight distribution,block codes,encoding
Forward error correction,Discrete mathematics,Parity-check matrix,Computer science,Low-density parity-check code,Fading,Block code,Algorithm,Real-time computing,Puncturing,Channel state information,Encoding (memory)
Conference
ISSN
Citations 
PageRank 
1930-529X
0
0.34
References 
Authors
10
4
Name
Order
Citations
PageRank
Ming Jiang119831.08
Chunming Zhao267164.30
Enyang Xu31679.12
Xiaoqun Gong410.69