Fast Algorithms for Signal Processing (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	June 2010
First published:	July 2010
Authors:	Richard E Blahut
Dimensions:	254 x 179 x 26mm (L x W x T)
Format:	Hardcover
Pages:	466
ISBN-13:	978-0-521-19049-7
Categories:	Books > Computing & IT > Applications of computing > Signal processing Books > Professional & Technical > Energy technology & engineering > Electrical engineering > General Books > Professional & Technical > Electronics & communications engineering > Communications engineering / telecommunications > Satellite communication Promotions
LSN:	0-521-19049-5
Barcode:	9780521190497

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!