Discrete Fourier Transform : Theory, Algorithms and Applications.
Title:
Discrete Fourier Transform : Theory, Algorithms and Applications.
Author:
Sundararajan, D.
ISBN:
9789812810298
Personal Author:
Physical Description:
1 online resource (392 pages)
Contents:
Contents -- Preface -- Abbreviations -- Chapter 1 Introduction -- 1.1 The Transform Method -- 1.2 The Organization of this Book -- Chapter 2 The Discrete Sinusoid -- 2.1 Signal Representation -- 2.2 The Discrete Sinusoid -- 2.3 Summary and Discussion -- Chapter 3 The Discrete Fourier Transform -- 3.1 The Fourier Analysis and Synthesis of Waveforms -- 3.2 The DFT and the IDFT -- 3.3 DFT Representation of Some Signals -- 3.4 Direct Computation of the DFT -- 3.5 Advantages of Sinusoidal Representation of Signals -- 3.6 Summary -- Chapter 4 Properties of the DFT -- 4.1 Linearity -- 4.2 Periodicity -- 4.3 Circular Shift of a Time Sequence -- 4.4 Circular Shift of a Spectrum -- 4.5 Time-Reversal Property -- 4.6 Symmetry Properties -- 4.7 Transform of Complex Conjugates -- 4.8 Circular Convolution and Correlation -- 4.9 Sum and Difference of Sequences -- 4.10 Padding the Data with Zeros -- 4.11 Parseval's Theorem -- 4.12 Summary -- Chapter 5 Fundamentals of the PM DFT Algorithms -- 5.1 Vector Format of the DFT -- 5.2 Direct Computation of the DFT with Vectors -- 5.3 Vector Format of the IDFT -- 5.4 The Computation of the IDFT -- 5.5 Fundamentals of the PM DIT DFT Algorithms -- 5.6 Fundamentals of the PM DIF DFT Algorithms -- 5.7 The Classification of the PM DFT Algorithms -- 5.8 Summary -- Chapter 6 The u X 1 PM DFT Algorithms -- 6.1 The u x 1 PM DIT DFT Algorithms -- 6.2 The 2 x 1 PM DIT DFT Algorithm -- 6.3 Reordering of the Input Data -- 6.4 Computation of a Single DFT Coefficient -- 6.5 The u x 1 PM DIF DFT Algorithms -- 6.6 The 2 x 1 PM DIF DFT Algorithm -- 6.7 Computational Complexity of the 2 x 1 PM DFT Algorithms -- 6.8 The 6 x 1 PM DIT DFT Algorithm -- 6.9 Flow Chart Description of the 2 x 1 PM DIT DFT Algorithm -- 6.10 Summary -- Chapter 7 The 2 x 2 PM DFT Algorithms.
7.1 The 2 x 2 PM DIT DFT Algorithm -- 7.2 The 2 x 2 PM DIF DFT Algorithm -- 7.3 Computational Complexity of the 2 x 2 PM DFT Algorithms -- 7.4 Summary -- Chapter 8 DFT Algorithms for Real Data - I -- 8.1 The Direct Use of an Algorithm for Complex Data -- 8.2 Computation of the DFTs of Two Real Data Sets at a Time -- 8.3 Computation of the DFT of a Single Real Data Set -- 8.4 Summary -- Chapter 9 DFT Algorithms for Real Data - II -- 9.1 The Storage of Data in PM RDFT and RIDFT Algorithms -- 9.2 The 2 x 1 PM DIT RDFT Algorithm -- 9.3 The 2 x 1 PM DIF RIDFT Algorithm -- 9.4 The 2 x 2 PM DIT RDFT Algorithm -- 9.5 The 2 x 2 PM DIF RIDFT Algorithm -- 9.6 Summary and Discussion -- Chapter 10 Two-Dimensional Discrete Fourier Transform -- 10.1 The 2-D DFT and IDFT -- 10.2 DFT Representation of Some 2-D Signals -- 10.3 Computation of the 2-D DFT -- 10.4 Properties of the 2-D DFT -- 10.5 The 2-D PM DFT Algorithms -- 10.6 Summary -- Chapter 11 Aliasing and Other Effects -- 11.1 Aliasing Effect -- 11.2 Leakage Effect -- 11.3 Picket-Fence Effect -- 11.4 Summary and Discussion -- Chapter 12 The Continuous-Time Fourier Series -- 12.1 The 1-D Continuous-Time Fourier Series -- 12.2 The 2-D Continuous-Time Fourier Series -- 12.3 Summary -- Chapter 13 The Continuous-Time Fourier Transform -- 13.1 The 1-D Continuous-Time Fourier Transform -- 13.2 The 2-D Continuous-Time Fourier Transform -- 13.3 Summary -- Chapter 14 Convolution and Correlation -- 14.1 The Direct Convolution -- 14.2 The Indirect Convolution -- 14.3 Overlap-Save Method -- 14.4 Two-Dimensional Convolution -- 14.5 Computation of Correlation -- 14.6 Summary -- Chapter 15 Discrete Cosine Transform -- 15.1 Orthogonality Property Revisited -- 15.2 The 1-D Discrete Cosine Transform -- 15.3 The 2-D Discrete Cosine Transform -- 15.4 Summary.
Chapter 16 Discrete Walsh-Hadamard Transform -- 16.1 The Discrete Walsh Transform -- 16.2 The Naturally Ordered Discrete Hadamard Transform -- 16.3 The Sequency Ordered Discrete Hadamard Transform -- 16.4 Summary -- Appendix A The Complex Numbers -- Appendix B The Measure of Computational Complexity -- Appendix C The Bit-Reversal Algorithm -- Appendix D Prime-Factor DFT Algorithm -- Appendix E Testing of Programs -- Appendix F Useful Mathematical Formulas -- Answers to Selected Exercises -- Glossary -- Index.
Abstract:
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 Walsh-Hadamard 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. "www.wspc.com/others/software/4610/". The above links should be replaced with. "www.worldscientific.com/doi/suppl/10.1142/4610/suppl_file/4610_software_free.zip". 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 - I; DFT Algorithms for Real Data - 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 Walsh-Hadamard Transform. Readership: Upper level undergraduate students, graduates, researchers and lecturers in engineering and applied mathematics.
Local Note:
Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2017. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
Genre:
Electronic Access:
Click to View