Fast Algorithms for Signal Processing by Richard E. BlahutFast Algorithms for Signal Processing by Richard E. Blahut

Fast Algorithms for Signal Processing

byRichard E. Blahut

Hardcover | August 16, 2010

Pricing and Purchase Info

$193.34

Earn 967 plum® points
Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

Efficient signal processing algorithms are important for embedded and power-limited applications since, by reducing the number of computations, power consumption can be reduced significantly. Similarly, efficient algorithms are also critical to very large scale applications such as video processing and four-dimensional medical imaging. This self-contained guide, the only one of its kind, enables engineers to find the optimum fast algorithm for a specific application. It presents a broad range of computationally-efficient algorithms, describes their structure and implementation, and compares their relative strengths for given problems. All the necessary background mathematics is included and theorems are rigorously proved, so all the information needed to learn and apply the techniques is provided in one convenient guide. With this practical reference, researchers and practitioners in electrical engineering, applied mathematics, and computer science can reduce power dissipation for low-end applications of signal processing, and extend the reach of high-end applications.
Title:Fast Algorithms for Signal ProcessingFormat:HardcoverDimensions:466 pages, 9.72 × 6.85 × 1.02 inPublished:August 16, 2010Publisher:Cambridge University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0521190495

ISBN - 13:9780521190497

Reviews

Table of Contents

1. Introduction; 2. Introduction to abstract algebra; 3. Fast algorithms for the discrete Fourier transform; 4. Fast algorithms based on doubling strategies; 5. Fast algorithms for short convolutions; 6. Architecture of filters and transforms; 7. Fast algorithms for solving Toeplitz systems; 8. Fast algorithms for trellis search; 9. Numbers and fields; 10. Computation in finite fields and rings; 11. Fast algorithms and multidimensional convolutions; 12. Fast algorithms and multidimensional transforms; Appendices: A. A collection of cyclic convolution algorithms; B. A collection of Winograd small FFT algorithms.

Editorial Reviews

'As long as most computer architectures are still classical, this book will be an excellent starting point to learn these algorithms and acquire the necessary (mathematical, algorithmic and number theoretic) background to understand them.' Mathematical Reviews