Sciweavers

8 search results - page 1 / 2
» Markov Processes Asymptotically Achieve the Capacity of Fini...
Sort
View
GLOBECOM
2006
IEEE
13 years 10 months ago
Feedback Capacity of Stationary Sources over Gaussian Intersymbol Interference Channels
Abstract— We consider discrete-time channels with finitelength intersymbol interference and additive Gaussian noise. The channel noise is considered to be a stationary ARMA (aut...
Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda
CORR
2010
Springer
122views Education» more  CORR 2010»
12 years 11 months ago
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
Guangyue Han, Brian H. Marcus
TSP
2010
12 years 11 months ago
Markov chain monte carlo detectors for channels with intersymbol interference
In this paper, we propose novel low-complexity soft-in soft-out (SISO) equalizers using the Markov chain Monte Carlo (MCMC) technique. We develop a bitwise MCMC equalizer (b-MCMC) ...
Ronghui Peng, Rong-Rong Chen, Behrouz Farhang-Boro...
ICC
2009
IEEE
143views Communications» more  ICC 2009»
13 years 11 months ago
Low Complexity Markov Chain Monte Carlo Detector for Channels with Intersymbol Interference
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...
Ronghui Peng, Rong-Rong Chen, Behrouz Farhang-Boro...