Graph-Based Encoders and their Performance for Finite-State Channels with Feedback

by   Oron Sabag, et al.

The capacity of unifilar finite-state channels in the presence of feedback is investigated. We derive a new evaluation method to extract graph-based encoders with their achievable rates, and to compute upper bounds to examine their performance. The evaluation method is built upon a recent methodology to derive simple bounds on the capacity using auxiliary directed graphs. While it is not clear whether the upper bound is convex, we manage to formulate it as a convex optimization problem using transformation of the argument with proper constraints. The lower bound is formulated as a non-convex optimization problem, yet, any feasible point to the optimization problem induces a graph-based encoders. In all examples, the numerical results show near-tight upper and lower bounds that can be easily converted to analytic results. For the non-symmetric Trapdoor channel and binary fading channels (BFCs), new capacity results are eastablished by computing the corresponding bounds. For all other instances, including the Ising channel, the near-tightness of the achievable rates is shown via a comparison with corresponding upper bounds. Finally, we show that any graph-based encoder implies a simple coding scheme that is based on the posterior matching principle and achieves the lower bound.


page 1

page 4

page 10

page 12


Capacity of Finite-State Channels with Delayed Feedback

In this paper, we investigate the capacity of finite-state channels (FSC...

Computable Upper Bounds on the Capacity of Finite-State Channels

The capacity of finite-state channels (FSCs) without feedback is investi...

Simulation Study of the Upper-limb Wrench Feasible Set with Glenohumeral Joint Constraints

The aim of this work is to improve musculoskeletal-based models of the u...

Reinforcement Learning Evaluation and Solution for the Feedback Capacity of the Ising Channel with Large Alphabet

We propose a new method to compute the feedback capacity of unifilar fin...

Feedback Capacity of MIMO Gaussian Channels

Finding a computable expression for the feedback capacity of additive ch...

Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels

This paper studies the capacities of input-driven finite-state channels,...

Non-Asymptotic Converse Bounds Via Auxiliary Channels

This paper presents a new derivation method of converse bounds on the no...

Please sign up or login with your details

Forgot password? Click here to reset