Image from Coce

Digital signal processing algorithms : number theory, convolution, fast fourier transforms, and applications / Hari Krishna Garg.

By: Material type: TextTextSeries: Press computer engineering seriesPublisher: Boca Raton, FL : CRC Press, [1998]Copyright date: ©1998Description: 637 pages ; 24 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 0849371783
  • 9780849371783
Subject(s): DDC classification:
  • 621.3822015
LOC classification:
  • TK5102.9 .G37 1998
Contents:
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.
Summary: "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."--Publisher description.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Book City Campus City Campus Main Collection 621.3822015 GAR (Browse shelf(Opens below)) 1 Available A154900B

Includes bibliographical references and index.

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.

"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."--Publisher description.

Machine converted from AACR2 source record.

There are no comments on this title.

to post a comment.

Powered by Koha