Sinossi
This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
1 Review of Applied Algebra.- 2 Tensor Product and Stride Permutation.- 3 Cooley-Tukey FFT Algorithms.- 4 Variants of FT Algorithms and Implementations.- 5 Good-Thomas PFA.- 6 Linear and Cyclic Convolutions.- 7 Agarwal-Cooley Convolution Algorithm.- 8 Multiplicative Fourier Transform Algorithm.- 9 MFTA: The Prime Case.- 10 MFTA: Product of Two Distinct Primes.- 11 MFTA: Composite Size.- 12 MFTA: p2.- 13 Periodization and Decimation.- 14 Multiplicative Characters and the FT.- 15 Rationality.
Product Description
Book by Tolimieri Richard An Myoung Lu Chao
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Algorithms for Discrete Fourier Transform and Convolution
Foto dell'editore
Algorithms for Discrete Fourier Transform and Convolution
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Codice articolo G0387982612I3N00
Compra usato
EUR 32,99
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: 1 disponibili
Foto dell'editore
ALGORITHMS FOR DISCRETE FOURIER TRANSFORM AND CONVOLUTION ; 2 /E
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEOCT25-312526
Compra nuovo
EUR 59,27
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: 3 disponibili
Edizione Internazionale
ALGORITHMS FOR DISCRETE FOURIER TRANSFORM AND CONVOLUTION ; 2 /E
Edizione InternazionaleDa: UK BOOKS STORE, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. Codice articolo CBS 9780387982618
Compra nuovo
EUR 78,04
Spese di spedizione:
EUR 4,53
Da: Regno Unito a: U.S.A.
Quantità: 10 disponibili
Foto dell'editore
Algorithms for Discrete Fourier Transform and Convolution (Signal Processing and Digital Filtering)
Da: Mooney's bookstore, Den Helder, Paesi Bassi
Valutazione del venditore 4 su 5 stelle
Condizione: Very good. Codice articolo 9780387982618-2-2
Compra usato
EUR 73,22
Spese di spedizione:
EUR 24,95
Da: Paesi Bassi a: U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Algorithms for Discrete Fourier Transform and Convolution (Signal Processing and Digital Filtering)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2215580175247
Compra nuovo
EUR 158,64
Spese di spedizione:
EUR 3,44
In U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithms for Discrete Fourier Transform and Convolution (Signal Processing and Digital Filtering)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780387982618_new
Compra nuovo
EUR 156,80
Spese di spedizione:
EUR 13,60
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Algorithms for Discrete Fourier Transform and Convolution
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The main goal of this graduate-level textis to provide a language for understanding, unifying , and implementing a wide variety of algorithms for dgital signal processing -- in particular, to provide ruls and procedures that can simplify or even automate the task of writing code for the newest parallel and vector machines. It thus bridges the gap between digital signal processing algorithms and their implementation on a variety of computing platforms. The mathematical concept of tensor product is a recurring theme throughout the book: tensor product factors have a direct interpretation on on many vector and parallel computers and tensor product idetities can be matched to machine implementation. These formulations also highlight the data flow, which is is especially important on supercomputers, where data flow may be the factor limiting the efficiency of a computation. Because of its importance in many appications, much of the discussion centers on algorithms related to the finite Fourier transform and to multiplicative FFT algorithms; other topics covered include convolution algorithms and prime-factor algorithms. This second edition has been revised and brought up to date throughout. 284 pp. Englisch. Codice articolo 9780387982618
Compra nuovo
EUR 160,49
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Algorithms for Discrete Fourier Transform and Convolution
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. - Provides a broad view of the latest developments in the field of fast digital signal processing algorithms - Provides procedures that simplify or even automate the task of writing code for the newest parallel and vector machinesThis graduate-level tex. Codice articolo 5913228
Compra nuovo
EUR 136,16
Spese di spedizione:
EUR 48,99
Da: Germania a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Algorithms for Discrete Fourier Transform and Convolution
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Algorithms for Discrete Fourier Transform and Convolution | Richard Tolimieri (u. a.) | Buch | xii | Englisch | 1997 | Humana | EAN 9780387982618 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Codice articolo 102941639
Compra nuovo
EUR 141,30
Spese di spedizione:
EUR 70,00
Da: Germania a: U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Algorithms for Discrete Fourier Transform and Convolution
Editore:
Springer New York, Springer US Okt 1997, 1997
ISBN 10: 0387982612
ISBN 13: 9780387982618
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 284 pp. Englisch. Codice articolo 9780387982618
Compra nuovo
EUR 160,49
Spese di spedizione:
EUR 60,00
Da: Germania a: U.S.A.
Quantità: 1 disponibili