Algorithms for Computing the Capacity of Markov Channels with Side Information

Singh, Shailendra K and Sharma, Vinod (2002) Algorithms for Computing the Capacity of Markov Channels with Side Information. In: 2002 IEEE Information Theory Workshop, 20-25 October, Bangalore,India, p. 219.

Preview

PDF algorithms.pdf Download (303kB)

Abstract

Consider a finite state, irreducible Markov channel $\lbrace{S_k}\rbrace$. At time k the channel output $Y_k$ depends only on the channel input $X_k$ and the channel state $S_k$. Let $U_k$ and $V_k$ be the CSIT (channel state information at transmitter) and the CSIR (CSI at receiver) respectively. In this paper we provide algorithms to compute the capacity of the Markov channel under various assumptions on CSIT and CSIR where the assumption $P(S_k= s\mid\[U_1^k)=P(S_k{\mid}U_k)\]$ in [1] is not necessarily satisfied. Our algorithms are based on the extension of ideas developed in [3] for channels with feedback.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	27 Jan 2006
Last Modified:	19 Sep 2010 04:23
URI:	http://eprints.iisc.ac.in/id/eprint/5219

Actions (login required)

View Item