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

ISBN-13: 9780849371783 / Angielski / Twarda / 1998 / 672 str.

Hari Krishna Garg

Opis

Describes computational number theory and its applications to deriving fast algorithms for digital signal processing. The text demonstrates the importance of computational number theory in the design of processing algorithms and it clearly describes the nature and structure of the algorithms themselves. It describes the development of fast algorithms for cyclic convolution, aperiodic convolution and discrete Fourier transformation.

Recenzje

"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

Spis treści

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)

O autorze

Hari Krishna