Author : Richard Tolimieri
Publisher : Springer Science & Business Media
Page : 363 pages
File Size : 31,42 MB
Release : 2013-06-29
Category : Technology & Engineering
ISBN : 1475738544
This easily accessible book provides a broad view of the latest developments in the field of fast digital signal processing algorithms. It bridges the gap between DSP algorithms and their implementation on a variety of serial and super computers.
Author : H.J. Nussbaumer
Publisher : Springer Science & Business Media
Page : 260 pages
File Size : 31,59 MB
Release : 2013-03-08
Category : Mathematics
ISBN : 3662005514
This book presents in a unified way the various fast algorithms that are used for the implementation of digital filters and the evaluation of discrete Fourier transforms. The book consists of eight chapters. The first two chapters are devoted to background information and to introductory material on number theory and polynomial algebra. This section is limited to the basic concepts as they apply to other parts of the book. Thus, we have restricted our discussion of number theory to congruences, primitive roots, quadratic residues, and to the properties of Mersenne and Fermat numbers. The section on polynomial algebra deals primarily with the divisibility and congruence properties of polynomials and with algebraic computational complexity. The rest of the book is focused directly on fast digital filtering and discrete Fourier transform algorithms. We have attempted to present these techniques in a unified way by using polynomial algebra as extensively as possible. This objective has led us to reformulate many of the algorithms which are discussed in the book. It has been our experience that such a presentation serves to clarify the relationship between the algorithms and often provides clues to improved computation techniques. Chapter 3 reviews the fast digital filtering algorithms, with emphasis on algebraic methods and on the evaluation of one-dimensional circular convolutions. Chapters 4 and 5 present the fast Fourier transform and the Winograd Fourier transform algorithm.
Author : C. S. Burrus
Publisher : Wiley-Interscience
Page : 256 pages
File Size : 36,77 MB
Release : 1985-01-18
Category : Technology & Engineering
ISBN : 9780471819325
This readable handbook provides complete coverage of both the theory and implementation of modern signal processing algorithms for computing the Discrete Fourier transform. Reviews continuous and discrete-time transform analysis of signals and properties of DFT, several ways to compute the DFT at a few frequencies, and the three main approaches to an FFT. Practical, tested FORTRAN and assembly language programs are included with enough theory to adapt them to particular applications. Compares and evaluates various algorithms.
Author : Richard Tolimieri
Publisher : Springer Science & Business Media
Page : 273 pages
File Size : 34,88 MB
Release : 2013-03-09
Category : Technology & Engineering
ISBN : 1475727674
This graduate-level text provides a language for understanding, unifying, and implementing a wide variety of algorithms for digital signal processing - in particular, to provide rules 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, since these formulations highlight the data flow, which is especially important on supercomputers. Because of their importance in many applications, much of the discussion centres on algorithms related to the finite Fourier transform and to multiplicative FFT algorithms.
Author : Michael T. Heideman
Publisher : Springer Science & Business Media
Page : 162 pages
File Size : 33,63 MB
Release : 2012-12-06
Category : Technology & Engineering
ISBN : 1461239125
This book is intended to be a comprehensive reference to multiplicative com plexity theory as applied to digital signal processing computations. Although a few algorithms are included to illustrate the theory, I concentrated more on the develop ment of the theory itself. Howie Johnson's infectious enthusiasm for designing efficient DfT algorithms got me interested in this subject. I am grateful to Prof. Sid Burrus for encouraging and supporting me in this effort. I would also like to thank Henrik Sorensen and Doug Jones for many stimulating discussions. lowe a great debt to Shmuel Winograd, who, almost singlehandedly, provided most of the key theoretical results that led to this present work. His monograph, Arithmetic Complexity o/Computations, introduced me to the mechanism behind the proofs of theorems in multiplicative complexity. enabling me to return to his earlier papers and appreciate the elegance of his methods for deriving the theory. The second key work that influenced me was the paper by Louis Auslander and Winograd on multiplicative complexity of semilinear systems defined by polynomials. After reading this paper, it was clear to me that this theory could be applied to many impor tant computational problems. These influences can be easily discerned in the present work.
Author : D. Sundararajan
Publisher : World Scientific
Page : 400 pages
File Size : 31,82 MB
Release : 2001
Category : Mathematics
ISBN : 9789812810298
This authoritative book provides comprehensive coverage of practical Fourier analysis. It develops the concepts right from the basics and gradually guides the reader to the advanced topics. It presents the latest and practically efficient DFT algorithms, as well as the computation of discrete cosine and WalshOCoHadamard transforms. The large number of visual aids such as figures, flow graphs and flow charts makes the mathematical topic easy to understand. In addition, the numerous examples and the set of C-language programs (a supplement to the book) help greatly in understanding the theory and algorithms. Discrete Fourier analysis is covered first, followed by the continuous case, as the discrete case is easier to grasp and is very important in practice. This book will be useful as a text for regular or professional courses on Fourier analysis, and also as a supplementary text for courses on discrete signal processing, image processing, communications engineering and vibration analysis. Errata(s). Preface, Page viii. OC www.wspc.com/others/software/4610/OCO. The above links should be replaced with. OC www.worldscientific.com/doi/suppl/10.1142/4610/suppl_file/4610_software_free.zipOCO. Contents: The Discrete Sinusoid; The Discrete Fourier Transform; Properties of the DFT; Fundamentals of the PM DFT Algorithms; The u X 1 PM DFT Algorithms; The 2 X 2 PM DFT Algorithms; DFT Algorithms for Real Data OCo I; DFT Algorithms for Real Data OCo II; Two-Dimensional Discrete Fourier Transform; Aliasing and Other Effects; The Continuous-Time Fourier Series; The Continuous-Time Fourier Transform; Convolution and Correlation; Discrete Cosine Transform; Discrete WalshOCoHadamard Transform. Readership: Upper level undergraduate students, graduates, researchers and lecturers in engineering and applied mathematics."
Author : Eleanor Chu
Publisher : CRC Press
Page : 423 pages
File Size : 33,22 MB
Release : 2008-03-19
Category : Mathematics
ISBN : 1420063642
Long employed in electrical engineering, the discrete Fourier transform (DFT) is now applied in a range of fields through the use of digital computers and fast Fourier transform (FFT) algorithms. But to correctly interpret DFT results, it is essential to understand the core and tools of Fourier analysis. Discrete and Continuous Fourier Transform
Author : K.R. Rao
Publisher : Springer Science & Business Media
Page : 437 pages
File Size : 28,19 MB
Release : 2011-02-21
Category : Mathematics
ISBN : 1402066295
This book presents an introduction to the principles of the fast Fourier transform. This book covers FFTs, frequency domain filtering, and applications to video and audio signal processing. As fields like communications, speech and image processing, and related areas are rapidly developing, the FFT as one of essential parts in digital signal processing has been widely used. Thus there is a pressing need from instructors and students for a book dealing with the latest FFT topics. This book provides thorough and detailed explanation of important or up-to-date FFTs. It also has adopted modern approaches like MATLAB examples and projects for better understanding of diverse FFTs.
Author : Frank Wefers
Publisher : Logos Verlag Berlin GmbH
Page : 278 pages
File Size : 26,49 MB
Release : 2015-05-11
Category : Computers
ISBN : 3832539433
This work discusses methods for efficient audio processing with finite impulse response (FIR) filters. Such filters are widely used for high-quality acoustic signal processing, e.g. for headphone or loudspeaker equalization, in binaural synthesis, in spatial sound reproduction techniques and for the auralization of reverberant environments. This work focuses on real-time applications, where the audio processing is subject to minimal delays (latencies). Different fast convolution concepts (transform-based, interpolation-based and number-theoretic), which are used to implement FIR filters efficiently, are examined regarding their applicability in real-time. These fast, elementary techniques can be further improved by the concept of partitioned convolution. This work introduces a classification and a general framework for partitioned convolution algorithms and analyzes the algorithmic classes which are relevant for real-time filtering: Elementary concepts which do not partition the filter impulse response (e.g. regular Overlap-Add and Overlap-Save convolution) and advanced techniques, which partition filters uniformly and non-uniformly. The algorithms are thereby regarded in their analytic complexity, their performance on target hardware, the optimal choice of parameters, assemblies of multiple filters, multi-channel processing and the exchange of filter impulse responses without audible artifacts. Suitable convolution techniques are identified for different types of audio applications, ranging from resource-aware auralizations on mobile devices to extensive room acoustics audio rendering using dedicated multi-processor systems.
Author : Julius O. Smith
Publisher : Julius Smith
Page : 323 pages
File Size : 26,27 MB
Release : 2008
Category : Fourier transformations
ISBN : 097456074X
"The DFT can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, and that is the focus of this book. The DFT is normally encountered as the Fast Fourier Transform (FFT)--a high-speed algorithm for computing the DFT. The FFT is used extensively in a wide range of digital signal processing applications, including spectrum analysis, high-speed convolution (linear filtering), filter banks, signal detection and estimation, system identification, audio compression (such as MPEG-II AAC), spectral modeling sound synthesis, and many others. In this book, certain topics in digital audio signal processing are introduced as example applications of the DFT"--Back cover
