Skip to main content


  • Research Article
  • Open Access

Decoding LDPC Convolutional Codes on Markov Channels

EURASIP Journal on Wireless Communications and Networking20082008:729180

  • Received: 31 August 2007
  • Accepted: 26 February 2008
  • Published:


This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.


  • Expense
  • State Estimation
  • System Application
  • Complexity Analysis
  • Channel State

Publisher note

To access the full article, please see PDF

Authors’ Affiliations

Department of Electrical and Computer Engineering, College of Engineering, Utah State University, Logan, UT 84322-4120, USA


© M. Kashyap and C.Winstead. 2008

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.