Cart (Loading....) | Create Account
Close category search window
 

A generalized Blahut-Arimoto algorithm

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

1 Author(s)
Vontobel, P.O. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA

Kavcic proposed in (A. Kavcic, 2001) an algorithm that apparently finds the mutual-information-rate-maximizing parameters of a Markov source at the input to an indecomposable finite-state channel. In this paper we prove that the stationary points of this algorithm indeed correspond one-to-one to the critical points of the information-rate curve. Kavcic's algorithm can be considered as a generalized Blahut-Arimoto algorithm, as it includes as special cases the classical Blahut-Arimoto algorithm for discrete memoryless channels (DMCs) and the solution to finding the capacity-achieving input distribution for finite-state channels with no noise (C.E. Shannon, 1948).

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.