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

Authors:
Jiangxin Chen;P. H. Siegel
Affiliations:
Prediction Co., UBS, Santa Fe, NM;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 4

Capacity-achieving codes for finite-state channels with maximum-likelihood decoding

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity-achieving codes for channels with memory with maximum-likelihood decoding

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Noisy constrained capacity for BSC channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

Recent progress in capacity evaluation has made it possible to compute a sequence of lower bounds on the capacity of a finite-state intersymbol-interference (ISI) channel by finding a sequence of optimized Markov input processes with increasing order , for which the state of the process is the previous input symbols. In this correspondence, we prove that, as the order goes to infinity, the sequence of optimized Markov sources asymptotically achieves the capacity of the channel. The conclusion is extended to two-dimensional finite-state ISI channels, the binary symmetric channel (BSC) with constrained inputs, and general indecomposable finite-state channels with a mild constraint.