Professional Documents
Culture Documents
Contents:
o Signal, its types and properties
o Systems, its types and properties
o Review of Fourier series & Fourier transform
o General communication system & its characteristics
1.1) SIGNALS
CLASSIFICATION OF SIGNALS
Signals may describe a wide variety of physical phenomena. Although signals can be represented
in many ways, in all cases, the information in a signal is contained in a pattern of variations of
some form. Signals are classified into following categories:
X(t)=f(t)
t nT t
In discrete time signal, the independent variable is a discrete in type. Therefore they are
just defined only at discrete interval of time. A discrete time signal is a sampled form of
continuous time signal. When each sample is quantized into a finite series of value, we
get a digital signal.
DT Signal
Analog Signal
Sampling Quantization Digital Signal
(CT Signal)
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
2. Deterministic & Random Signal
Deterministic signals are those which can be determined by a simple algebraic equation
or tabular form or by graphical representation. That is the solution of which are
consistent, e.g. x(t) = sin(t)
Random signals are those which cannot be determined by a simple algebraic equation
or tabular form or graphical representation. They are non deterministic and inconsistent.
For example: noise signals.
X(t)
So, in other words, signals having
0
t no future values are also called
Future Present Past
causal signal.
Values State Values
X(t)
A signal is said to be anti-causal if it has no signal
part for: t>0.
t
0
Fig: Anti Causal Signal For example: devices having storage value.
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
5. Even & Odd Signal
Any signal x(t) is said to be even if it satisfies the condition: x(t) = x(-t) otherwise
considered to be odd. For odd signal: x(t) = - x(-t).
t t t t
-1 1 -1 1
Every signal x(t) can be represented as sum of odd and even part of x(t).
1 1
Where: Ev{x(t)} = {x(t) + x(−t)} & Od{x(t)} = {x(t) − x(−t)}
2 2
Example:
Find even and odd part of the signal x(t).
X(t)+X(-t)
2
X(t) X(-t) ½{X(t)+X(-t)}
1 1 1 1 1
+ = = 0.5 0.5
t t t t
-2 0 2 -2 0 2 0 0
X(t)-X(-t)
1 ½{X(t)-X(-t)}
X(t) X(-t) 0.5
1 1
= t
0 t 0
- =
-0.5
t t -1
-2 0 2 -2 0 2
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
TYPES OF SIGNALS USED IN COMMUNICATION SYSTEM
In communication system, we need to use some standard signals and express them graphically
and mathematically.
1. DC Signal
2. Rectangular Pulse
3. Triangular Pulse
1 − t; 0 ≤ t ≤ 1
∆(t) = { } t
1 + t; −1 ≤ t ≤ 0 -1 0 1
Fig: Triangular Pulse
4. Sinusoidal Signal
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
6. Unit Step Signal
8. Signum Function
X(t)=sgn(t)
A Signum function is an odd or asymmetrical function
1
guided by the following mathematical equation:
t
0
-1
1; t > 0
sgn(t) = { }
−1; t < 0 Fig: Signum Function
9. Exponential Function
The Sinc function has the shape of sine wave but its X(t)=sinc(t)
amplitude goes on decreasing as the value of ‘t’ increases. 1
Mathematically:
t
1 ; for t = 0 0
Sinc(t) = {sin(πt) }
; for t ≠ 0
πt Fig: Sinc Function
Page6
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
SOME USEFUL SIGNAL TRANSFORMATIONS
Some of the signals can be transformed from one form to another just with some standard
mathematical relationship, which is considered as a transformation tool or simply a system with
defined protocols.
0 t t 0 t
d System Inverse System
δ(t) = {u(t)}
dt
∞ r(t)
r(t) = ∫0 u(t)dt U(t)
X(t) Y(t) y(t)
U(t)
X(t)
1 òx(t)dt d/dt(y(t)) 1
d t t t
0
u(t) = {r(t)} System Inverse System
dt
The transformation of a signal is a central concept in signal and system analysis. It is necessary
to transform a signal in order to enhance desirable characteristics, to remove unnecessary
noises or to balance the several components of the signal. Thus, an elementary signal
transformation involves simple modification of the independent variable i.e. the time axis in
order to achieve such attempts.
X(-t) X(2t)
X(t/2)
1 1 1
0 T/2 0 T/2 0 2T
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
1.2) SYSTEMS
A mathematical model of a physical or logical entity or processes that relates its input or
excitation signals to the output or response signals is a system. A system maps input
signals into output.
CLASSIFICATION/PROPERTIES OF SYSTEMS
Discrete time system takes discrete time signal as an input and manipulates it to give
discrete time signal as output.
Mathematically,
Linear System = Homogeneity Property + Additivity Property
For the following system with x(t) as an input and y(t) as an output.
X(t) Y(t)
f
System
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
3. Time Invariant and Time Variant System
If the property of the system is not altered with the time, it is said to be time invariant or
shift invariant system. In other words, if output and input characteristics does not
change with time, the system is called time invariant system.
Mathematically,
The system: y(t) = f{x(t)} is time invariant system, If: y(t − t 0 ) = f{x(t − t 0 )}
Rect(t)
sin(t)
X(t) Y(t)
F{X(t)}
-1 1 -1
Rect(t-1)
sin(t-1)
X(t) Y(t)
F{X(t-1)}
2
Any other systems violating the above condition are regarded as time variant systems.
Mathematically,
y(t) = f{x(t), x(t − 1), x(t − 2) … . }
Or, y(t) = f{x(t), x(t − t 0 )} for t 0 ≥ 0
Any system violating the above condition falls under non causal system. These systems
are not physically realizable since in real time signal application, we cannot get future
values of the signal.
Page9
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
6. Stable and Unstable System
There are various definitions of stability of the system. One of them is BIBI (Bounded
Input Bounded Output) stability criteria. So, if a system gives bounded output for
bounded input, it is called BIBO stable system. That is: for input: |x(t)| ≤ Mx if the
system produces the output: |y(t)| ≤ My the system is BIBO stable, where Mx and My are
any finite values.
f1* f2 = d(t)
X(t) Y(t) X(t)
f1 f2
Note:
What is linear time invariant system?
A system exhibiting both linearity property and the time invariant property is considered
as linear time invariant system. That is: it investigates the response of a linear and time
invariant system to and arbitrary input signal.
Equivalently, any LTI can be characterized in the frequency domain by the system’s transfer
function, which is the Laplace Transform of the system’s impulse response (or Z Transform
in the case of discrete time system). As a result of the properties of these transforms, the
output of the system in the frequency domain is the product of the transfer function and
the transform of the input.
Page10
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
1.3) REVIEW OF FOURIER SERIES & FOURIER TRANSFORMATION
… Note:
… Existence of Fourier Series (Dirichlet’s Condition)
S-1(t) = e−j.1.ω0 t The continuous time Fourier Series exists only when the
S0 (t) = e−j.0.ω0 t = 1 function x(t) satisfies the following conditions.
S-1(t) = e−j.1.ω0 t
- x(t) is well defined and a singled valued function.
S-2(t) = e−j.1.ω0 t - x(t) must possess only a finite number of
… discontinuities in the period T.
… - x(t) must have a finite number of positive and
SK (t) = e−j.K.ω0 t negative maxima in the period T.
Fourier found that, the weighted sum of these infinite complex exponentials can
represent a general periodic signal having fundamental frequency ‘ ω0 ′ i.e. Xp(t) is
2π
periodic with T0 = , then it can be represented as:
ω0
xp (t) = ∑∞
K=−∞ CK e
jKωo t
… (i)
Where, CK is the weighting factor called exponential Fourier Series Coefficients; physically
it represents the amplitude of Kth harmonics present in the signal. Equation (i) is known
as synthesis equation. Also:
1
CK = ∫ x (t)e−jKω0t dt …. (ii)
T0 <T0 > p
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
Equation (iii) is known as Trigonometric Fourier Series, where:
1
C0 = ∫<𝑇> xp (t) dt … (iv)
T
2
aK = ∫<𝑇> xp (t)cosKω0 t dt … (v)
T
2
bK = ∫<𝑇> xp (t)sinKω0 t dt … (vi)
T
Example 1)
A signal has fundamental frequency of ‘wo’ with following Fourier
Coefficients. Synthesize the signal.
C0 = 5, C1 = ejπ/2 , C2 = 2ejπ/3 , C−1 = e−jπ/2 , C−2 = e−jπ/3
S𝐨𝐥𝐮𝐭𝐢𝐨𝐧:
xp (t) = ∑∞
K=−∞ CK e
jKωo t
= ∑2K=−2 CK ejKωot
= C−2 e−j2ωot + C−1 e−j1ωot + C0 + C1 ej1ωot + C2 ej2ωot
= e−jπ/3 e−j2ωot + e−jπ/2 e−j1ωot + 5 + ejπ/2 ej1ωot + ejπ/3 ej2ωot
π π π π
= 2e−j( 3 +2ωot) + e−j( 2 +ωot) + 5 + ej( 2 +ωot) +2ej( 3 +2ωot)
π π
xp (t) = 5 + 4 cos ( + 2ωo t) + 2 cos ( + ωo t)
3 2
Example 2)
Find the Fourier series coefficients of the signal: Asinω0 t and plot the
magnitude and phase graph.
S𝐨𝐥𝐮𝐭𝐢𝐨𝐧:
|Ck|
A/2 A/2
xp (t) = Asinω0 t
A K
= (ejωot − e−jωot ) -1 0 -1
2j
A A Magnitude Plot
= ejωot − e−jωot
2j 2j
ÐCK
p/2
A A A π
i.e. C1 = = (−j) = ( , − ) and -1 0 -1
K
2j 2 2 2
A A A π p/2
C -1 = -- = (j) = ( , )
2j 2 2 2
Phase Plot
Page12
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
3. Fourier Transformation
- We can use this approach to develop the frequency domain representation of a non-
periodic signal over an entire interval.
- Since, the aperiodic signals are infinitesimally close in frequency, they are
represented in terms of an integral rather than sum. The resulting spectrum of
coefficient in this representation is called the Fourier Transform.
If x(t) be any aperiodic signal then its Fourier Transformation is given by:
FT{x(t)} = x(j)
∞
i.e. X(jω) = ∫−∞ x(t)e−jωt dt … (i) and
IFT{X(j)} = x(t)
1 ∞
i.e x(t) = ∫ X(jω)ejωt dω … (ii)
2π −∞
Where, equation (i) is called analysis equation while equation (ii) is known as synthesis
equation. Both equations in combine, recognized as Fourier Transform Pair.
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
1.4) ANALOG COMMUNICATION SYSTEM
Information Information
Source Destination
Noise &
Disturbances
Description:
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
a) Noise & its effect in communication system
Noise is an unwanted signal which is always random in nature and cannot be predictable.
That’s why in the process of transmission and reception, the signal get distorted or
attenuated. Signal strength attenuates with distance, so need repeaters to amplify the
signals at stages, though the received signal is corrupted by noise.
Mathematically, R(t) = A.S(t) + n(t)
Where, R(t) is received signal quality that depends on channel noise and noise between
repeaters, S(t) is the modulated signal and n(t) is noise.
Noise and attenuation go hand on hand. Signal and its quality degrade or attenuate
because of noise introduced in the channel through which the transfers of intelligence or
message occur. Attenuation (a), thus, defined mathematically as the reciprocal of gain, it
is a total loss.
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)
c) Concept of bandwidth and Shannon’s Channel Capacity Theorem
Bandwidth measures the capacity of channel. Normally channel is power limited or
bandwidth limited for example, telephone communication is band limited while satellite
communication is power limited.
For a channel with additive Gaussian white noise, the relation between channel capacity
(C), channel bandwidth (B) and the received signal to noise ratio (SNR) is given by:
Theoretical limitation
a) For noise less channel
As: C = B.log2 (1+SNR)
Where: SNR = (Ps/Pn) = (Signal Power/Noise Power)
As, SNR = Ps/Pn. If No be the Psd (Power Spectral Density) of Gaussian White Noise,
then: Pn = No.B. Then: SNR = Ps/No.B
Now:
i.e. lim C = lim {B. log 2 (1 + SNR)}
B→∞ B→∞
PS PS
= lim {B. log 2 (1 + )} = lim {log 2 (1 + )B }
B→∞ NO .B B→∞ NO .B
NO .B NO .B
PS PS PS PS
= lim {log 2 (1 + ) PS
}= lim {log 2 (1 + ) PS
}
B→∞ NO NO .B NO B→∞ NO .B
PS PS
= . log 2 e = 1.44( )
NO NO
Page16
That is for infinite bandwidth channel, capacity does not tend to infinite.
Prepared By
Er. Shree Krishna Khadka
(Lecturer: AITM/KIST/MAMTS)