374 search results - page 10 / 75 » On Communicating Automata with Bounded Channels |
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—We consider packet-by-packet rate adaptation to maximize the throughput over a finite-state Markov channel. To limit the amount of feedback data, we use past packet acknowledge...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we develop low-complexity iterative channel estimation techniques for emerging IDMA systems. The channel estimators make use of pilots as well as soft decoded da...
TCBB
2011
13 years 2 months ago
2011
—In this paper, we propose a communication model of evolution and investigate its information-theoretic bounds. The process of evolution is modeled as the retransmission of infor...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation...