Digital Signal Processing Algorithms describes computational number theory and its applications to deriving fast algorithms for digital signal processing. It demonstrates the importance of computational number theory in the design of digital signal processing algorithms and clearly describes the nature and structure of the algorithms themselves. The book has two primary focuses: first, it establishes the properties of discrete-time sequence indices and their corresponding fast algorithms; and second, it investigates the properties of the discrete-time sequences and the corresponding fast algorithms for processing these sequences.
Digital Signal Processing Algorithms examines three of the most common computational tasks that occur in digital signal processing; namely, cyclic convolution, acyclic convolution, and discrete Fourier transformation. The application of number theory to deriving fast and efficient algorithms for these three and related computationally intensive tasks is clearly discussed and illustrated with examples.
Its comprehensive coverage of digital signal processing, computer arithmetic, and coding theory makes Digital Signal Processing Algorithms an excellent reference for practicing engineers. The authors' intent to demystify the abstract nature of number theory and the related algebra is evident throughout the text, providing clear and precise coverage of the quickly evolving field of digital signal processing.
Rezensionen / Stimmen
"It is hard to criticise this book. It does what it does well...this is an unusual and useful book, which definitely ought to find its niche..."
--Mark Sandler, Applied Signal Processing, Vol. 5, No. 4
Reihe
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Professional
Illustrationen
23 s/w Tabellen
23 Tables, black and white
Maße
Höhe: 240 mm
Breite: 161 mm
Dicke: 40 mm
Gewicht
ISBN-13
978-0-8493-7178-3 (9780849371783)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Hari Krishna
Autor*in
Syracuse University, Syracuse, New York, USA
Introduction. Computational Number Theory. Polynomial Algebra. Theoretical Aspects of Discrete Fourier Transform and Convolution. Cyclotomic Polynomial Factorization and Associated Fields. Cyclotomic Polynomial Factorization Over Finite Fields. Finite Integer Rings: Polynomial Algebra and Cyclotomic Factorization. Fast Algorithms For Acyclic Convolution of Discrete Sequences. Fast Algorithms for Cyclic Convolution. Discrete Fourier Transforms. A Coding Theory Framework for Error Control and Fault Tolerant Computing. Index.
NTI/Sales Copy (NTI already done and approved)
