Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Blahut–Arimoto_algorithm> ?p ?o }
Showing triples 1 to 22 of
22
with 100 triples per page.
- Blahut–Arimoto_algorithm abstract "The Blahut–Arimoto algorithm, is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, or the rate-distortion function of a source. They are iterative algorithms that eventually converge to the optimal solution of the convex optimization problem that is associated with these information theoretic concepts.For the case of channel capacity, the algorithm was independently invented by Arimoto and Blahut. In the case of lossy compression, the corresponding algorithm was invented by Richard Blahut. The algorithm is most applicable to the case of arbitrary finite alphabet sources. Much work has been done to extend it to more general problem instances.".
- Blahut–Arimoto_algorithm wikiPageID "35573062".
- Blahut–Arimoto_algorithm wikiPageLength "2261".
- Blahut–Arimoto_algorithm wikiPageOutDegree "3".
- Blahut–Arimoto_algorithm wikiPageRevisionID "692850333".
- Blahut–Arimoto_algorithm wikiPageWikiLink Category:Coding_theory.
- Blahut–Arimoto_algorithm wikiPageWikiLink Channel_capacity.
- Blahut–Arimoto_algorithm wikiPageWikiLink Richard_Blahut.
- Blahut–Arimoto_algorithm wikiPageWikiLinkText "Blahut–Arimoto algorithm".
- Blahut–Arimoto_algorithm wikiPageUsesTemplate Template:Algorithm-stub.
- Blahut–Arimoto_algorithm wikiPageUsesTemplate Template:Reflist.
- Blahut–Arimoto_algorithm wikiPageUsesTemplate Template:Underlinked.
- Blahut–Arimoto_algorithm subject Category:Coding_theory.
- Blahut–Arimoto_algorithm type Encoding.
- Blahut–Arimoto_algorithm type Redirect.
- Blahut–Arimoto_algorithm comment "The Blahut–Arimoto algorithm, is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, or the rate-distortion function of a source. They are iterative algorithms that eventually converge to the optimal solution of the convex optimization problem that is associated with these information theoretic concepts.For the case of channel capacity, the algorithm was independently invented by Arimoto and Blahut.".
- Blahut–Arimoto_algorithm label "Blahut–Arimoto algorithm".
- Blahut–Arimoto_algorithm sameAs Q4923900.
- Blahut–Arimoto_algorithm sameAs m.0jl0zy7.
- Blahut–Arimoto_algorithm sameAs Q4923900.
- Blahut–Arimoto_algorithm wasDerivedFrom Blahut–Arimoto_algorithm?oldid=692850333.
- Blahut–Arimoto_algorithm isPrimaryTopicOf Blahut–Arimoto_algorithm.