Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

93

Voted

TIT
2008

88views more TIT 2008»

Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

15 years 2 months ago

Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

Download cmrr-star.ucsd.edu

Jiangxin Chen, Paul H. Siegel

Real-time Traffic

TIT 2008 |

claim paper

Related Content

» Feedback Capacity of Stationary Sources over Gaussian Intersymbol Interference Channels

» Concavity of Mutual Information Rate for InputRestricted FiniteState Memoryless Channels a...

» Markov chain monte carlo detectors for channels with intersymbol interference

» Low Complexity Markov Chain Monte Carlo Detector for Channels with Intersymbol Interferenc...

» Energy Optimal Transmission Scheduling in Wireless Sensor Networks

» To Feed or Not to Feed Back

» Capacity of largescale CSMA wireless networks

Post Info
More Details (n/a)

Added	29 Dec 2010
Updated	29 Dec 2010
Type	Journal
Year	2008
Where	TIT
Authors	Jiangxin Chen, Paul H. Siegel

Comments (0)