Amazon cover image
Image from Amazon.com
Image from Google Jackets

Digital Signal Processing Algorithms : Number Theory, Convolution; Fast Fourier Transforms and Applications

By: Material type: TextTextLanguage: English Series: Computer Engineering SeriesPublication details: USA CRC Press 1998Description: 637pISBN:
  • 0849371783 (HB)
Subject(s):
Contents:
1. Introduction pt. I. Computational Number Theory. 2. Computational Number Theory. 3. Polynomial Algebra. 4. Theoretical Aspects of the Discrete Fourier Transform and Convolution. 5. Cyclotomic Polynomial Factorization and Associated Fields. 6. Cyclotomic Polynomial Factorization in Finite Fields. 7. Finite Integer Rings: Polynomial Algebra and Cyclotomic Factorization pt. II. Convolution Algorithms. 8. Fast Algorithms for Acyclic Convolution. 9. Fast One-Dimensional Cyclic Convolution Algorithms. 10. Two- and Higher-Dimensional Cyclic Convolution Algorithms. 11. Validity of Fast Algorithms Over Different Number Systems. 12. Fault Tolerance for Integer Sequences pt. III. Fast Fourier Transform (FFT) Algorithms.
Summary: Digital Signal Processing Algorithms describes computational number theory and its applications to deriving fast algorithms for digital signal processing .
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified Status Date due Barcode
IMSc Library 510.5/511 GAR (Browse shelf(Opens below)) Available 37677

Includes index

Includes bibliographical references

1. Introduction pt. I. Computational Number Theory. 2. Computational Number Theory. 3. Polynomial Algebra. 4. Theoretical Aspects of the Discrete Fourier Transform and Convolution. 5. Cyclotomic Polynomial Factorization and Associated Fields. 6. Cyclotomic Polynomial Factorization in Finite Fields. 7. Finite Integer Rings: Polynomial Algebra and Cyclotomic Factorization pt. II. Convolution Algorithms. 8. Fast Algorithms for Acyclic Convolution. 9. Fast One-Dimensional Cyclic Convolution Algorithms. 10. Two- and Higher-Dimensional Cyclic Convolution Algorithms. 11. Validity of Fast Algorithms Over Different Number Systems. 12. Fault Tolerance for Integer Sequences pt. III. Fast Fourier Transform (FFT) Algorithms.

Digital Signal Processing Algorithms describes computational number theory and its applications to deriving fast algorithms for digital signal processing
.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India