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 · Knowledge
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Tarjan's strongly connected components algorithm
Graph theory algorithm
Nº Q1972285 ★
Kabsch algorithm
Type of algorithm
Nº Q6344361 ★
Nyquist–Shannon sampling theorem
Theorem in signal processing describing discrete samples of a continuous signal
Nº Q679800 ★★★
Information theory
Mathematical theory from the field of probability theory and statistics
Nº Q131222 ★★★
Dichotomic search
Type of search algorithm
Nº Q5272532 ★★★
Method of complements
Method of subtraction
Nº Q4741052 ★