Skip to content
Register Sign in Wishlist

Fast Algorithms for Signal Processing

  • Date Published: August 2010
  • availability: In stock
  • format: Hardback
  • isbn: 9780521190497

Hardback

Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • The only book devoted to fast, computationally-efficient algorithms for signal processing
    • Presents techniques for reducing power dissipation for low-end applications of signal processing, and extending the reach of high-end applications
    • Includes the required background mathematics, so all the information needed to learn and apply the techniques is provided in one convenient guide
    Read more

    Reviews & endorsements

    '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

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: August 2010
    • format: Hardback
    • isbn: 9780521190497
    • length: 466 pages
    • dimensions: 254 x 179 x 26 mm
    • weight: 1.07kg
    • contains: 107 b/w illus. 25 tables 153 exercises
    • availability: In stock
  • 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.

  • Author

    Richard E. Blahut, University of Illinois, Urbana-Champaign
    Richard E. Blahut is a Professor of Electrical and Computer Engineering at the University of Illinois, Urbana-Champaign. He is Life Fellow of the IEEE and the recipient of many awards including the IEEE Alexander Graham Bell Medal (1998) and Claude E. Shannon Award (2005), the Tau Beta Pi Daniel C. Drucker Eminent Faculty Award, and the IEEE Millennium Medal. He was named a Fellow of the IBM Corporation where he worked for over 30 years in 1980, and was elected to the National Academy of Engineering in 1990.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×