Algorithms Used in Signal Analysis
Hugh F. VanLandingham · 2018
This chapter is concerned with signal representation and manipulation. It discusses the vector notation used for signal manipulation. The chapter illustrates the ideas of creating new signals by system transformation and the convolution of two signals. It provides a representation of signals in the frequency domain. The chapter also illustrates the efficiency of using a Fast Fourier transform (FFT) algorithm. It presents methods of obtaining frequency selective digital systems. The chapter discusses Eigen system decomposition and singular value decomposition, respectively, with discussions of solving sets of linear algebraic equations. It relates to the generation of specific types of (pseudo)random numbers, namely those having time correlation and those having non-standard distributions. The chapter also provides an overview of simple signal representation and processing. It also provides a brief introduction to the basic discrete Fourier transform and the computational details of an FFT.