Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Bhattad, Kapil"'
Autor:
Bhattad, Kapil
We study the problem of communicating a discrete time analog source over a channel such that the resulting distortion is minimized. For ergodic channels, Shannon showed that separate source and channel coding is optimal. In this work we study this pr
Externí odkaz:
http://hdl.handle.net/1969.1/85928
The min-sum (MS) algorithm is arguably the second most fundamental algorithm in the realm of message passing due to its optimality (for a tree code) with respect to the {\em block error} probability \cite{Wiberg}. There also seems to be a fundamental
Externí odkaz:
http://arxiv.org/abs/0705.1345
We consider the problem of joint source-channel coding for transmitting K samples of a complex Gaussian source over T = bK uses of a block-fading multiple input multiple output (MIMO) channel with M transmit and N receive antennas. We consider the ca
Externí odkaz:
http://arxiv.org/abs/cs/0703035
Autor:
Bhattad, Kapil, Narayanan, Krishna
An alternative to extrinsic information transfer (EXIT) charts called mean squared error (MSE) charts that use a measure related to the MSE instead of mutual information is proposed. Using the relationship between mutual information and minimum mean
Externí odkaz:
http://arxiv.org/abs/cs/0506058
Autor:
Narayanan, Krishna R., Bhattad, Kapil
We consider the problem of compression of two memoryless binary sources, the correlation between which is defined by a Hidden Markov Model (HMM). We propose a Decision Feedback (DF) based scheme which when used with low density parity check codes res
Externí odkaz:
http://arxiv.org/abs/cs/0506043
We give an information flow interpretation for multicasting using network coding. This generalizes the fluid model used to represent flows to a single receiver. Using the generalized model, we present a decentralized algorithm to minimize the number
Externí odkaz:
http://arxiv.org/abs/cs/0506044
Autor:
Narayanan, Krishna R., Bhattad, Kapil
We consider the problem of compression of two memoryless binary sources, the correlation between which is defined by a Hidden Markov Model (HMM). We propose a Decision Feedback (DF) based scheme which when used with low density parity check codes res
Externí odkaz:
http://arxiv.org/abs/cs/0506045
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bhattad, Kapil1 kapilbhattad@gmail.com, Narayanan, Krishna R.2 krn@ece.tamu.edu, Caire, Giuseppe3 caire@usc.edu
Publikováno v:
IEEE Transactions on Information Theory. Jul2008, Vol. 54 Issue 7, p2943-2958. 16p.
