Blahut–Arimoto algorithm
Class of algorithms in information theory
The term Blahut–Arimoto algorithm is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, the rate-distortion function of a source or a source encoding (i.e. compression to remove the redundancy). They are iterative algorithms that eventually converge to one of the maxima of the optimization problem that is associated with these information theoretic concepts.
Nº Q4923900 ★★★
Rare · Savoirs
Blahut–Arimoto algorithm
Class of algorithms in information theory
The term Blahut–Arimoto algorithm is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, the rate-distortion function of a source or a source encoding (i.e. compression to remove the redundancy). They are iterative algorithms that eventually converge to one of the maxima of the optimization problem that is associated with these information theoretic concepts.
Dernier prix
—
Prix plancher
—
Médiane 7 j
—
Ventes 30 j
0
Fourchette 30 j
—
En circulation
0
Cours
médiane
min – max
ventes
Aucune vente sur la période
Voir le tableau
| Date | médiane | Min | Max | ventes |
|---|
Historique des ventes
- Dernière vente
- —
- Moyenne 30 j
- —
- Plus bas 30 j
- —
- Plus haut 30 j
- —
- Ventes 7 j
- 0
- Ventes 30 j
- 0
Aucune vente pour l'instant.
Ventes anonymes : ni acheteur ni vendeur. Les chiffres ne comptent que les ventes entre joueurs.
Sur Wikipédia
Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.
The term Blahut–Arimoto algorithm is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, the rate-distortion function of a source or a source encoding (i.e. compression to remove the redundancy). They are iterative algorithms that eventually converge to one of the maxima of the optimization problem that is associated with these information theoretic concepts.
Texte : Wikipédia en anglais, CC BY-SA 4.0. ·
Cartes voisines
Algorithme de Tarjan
Algorithme sur les graphes déterminant les composantes fortement connexes
Nº Q1972285 ★
Kabsch algorithm
Type of algorithm
Nº Q6344361 ★
Théorème d'échantillonnage
Nº Q679800 ★★★
Théorie de l'information
Théorie mathématique du domaine de la théorie des probabilités et statistiques
Nº Q131222 ★★★
Dichotomic search
Type of search algorithm
Nº Q5272532 ★★★
Complément (arithmétique)
Méthode de soustraction en arithmétique
Nº Q4741052 ★