All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $28.70Trending at AU $30.82
- AU $52.98Trending at AU $78.83
- AU $44.48Trending at AU $52.90
- AU $34.29Trending at AU $38.68
- AU $26.88Trending at AU $29.35
- AU $44.27Trending at AU $52.87
- AU $36.48Trending at AU $41.21
About this product
- DescriptionThe spreading of digital techlogy has resulted in a dramatic increase in the demand for data compression (DC) methods. At the same time, the appearance of highly integrated elements has made more and more com- plicated algorithms feasible. It is in the fields of speech and image trans- mission and the transmission and storage of biological signals (e.g., ECG, Body Surface Mapping) where the demand for DC algorithms is greatest. There is, however, a substantial gap between the theory and the practice of DC: an essentially nconstructive information theoretical attitude and the attractive mathematics of source coding theory are contrasted with a mixture of ad hoc engineering methods. The classical Shannian infor- mation theory is fundamentally different from the world of practical pro- cedures. Theory places great emphasis on block-coding while practice is overwhelmingly dominated by theoretically intractable, mostly differential- predictive coding (DPC), algorithms. A dialogue between theory and practice has been hindered by two pro- foundly different conceptions of a data source: practice, mostly because of speech compression considerations, favors n stationary models, while the theory deals mostly with stationary ones.
- Author(s)G. Gabor,Z. Gyorfi
- PublisherSpringer-Verlag New York Inc.
- Date of Publication11/11/2011
- SubjectLibrary & Information Science
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Notebiography
- Weight185 g
- Width156 mm
- Height234 mm
- Spine5 mm
- Format DetailsTrade paperback (US)
- Edition StatementSoftcover reprint of the original 1st ed. 1986
This item doesn't belong on this page.
Thanks, we'll look into this.