Record ID | marc_columbia/Columbia-extract-20221130-031.mrc:14182056:5669 |
Source | marc_columbia |
Download Link | /show-records/marc_columbia/Columbia-extract-20221130-031.mrc:14182056:5669?format=raw |
LEADER: 05669cam a2200673Ia 4500
001 15063738
005 20211113231242.0
006 m o d
007 cr cfu||||||||
008 030331s2000 flua ob 001 0 eng d
035 $a(OCoLC)ocm51949140
035 $a(NNC)15063738
040 $aSTA$beng$epn$cSTA$dLVB$dOCLCQ$dOCLCG$dTXJ$dPUL$dWPG$dUPM$dCEF$dVLB$dMYPMP$dOCLCQ$dTULIB$dOCLCQ$dOCLCO$dOCLCF$dCRCPR$dOCLCQ$dYDXCP$dOCLCQ$dUAB$dOTZ$dERL$dOCLCQ$dTYFRS$dLEAUB$dTYFRS$dUHL$dOCLCO
019 $a54016148$a614389655$a779920423$a987702456$a991975450$a994985141$a1031045693$a1062928593
020 $a0849302706$q(electronic bk.)
020 $a9780849302701$q(electronic bk.)
020 $a9781420049961
020 $a1420049968
020 $a9780367802332$q(electronic bk.)
020 $a0367802333$q(electronic bk.)
020 $z1584881313$q(alk. paper)
020 $z9781584881315$q(alk. paper)
035 $a(OCoLC)51949140$z(OCoLC)54016148$z(OCoLC)614389655$z(OCoLC)779920423$z(OCoLC)987702456$z(OCoLC)991975450$z(OCoLC)994985141$z(OCoLC)1031045693$z(OCoLC)1062928593
037 $a9780367802332$bTaylor & Francis
050 4 $aQA403.5$bC5 2000
072 7 $aMAT$x007000$2bisacsh
072 7 $aMAT$x021000$2bisacsh
072 7 $aTEC$x007000$2bisacsh
072 7 $aUB$2bicssc
082 04 $a515/.723$221
049 $aZCUA
100 1 $aChu, Eleanor Chin-hwa,$d1950-
245 10 $aInside the FFT black box :$bserial and parallel fast Fourier transform algorithms /$cEleanor Chu, Alan George.
260 $aBoca Raton, Fla. :$bCRC Press,$c©2000.
300 $a1 online resource (312 pages) :$billustrations.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
490 1 $aComputational mathematics series
504 $aIncludes bibliographical references (pages 301-308) and index.
500 $aTitle from the resource itself.
505 0 $aChapter 1 An Elementary Introduction to the Discrete Fourier Transform -- chapter 2 Some Mathematical and Computational Preliminaries -- chapter 3 The Divide-and-Conquer Paradigm and Two Basic FFT Algorithms -- chapter 4 Deciphering the Scrambled Output from In-Place FFT Computation -- chapter 5 Bit-Reversed Input to the Radix-2 DIF FFT -- chapter 6 Performing Bit-Reversal by Repeated Permutation of Intermediate Results -- chapter 7 An In-Place Radix-2 DIT FFT for Input in Natural Order -- chapter 8 An In-Place Radix-2 DIT FFT for Input in Bit-Reversed Order -- chapter 9 An Ordered Radix-2 DIT FFT -- chapter 10 Ordering Algorithms and Computer Implementation of Radix-2 FFTs -- chapter 11 The Radix-4 and the Class o f Radix -- 2s FFTs -- chapter 12 The Mixed-Radix and Split-Radix FFTs -- chapter 13 FFTs for Arbitrary N -- chapter 14 FFTs for Real Input -- chapter 15 FFTs for Composite N -- chapter 16 Selected FFT Applications -- chapter 17 Parallelizing the FFTs -- chapter 18 Computing and Communications on Distributed-Memory Multiprocessors -- chapter 19 Parallel FFTs without Inter-Processor Permutations -- chapter 20 Parallel FFTs with Inter-Processor Permutations -- chapter 21 A Potpourri of Variations on Parallel FFTs -- chapter 22 Further Improvement and a Generalization of Parallel FFTs -- chapter 23 Parallelizing Two-dimensional FFTs -- chapter 24 Computing and Distributing Twiddle Factors in the Parallel FFTs.
520 $aAre some areas of fast Fourier transforms still unclear to you? Do the notation and vocabulary seem inconsistent? Does your knowledge of their algorithmic aspects feel incomplete? The fast Fourier transform represents one of the most important advancements in scientific and engineering computing. Until now, however, treatments have been either brief, cryptic, intimidating, or not published in the open literature. Inside the FFT Black Box brings the numerous and varied ideas together in a common notational framework, clarifying vague FFT concepts.Examples and diagrams explain algorithms completely, with consistent notation. This approach connects the algorithms explicitly to the underlying mathematics. Reviews and explanations of FFT ideas taken from engineering, mathematics, and computer science journals teach the computational techniques relevant to FFT. Two appendices familiarize readers with the design and analysis of computer algorithms, as well.This volume employs a unified and systematic approach to FFT. It closes the gap between brief textbook introductions and intimidating treatments in the FFT literature. Inside the FFT Black Box provides an up-to-date, self-contained guide for learning the FFT and the multitude of ideas and computing techniques it employs.
650 0 $aFourier transformations$xData processing.
650 0 $aFourier analysis$xData processing.
650 6 $aTransformations de Fourier$xInformatique.
650 6 $aAnalyse de Fourier$xInformatique.
650 7 $aMATHEMATICS / Differential Equations$2bisacsh
650 7 $aMATHEMATICS / Number Systems$2bisacsh
650 7 $aTECHNOLOGY / Electricity$2bisacsh
650 7 $aFourier analysis$xData processing.$2fast$0(OCoLC)fst00933403
650 7 $aFourier transformations$xData processing.$2fast$0(OCoLC)fst00933415
655 0 $aElectronic books.
655 4 $aElectronic books.
700 1 $aGeorge, Alan.
776 08 $iPrint version:$aChu, Eleanor Chin-hwa, 1950-$tInside the FFT black box.$dBoca Raton, Fla. : CRC Press, ©2000$z9781584881315$w(OCoLC)42435050
830 0 $aComputational mathematics series.
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15063738$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS