| Record ID | marc_columbia/Columbia-extract-20221130-005.mrc:176943743:2734 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-005.mrc:176943743:2734?format=raw |
LEADER: 02734fam a2200337 a 4500
001 2132230
005 20220615212154.0
008 971230s1998 flua b 001 0 eng
010 $a 97052809
020 $a0849371783
035 $a(OCoLC)38168320
035 $a(OCoLC)ocm38168320
035 $9ANH4158CU
035 $a(NNC)2132230
035 $a2132230
040 $aDLC$cDLC$dNNC$dOrLoB-B
050 00 $aTK5102.9$b.G37 1998
082 00 $a621.382/2/015118$221
100 1 $aGarg, Hari Krishna.$0http://id.loc.gov/authorities/names/n97126515
245 10 $aDigital signal processing algorithms :$bnumber theory, convolution, fast fourier transforms, and applications /$cHari Krishna Garg.
260 $aBoca Raton, FL :$bCRC Press LLC,$c1998.
263 $a9804
300 $a637 pages :$billustrations ;$c25 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references and index.
505 00 $g1.$tIntroduction --$gPt. I.$tComputational Number Theory.$g2.$tComputational Number Theory.$g3.$tPolynomial Algebra.$g4.$tTheoretical Aspects of the Discrete Fourier Transform and Convolution.$g5.$tCyclotomic Polynomial Factorization and Associated Fields.$g6.$tCyclotomic Polynomial Factorization in Finite Fields.$g7.$tFinite Integer Rings: Polynomial Algebra and Cyclotomic Factorization --$gPt. II.$tConvolution Algorithms.$g8.$tFast Algorithms for Acyclic Convolution.$g9.$tFast One-Dimensional Cyclic Convolution Algorithms.$g10.$tTwo- and Higher-Dimensional Cyclic Convolution Algorithms.$g11.$tValidity of Fast Algorithms Over Different Number Systems.$g12.$tFault Tolerance for Integer Sequences --$gPt. III.$tFast Fourier Transform (FFT) Algorithms.$g13.$tFast Fourier Transform: One-Dimensional Data Sequences.$g14.$tFast Fourier Transform: Multidimensional Data Sequences --$gPt. IV.$tRecent Results on Algorithms in Finite Integer Rings.
505 80 $gPaper 1.$tA Number Theoretic Approach to Fast Algorithms for Two-Dimensional Digital Signal Processing in Finite Integer Rings.$gPaper 2.$tOn Fast Algorithms for One-Dimensional Digital Signal Processing in Finite Integer and Complex Integer Rings.$gPaper 3.$tCyclotomic Polynomial Factorization in Finite Integer Rings with Applications to Digital Signal Processing.$gPaper 4.$tError Control Techniques for Data Sequences Defined in Finite Integer Rings.$gApp. A.$tSmall Length Acyclic Convolution Algorithms --$gApp. B.$tClassification of Cyclotomic Polynomials.
650 0 $aSignal processing$xDigital techniques$xMathematics.$0http://id.loc.gov/authorities/subjects/sh94001318
650 0 $aAlgorithms.$0http://id.loc.gov/authorities/subjects/sh85003487
852 00 $boff,eng$hTK5102.9$i.G37 1998