DeepAI AI Chat
Log In Sign Up

A Deterministic Algorithm for the Capacity of Finite-State Channels

by   Chengyu Wu, et al.
The University of Hong Kong
The University of British Columbia

We propose a modified version of the classical gradient descent method to compute the capacity of finite-state channels with Markovian input. Under some concavity assumption, our algorithm proves to achieve a polynomial accuracy in a polynomial time for general finite-state channels. Moreover, for some special families of finite-state channels, our algorithm can achieve an exponential accuracy in a polynomial time.


page 1

page 2

page 3

page 4


A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

This paper presents the first polynomial time algorithm to compute geode...

Quantifying information flow in interactive systems

We consider the problem of quantifying information flow in interactive s...

Finite-Support Capacity-Approaching Distributions for AWGN Channels

In this paper, the Dynamic-Assignment Blahut-Arimoto (DAB) algorithm ide...

Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks

This paper studies the 1-2-1 half-duplex network model, where two half-d...

Delocalisation of one-dimensional marginals of product measures and the capacity of LTI discrete channels

We consider discrete linear time invariant (LTI) channels satisfying the...

How to apply the rubber method for channels with feedback

We give an overview of applications of the rubber method. The rubber met...

Proof Search on Bilateralist Judgments over Non-deterministic Semantics

The bilateralist approach to logical consequence maintains that judgment...