Professional Documents
Culture Documents
A system is said to be time invariant system if a time delay or advance of the input signal
leads to an idenditical shift in the output signal. This implies that a time invariant system
responds idenditically no matter when the input signal is applied. It also satisfies the
condition
R{x(n-k)}=y(n-k).
Continuous time signal: A signal x(t) is said to be continuous if it is defined for all
time t. Continuous time signal arise naturally when a physical waveform such as
acoustics wave or light wave is converted into a electrical signal. This is effected by
means of transducer.(e.g.) microphone, photocell.
Discrete time signal: A discrete time signal is defined only at discrete instants of
time. The independent variable has discrete values only, which are uniformly spaced. A
discrete time signal is often derived from the continuous time signal by sampling it at a
uniform rate.
The elementary signals serve as a building block for the construction of more
complex signals. They are also important in their own right, in that they may be used to
model many physical signals that occur in nature.
There are five elementary signals. They are as follows
Unit step function
Unit impulse function
Ramp function
Exponential function
Sinusoidal function
A system is said to be invertible system if the input of the system can be recovered
from the system output. The set of operations needed to recover the input as the second
system connected in cascade with the given system such that the output signal of the
second system is equal to the input signal applied to the system.
H-1{y(t)}=H-1{H{x(t)}}.
22. Is a discrete time signal described by the input output relation y[n]= rnx[n] time
invariant.
A signal is said to be time invariant if R{x[n-k]}= y[n-k]
R{x[n-k]}=R(x[n]) / x[n]→x[n-k]
=rnx [n-k] ---------------- (1)
y[n-k]=y[n] / n→n-k
=rn-kx [n-k] -------------------(2)
Equations (1)≠Equation(2)
Hence the signal is time variant.
23. Show that the discrete time system described by the input-output relationship y[n]
=nx[n] is linear?
A control system with single input and single output is referred to as single input
single output system. When the number of plant inputs or the number of plant outputs is
more than one the system is referred to as multiple input output system. In both the case,
the controller may be in the form of a digital computer or microprocessor in which we
can speak of the digital control systems.
25. Develop the even odd decomposition of the general signal x(t) by applying
definitions?
Let the signal x(t) be expressed as the sum of two components xe(t), xo(t).
x (t)= xe(t)+xo(t)---------------(1)
xe (t) is the even component of x(t), xo(t) is the odd component of x(t)
For a signal to be even: xe (-t)= xe(t)
For odd signals : xo (-t)=-xo(t)
Put x=-t in equation (1) we get
x (-t)= xe(-t)+xo(-t)
= xe (t)-xo(t) ---------------(2)
Adding equations (1)and (2) we get
xe(t)=1/2{x(t)+x(-t)}
Now subtracting equations (1) and (2) we get
xo(t)=1/2{x(t)-x(-t)}
The above two equations are the decomposition of a general signal x(t).
26. Consider a system with input x(t)and output y(t) given by ∑x(t)δ(t-nT),-∞<n<∞. Is
the system linear?
The minimum sampling frequency 2ωm is often termed as the Nyquist rate or
Nyquist sampling rate.
In the above problem ω01=1000, ω02=2000
T01=2π/1000,T02= π/1000
T01 / T02 =2, which is rational.
The signal is periodic with time period T=1000
The Nyquist rate 2 ωm = π/1000
When the system with input x(t) is connected in cascade with the system H1 and
H2 the output of the system is
y(t)=H2{H1{x(t)}}
When the system is connected in parallel the output of the system is given by
y(t)=H1x1(t)+H2x2(t).
Ans:
x1[n]=sin[5πn]
From the signal the angular frequency Ω0 =5π
Time period N=2πm/Ω0 , m is any integer
Now subustuting the value Ω0 =5π we get
N=2m/5
For N to be an integer the value of m=5,10,15,…………….
Therefore the period is N=2,4,6……………………
For the second signal also we get N=2,4,6……….. since the value of Ω0 =5π
b) y[n]=x1[n]+x2[n]
y[n]=sin[5πn]+√3 cos[5πn] ------------------(1)
let y[n] be y[n]=Acos(Ωn+φ)
y[n]=Acos Ωn Cosφ-AsinΩnsin φ------------(2)
Equating the cos terms in equation (1) and (2) we get,
ACos Ωn = √3 cos[5πn]
A=√3
Equating the sine terms in equation (1) and (2) we get
AsinΩn =-1
A=-1
Amplitude = √(√32 + (-1)2)
=√4
=2
Now tanφ=sinφ/cosφ
= amplitude of x1[n]/amplitude of x2[n]
=-1/√3
=-π/3 radians
Therefore y[n] =2 cos (5πn-π/3)
Ω
x(jΩ )= ∫ x(t) e-j dt
-∞
36.Define Inverse Fourier transform.
The inverse Fourier transform is define as
∞
Ω
x(y)=1/2π ∫ x(jΩ )ej tdΩ
-∞
37. What is the condition for existence of Fourier transform of a signal x(t).
Fourier transform of a signal x(t) exists if the signal x(t) is absolutely
integrable.
∞
∫ /x(t)/< ∞
-∞
38.State Parseval’s theorem for continuous time aperiodic signal.
Let x1(t) and x2(t) be signal with Fourier transform x1(jΩ ) and x2(jΩ )
respectively. Then we have
∞ ∞
∫ /x(t)/2dt=1/2π ∫ /x(jΩ )/2dΩ
-∞ -∞
n= - ∝
88.What are the properties of Fourier spectrum of a discrete-time aperiodic sequence?
The Fourier spectrum of a discrete-time aperiodic sequence is continuous and
periodic with period 2π .
∝
DTFT (x(n))=X(e jw)= ∑ x(n) e -jwn
n= - ∝
X(e jw)=X(Z)/Z e jw
94.List any four properties of DFT. Or List out the properties of DFT .
i)Periodicity
If x(k) is N-point of a finite duration sequence x(n), then
X(n+N)=x(n) for all n
X(k+N)=X(k)for all k.
ii)Linearity
If
X1(k) =DFT [x1(n)]and
X2(k)=DFT[x2(n),
Then
DFT[a1 x1(n) + a2 x2(n)]=a1X1(k)+a2X2(k)
iii)Circular time shifting of a sequence
If DFT[x(n))]=X(k),
Then
π kl/n
DFT [x(9n-l))n]=X(k)e-j2
95.Why FFT is needed? N-1
The direct evolution of DFT using formula X(k)= Σ x(n)e-
j2π nk/N
N=0
Requires N2complex multiplications and N(N-1) complex additions. Thus for reasonably
large values of N direct evaluation of the DFT requires an inordinate amount of
computation. By using FFT algorithms the number of computations canbe reduced.
96.What is FFT?
The fast Fourier transform (FFT)is an algorithm used to compute the DFT.It makes use of
the symmetry and periodicity properties of twiddle factor WkN to efficiency reduce the
DFT computation time IT is based on the fundamental principle of decomposing the
computations of DFT of a sequence of length N into successively smaller discrete
Fourier transforms.
97.How many Multiplications and additions are required to compute N-point DFT using
radix-2 FFT?
The number of Multiplications
and additions required to compute N-point DFT using radix-2 FFT are N log2 N and N/2
log2 n respectively.
98.What is meant by radix-2 FFT?
The FFT algorithm is most efficient in calculating N-point DFT.If the number of
output points N can be expressed as a power of 2, that is N=2M, where M is an integer,
then this algorithm is known as radix-2 FFT algorithm.
99.What is a decimation –in –time algorithm?
Decimation –in –time algorithm is used to calculate the DFT
The fast Fourier transform (FFT)is an algorithm used to compute the DFT.It makes use of
the symmetry and periodicity properties of twiddle factor WkN to efficiency reduce the
DFT computation time IT is based on the fundamental principle of decomposing the
computations of DFT of a sequence of length N into successively smaller discrete
Fourier transforms.
100.How many Multiplications and additions are required to compute N-point DFT using
radix-2 FFT?
The number of Multiplications
and additions required to compute N-point DFT using radix-2 FFT are N log2 N and N/2
log2 n respectively.
The FFT algorithm is most efficient in calculating N-point DFT.If the number of
output points N can be expressed as a power of 2, that is N=2M, where M is an integer,
then this algorithm is known as radix-2 FFT algorithm.