Results 1  10
of
54
A Generalized BlahutArimoto Algorithm
, 2002
"... Kavcic proposed in [1] an algorithm that optimizes the parameters of a Markov source at the input to a finitestate machine channel in order to maximize the mutual information rate. Numerical results for several channels indicated that his algorithm gives capacityachieving input distributions. In t ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Kavcic proposed in [1] an algorithm that optimizes the parameters of a Markov source at the input to a finitestate machine channel in order to maximize the mutual information rate. Numerical results for several channels indicated that his algorithm gives capacityachieving input distributions
Extension of the Blahut–Arimoto Algorithm for Maximizing Directed Information
"... Abstract—In this paper, we extend the Blahut–Arimoto algorithm for maximizing Massey’s directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a deterministic function of the output. In order to maximize the directed inform ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract—In this paper, we extend the Blahut–Arimoto algorithm for maximizing Massey’s directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a deterministic function of the output. In order to maximize the directed
A generalization of the BlahutArimoto algorithm to finitestate channels
 IEEE TRANS. INF. THEORY
, 2008
"... The classical Blahut–Arimoto algorithm (BAA) is a wellknown algorithm that optimizes a discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in order to maximize the mutual information between channel input and output. This paper considers the problem of optimizing f ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
The classical Blahut–Arimoto algorithm (BAA) is a wellknown algorithm that optimizes a discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in order to maximize the mutual information between channel input and output. This paper considers the problem of optimizing
BlahutArimoto Algorithms for Computing Channel Capacity and RateDistortion
 With Side Information,” IEEE International Symposium on Information Theory (ISIT
"... Abstract — This paper presents numerical algorithms for the computation of the capacity for channels with noncausal transmitter side information (the Gel’fandPinsker problem) and the ratedistortion function for source coding with decoder side information (the WynerZiv problem). The algorithms ar ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
Abstract — This paper presents numerical algorithms for the computation of the capacity for channels with noncausal transmitter side information (the Gel’fandPinsker problem) and the ratedistortion function for source coding with decoder side information (the WynerZiv problem). The algorithms
BlahutArimoto Algorithm and Code Design for ActionDependent Source Coding Problems
"... Abstract—The source coding problem with actiondependent side information at the decoder has recently been introduced to model data acquisition in resourceconstrained systems. In this paper, an efficient BlahutArimototype algorithm for the numerical computation of the ratedistortioncost functio ..."
Abstract
 Add to MetaCart
Abstract—The source coding problem with actiondependent side information at the decoder has recently been introduced to model data acquisition in resourceconstrained systems. In this paper, an efficient BlahutArimototype algorithm for the numerical computation of the rate
1BlahutArimoto Algorithm and Code Design for ActionDependent Source Coding Problems
, 2013
"... The source coding problem with actiondependent side information at the decoder has recently been introduced to model data acquisition in resourceconstrained systems. In this paper, an efficient algorithm for numerical computation of the ratedistortioncost function for this problem is proposed, a ..."
Abstract
 Add to MetaCart
on LDGM codes and message passing. Through numerical examples, the proposed code design is shown to achieve performance close to the lower bound dictated by the ratedistortioncost function. Index Terms Ratedistortion theory, side information “vending machine”, BlahutArimoto algorithm, code design
Information Geometric Formulation and Interpretation of Accelerated BlahutArimototype Algorithms
 IEEE International Workshop on Information Theory, 24–29 Oct
, 2004
"... Abstract — We propose two related classes of iterative algorithms for computing the capacity of discrete memoryless channels. The celebrated BlahutArimoto algorithm is a special case of our framework. The formulation of these algorithms is based on the natural gradient and proximal point methods. W ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Abstract — We propose two related classes of iterative algorithms for computing the capacity of discrete memoryless channels. The celebrated BlahutArimoto algorithm is a special case of our framework. The formulation of these algorithms is based on the natural gradient and proximal point methods
The information bottleneck method
, 1999
"... We define the relevant information in a signal x ∈ X as being the information that this signal provides about another signal y ∈ Y. Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken. ..."
Abstract

Cited by 540 (35 self)
 Add to MetaCart
consistent equations for the coding rules X → ˜ X and ˜ X → Y. Solutions to these equations can be found by a convergent re–estimation method that generalizes the Blahut–Arimoto algorithm. Our variational principle provides a surprisingly rich framework for discussing a variety of problems in signal
1 Squeezing the ArimotoBlahut Algorithm for Faster Convergence
"... Abstract—The Arimoto–Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A socalled “squeezing ” strategy is used to design algorithms that preserve its simplicity and monotonic convergence properties, but have provably better rates of convergence. Index Terms ..."
Abstract
 Add to MetaCart
Abstract—The Arimoto–Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A socalled “squeezing ” strategy is used to design algorithms that preserve its simplicity and monotonic convergence properties, but have provably better rates of convergence. Index
A String Matching Interpretation for the ArimotoBlahut Algorithm
 In Proc. of the Sixth Canadian Workshop on Information Theory
, 1999
"... The ArimotoBlahut (AB) algorithm is an iterative procedure for computing the ratedistortion function for a given source and distortion measure. It starts with an arbitrary (strictly positive) reproduction distribution, and iteratively produces a sequence of reproduction distributions (and correspo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The ArimotoBlahut (AB) algorithm is an iterative procedure for computing the ratedistortion function for a given source and distortion measure. It starts with an arbitrary (strictly positive) reproduction distribution, and iteratively produces a sequence of reproduction distributions (and
Results 1  10
of
54