Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008092531/catalog> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- catalog contributor b11246057.
- catalog created "c1998.".
- catalog date "1998".
- catalog date "c1998.".
- catalog dateCopyrighted "c1998.".
- catalog description "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.".
- catalog description "Includes bibliographical references and index.".
- catalog extent "637 p. ;".
- catalog identifier "0849371783".
- catalog issued "1998".
- catalog issued "c1998.".
- catalog language "eng".
- catalog publisher "Boca Raton, FL: CRC Press,".
- catalog subject "621.382/2/015118 21".
- catalog subject "Algorithms.".
- catalog subject "Signal processing Digital techniques Mathematics.".
- catalog subject "TK5102.9 .G37 1998".
- catalog tableOfContents "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.".
- catalog title "Digital signal processing algorithms : number theory, convolution, fast fourier transforms, and applications / Hari Krishna Garg.".
- catalog type "text".