2.1 Discrete-Time Signals: Time-Domain Representation Signals represented as sequences of numbers, called samples Sample value of a typical signal or sequence denoted as x[n] with n being an integer in the range-oo≤n≤∞ x[n] defined only for integer values of n and undefined for noninteger values of n Discrete-time signal represented by {x[n]}
3.1 Discrete-Time Fourier Transform Definition- The discrete-time Fourier transform (DTFT) X(eio) of a sequence x[n] is given by jae In general,() is a complex function of the real variable and can be written as X(eio) Xre(eio) +j Xim(eio)
5.1 Digital Processing of Continuous-Time Signals Digital processing of a continuous-time signal involves the following basic steps: (1) Conversion of the continuous-time signal into discrete-time signal, ()Processing of the discrete-time signal, (3) Conversion of the processed discrete- time signal back into a continuous-time signal
6.1 Introduction The convolution sum description of an LTI discrete-time system can, in principle, be used to implement the system For an IR finite-dimensional system this approach is not practical as here the impulse response is of infinite length · However, direct implementation of the IIR finite-dimensional system is practica
Objective-Determination- of realizable transfer function G() approximating a given frequency response specification is an important step in the development of a digital filter If an IIR filter is desired, G() should be a stable real rational function Digital filter design is the process of deriving the transfer function G
Introduction Ideally, the system parameters along with the signal variables have infinite precision taking any value between -oo and · In practice, they can take only discrete values within a specified range since the registers of the digital machine where they are stored are of finite length