Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods

Authors:
Xiujie Huang;Aleksandar Kavčic;Xiao Ma;Danilo Mandic
Affiliations:
Department of Electronics Engineering, Sun Yan-Sen University, Guangzhou, Guangdong, China;Department of Electrical Engineering, University of Hawaii, Honolulu, Hawaii;Department of Electronics Engineering, Sun Yan-Sen University, Guangzhou, Guangdong, China;Department of Electrical and Electronic Engineering, Imperial College, London, UK
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 7
Cited 0

Dynamic Programming and Optimal Control

Dynamic Programming and Optimal Control
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Capacity, mutual information, and coding for finite-state Markov channels

IEEE Transactions on Information Theory
Feedback capacity of finite-state machine channels

IEEE Transactions on Information Theory
Simulation-Based Computation of Information Rates for Channels With Memory

IEEE Transactions on Information Theory
Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

IEEE Transactions on Information Theory
A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A non-controllable finite-state channel (FSC) is a finite-state channel in which the user can't control channel states. That is, the channel state of a non-controllable FSC evolves freely according to an uncontrollable probability law. Thus far, good upper bounds on capacities of general non-controllable FSCs remain unknown. Here we develop upper bounds that use delayed feedback and delayed state information, and propose dynamic programming methods to numerically evaluate the bounds.