By Topic

Finite-memory problems and algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

A formulation of finite-memory information processing problems is presented. The total state space of the system, including the "memory" of the source and processor, is assumed to be finite. A cost functional is specified over the trajectories of the system and a variational approach is used to minimize cost. There results a two-point boundary value problem and an associated improvement algorithm. Special attention is given to two types of cost functionals: finite-time problems, and time-average problems over an infinite time interval. Several examples are included.

Published in:

Information Theory, IEEE Transactions on  (Volume:20 ,  Issue: 4 )