Digital Signal Processing (3rd Edition) is a national-level planned textbook for general higher education during the 11th Five-Year Plan period. It is revised on the basis of the 2nd edition. This book systematically and comprehensively discusses the basic theories, concepts and methods of digital signal processing. Chapter 1 reviews the main contents, application fields and development history of digital signal processing; Chapter 2 introduces the basic theories and basic analysis methods of discrete-time signals and systems; Chapter 3 introduces discrete Fourier transform and its fast calculation methods; Chapter 4 introduces the principles and design methods of infinite and finite impulse response digital filters; Chapter 5 introduces the analysis methods and characteristics of discrete-time random signals and their linear shift-invariant systems; Chapter 6 discusses the finite word length effect problem in digital signal processing implementation; Chapter 7 introduces the classical method of power spectrum estimation, namely the periodogram method. The above contents all include the introduction of methods for solving practical problems in digital signal processing using Matlab. The book has a wealth of examples (119 questions in total), review questions (110 questions in total) and exercises (177 questions in total). Reference answers to some exercises are attached at the end of the book. This book can be used as a textbook for engineering majors such as electronic information engineering, communication engineering, automation, electronic science and technology, measurement and control technology and instrumentation, biomedical engineering, computer, radar, sonar, and science majors such as electronic information science and technology in colleges and universities. It can also be used as a reference book for engineering and technical personnel and scientific researchers engaged in these majors. Chapter 1 Introduction1.1 Contents of Digital Signal Processing1.2 Application Fields of Digital Signal Processing1.3 Development History of Digital Signal Processing1.4 Basic Operations of Digital Signal Processing1.5 Arrangement of the Contents of this BookReferencesChapter 2 Discrete-Time Signals and Discrete-Time Systems2.1 Overview2.2 Discrete-Time Signals - Digital Sequences2.2.1 Representation and Basic Forms of Discrete-Time Signals2.2.2 Using Matlab to Generate Discrete-Time Signals and Their Operations2.3 Discrete-Time Systems2.3.1 Linear Invariant Systems2.3.2 Stability and Causality of Systems2.3.3 Linear Constant Coefficient Difference Equations2.4 Frequency Domain Description of Discrete-Time Signals and Systems2.4.1 Fourier Transform of Discrete-Time Signals (DTFT)2.4.2 Properties of Fourier Transform of Discrete-Time Signals2.4.3 Frequency Response of Discrete-Time Systems2.5 Signal Sampling2.5.1 Sampling of Continuous-Time Signals2.5.2 Sampling of Discrete-Time Signals2.5.3 2.6 The Z transform 2.6.1 Definition of the Z transform 2.6.2 The Z transform of several sequences and their convergence domains 2.6.3 The inverse Z transform 2.6.4 The properties and theorems of the Z transform 2.6.5 The relationship between the Z transform and the Laplace transform 2.7 System function 2.8 All-pass system and minimum phase system 2.8.1 All-pass system 2.8.2 Minimum phase system 2.8.3 Phase delay and group delay 2.9 Application of Matlab in discrete-time signal and system analysis 2.9.1 Calculation of system time domain response 2.9.2 Calculation of Fourier transform of discrete-time signal and system frequency response 2.9.3 Matlab implementation of partial fraction method for inverse Z transform Review questions Exercises References Chapter 3 Discrete Fourier transform and its fast algorithm 3.1 Discrete Fourier series and its properties 3.1.1 Discrete Fourier series (DFS) 3.1.2 3.2 Properties of discrete Fourier series 3.2.1 Discrete Fourier transform (DFT) 3.2.2 Properties of discrete Fourier transform 3.3 Calculating linear convolution using circular convolution 3.4 Frequency sampling 3.5 Fast Fourier transform 3.5.1 The computational cost of discrete Fourier transform 3.5.2 Time decimation radix 2 FFT algorithm (Kuri-Tukey algorithm) 3.5.3 Butterfly, same-site and indexed address calculations 3.5.4 Frequency decimation radix 2 FFT algorithm 3.5.5 IFFT calculation method 3.6 FFT algorithm when N is a composite number 3.7 Calculating linear convolution using FFT 3.8 Segmented convolution 3.9 Linear frequency modulation z-transform... Chapter 4 Principles and design methods of digital filters Chapter 5 Discrete-time random signals Chapter 6 Analysis of finite word length effects in digital signal processing Chapter 7 Classical methods for power spectrum estimation Appendix A Frequency decimation radix 2 FFT and IFFT subroutines Appendix B Answers to some exercises
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore