Skip to search formSkip to main contentSkip to account menu

Blahut–Arimoto algorithm

Known as: Blahut-Arimoto algorithm 
The Blahut–Arimoto algorithm, is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Channel capacityRate–distortion theoryRichard Blahut

Broader (1)

Coding theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Correction to “ A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels ” by Vontobel et al .
Abstract—The classical Blahut–Arimoto algorithm (BAA) optimizes a discrete memoryless source (DMS) at the input of a discrete… 
2014
2014
Efficient approximation of discrete memoryless channel capacities
We propose an iterative method for efficiently approximating the capacity of discrete memoryless channels, possibly having… 
2013
2013
Variational equalities of directed information and applications
In this paper we introduce two variational equalities of directed information, which are analogous to those of mutual information… 
2012
2012
RAMSES-CH: A New Chemodynamics Code
We present a new chemodynamical code based on the adaptive mesh refinement code RAMSES. The new code uses Eulerian hydrodynamics… 
2008
2008
Characterization of a natural hemagglutinin from the plasma of marine mussel Perna viridis
A naturally occurring hemagglutinin (HA) was detected in the plasma of marine mussel P.viridis using mammalian erythrocytes (RBC… 
2007
2007
Markov Capacity of Continuous Phase Modulations
We propose a novel iterative method, similar to the generalized Blahut-Arimoto algorithm recently proposed by Kavcic, to evaluate… 
2006
2006
On the role of the line-of-sight component in coherent MIMO ricean channel
This thesis considers a memoryless baseband model of a multiple-input multiple-output (MIMO) flat-fading channel. The fading… 
1999
1999
New Improved Photometric Redshifts of Galaxies in the Hubble Deep Field
We report new improved photometric redshifts of 1048 galaxies in the Hubble Deep Field. A standard χ2 minimizing method is… 
1999
1999
A String Matching Interpretation for the Arimoto-blahut Algorithm I Introduction
| The Arimoto-Blahut (AB) algorithm is an iterative procedure for computing the rate-distortion function for a given source and… 
1998
1998
Astronomy and Astrophysics Evolution of the Colour-magnitude Relation of Early-type Galaxies in Distant Clusters
We present a thorough quantitative analysis of the evolution of the colour-magnitude relation for early-type galaxies in 17… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)