chapter 2 –.ppt
DESCRIPTION
eeeTRANSCRIPT
![Page 1: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/1.jpg)
Chapter 2 – Signals, Systems & Fourier theory
• Concepts of signals, orthogonal function, Fourier theory, and correlation for spectral analysis.
• Linear systems & the impact of noise in the transmission of data
• By the end of this chapter: Goal: Understand signals and data representation in both time & frequency domain
![Page 2: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/2.jpg)
Signals • Signal: Any time varying quantity that can be used to carry
information.
![Page 3: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/3.jpg)
ASCII Encoding of A
• A 65 1000001 Signal TX
![Page 4: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/4.jpg)
Classification of Signals (1)
• Based on 2 factors
• How it is represented in time
• How its amplitude is allowed to vary
This axis is continuous or discrete
![Page 5: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/5.jpg)
Classification of Signals (2)
• The 4 Basic types of signals are:
• Continuous time, cont. amplitude• Continuous time, discrete amplitude• Discrete time, continuous amplitude• Discrete time, discrete amplitude
![Page 6: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/6.jpg)
Classification of Signals (3)• The 4 Basic types of signals are:
![Page 7: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/7.jpg)
Continuous-time Vrs Discrete-time
This axis is continuous or discrete
![Page 8: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/8.jpg)
Continuous-time Signal(Sinusoid)
)()( tACostx
2T
![Page 9: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/9.jpg)
Discrete-time Signal (1)(Derived from Cont. signal)
• Explanatory Notes on Sampling Theory:
• ‘Exact reconstruction of a continuous-time baseband signal from its samples is possible if the signal is bandlimited and the sampling frequency is greater than twice the signal bandwidth’.
![Page 10: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/10.jpg)
Note: AnalogueDigital Conversion
• Analogue to Digital Conversion requires 3 essential steps:
• 1. Sampling: • 2. Quantization• 3. Encoding
![Page 11: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/11.jpg)
Discrete-time Signal (2)
• Defined only @ discrete times• E.g., Exam results per semester• S (n) where n = …, -1, 0, 1, …, and are
functions defined on integers.
![Page 12: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/12.jpg)
Analog vrs Digital
![Page 13: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/13.jpg)
Periodic vrs Aperiodic
)()( tTftf )()( NnxnX
![Page 14: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/14.jpg)
Examples of PeriodicSignals
![Page 15: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/15.jpg)
Causal vrs Anti-Causal
![Page 16: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/16.jpg)
Even vrs Odd Signals
![Page 17: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/17.jpg)
Even-Odd Decomposition (1)
• Given a function X (t) of a signal;
)()(2
1)( txtxtxEv
)()(2
1)( txtxtxOdd
![Page 18: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/18.jpg)
Even-Odd Decomposition (2)
![Page 19: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/19.jpg)
Even-Odd Decomposition (3)
![Page 20: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/20.jpg)
Class Work (5 mins)
• Given the functionx(t) = 2t + 1
Use the odd-even decomposition concept to show that
X(t) = Sum of Ev(x(t)) and Odd(x(t))
![Page 21: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/21.jpg)
Deterministic vrs Stochastic
![Page 22: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/22.jpg)
Random Signals (Noise)
n(t)
n(t)
0 t
2
2
)(1lim
)(
T
T
dttnTT
tn
2
2
22 1limT
T
dttnTT
tn
The square root of n^2(t) is the rms value of n(t).
![Page 23: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/23.jpg)
Random Signals (Noise)
• Probability Density Function p(x)
• Probability that random variable lies b/n x1 and x2:
n(t)
n(t)
0 t
xxxxPxp oo )(
2
1
)(21
x
x
dxxpxxxP
![Page 24: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/24.jpg)
Systems • Signals are always associated with one or more
systems
![Page 25: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/25.jpg)
Systems Analysis (1)
Characterization of systems is by how many inputs and outputs they have:
• SISO (Single Input, Single Output) • SIMO (Single Input, Multiple Outputs) • MISO (Multiple Inputs, Single Output) • MIMO (Multiple Inputs, Multiple Outputs)
![Page 26: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/26.jpg)
Systems Analysis (2)
Systems could also be categorized on basis of type of signals:
• Analog System (Analog Input/ Analog Output) • Digital System (Digital Input/ Digital Output)
• Systems with Analog Input/ Digital Output or Vice versa
![Page 27: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/27.jpg)
Systems Analysis (3)
Another approach is on whether the systemhas memory or otherwise!
• Memoryless systems do not depend on any past input. (In digital electronics – Combinational Logic)
• Systems with memory do depend on past input. (In digital electronics – Sequential Logic)
• Causal systems do not depend on any future input.
![Page 28: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/28.jpg)
Systems Analysis (4)
Finally, systems are categorized by other properties such as:
• A system is linear if it has the superposition and scaling properties.
• A system that is not linear is non-linear. • If the output of a system does not depend explicitly on time,
the system is said to be time-invariant; otherwise it is time-variant
• A system that will always produce the same output for a given input is said to be deterministic.
• A system that will produce different outputs for a given input is said to be stochastic.
![Page 29: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/29.jpg)
Linear Systems
• Linear systems must satisfy both homogeinity and additivity requirements:
• These 2 rules referred to as the principle of superposition
• Additivity: • Homogeneity:
![Page 30: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/30.jpg)
Linear Systems
• Linear systems must satisfy both homogeinity and additivity requirements:
• These 2 rules referred to as the principle of superposition
• Additivity: • Homogeneity:
![Page 31: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/31.jpg)
Fourier Transform
![Page 32: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/32.jpg)
Signal – to – Noise Ratio
PowerNoise
PowerSignal
P
PSNR
noise
signal
noise
signal
noise
signal
A
A
P
PdBSNR 1010 log20log10)(
![Page 33: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/33.jpg)
SNR & Capacity Cal. (Classwork)
• Given that the SNR of a channel is 3dB. How many bits can be transmitted in 1-hour for a given bandwidth of 30kHZ.
![Page 34: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/34.jpg)
Correlation
• Correlation is a measure of how related two entities are.
• A high correlation means that there is a lot of resemblance between the two compared entities.
![Page 35: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/35.jpg)
Auto-Correlation
• The auto-correlation for a periodic signal of period T is defined as follows:
• It defines how much a function correlates with a time shifted version of itself, with respect to that time shift.
2
2
)()(1
)(
T
Tiii dttWtW
TR
![Page 36: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/36.jpg)
Cross-Correlation
• The cross-correlation for periodic signals of period T is defined as:
• It measures how much two different signals, Wi and Wj, one shifted in time with respect to the other, correlate as a function of that time shift.
2
2
)()(1
)(
T
Tjiij dttWtW
TC
![Page 37: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/37.jpg)
Orthogonality
• Two periodic signals of period T are orthogonal when their cross- product is null for a zero time shift.
• Two orthogonal signals can be transmitted at the same time and will not interfere with each other. This principle is largely applied in CDMA.
2
2
0)()(
T
Tji dttWtW
![Page 38: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/38.jpg)
Orthogonality
• The vectors (1, 3, 2), (3, −1, 0), (1/3, 1, −5/3) are orthogonal to each other, since (1)(3) + (3)(−1) + (2)(0) = 0, (3)(1/3) + (−1)(1) + (0)(−5/3) = 0, (1)(1/3) + (3)(1) − (2)(5/3) = 0.
• These vectors are orthogonal, for example (1, 0, 0, 1, 0, 0, 1, 0), (0, 1, 0, 0, 1, 0, 0, 1), (0, 0, 1, 0, 0, 1, 0, 0)
![Page 39: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/39.jpg)
Power Spectral Density (PSD)
• PSD, describes how the power (or variance) of a time series is distributed with frequency.
• Mathematically, it is defined as the Fourier transform of the auto-correlation sequence of the time series.
• The term white noise refers to a noise whose power is distributed uniformly over all frequencies. White noise has a flat PSD.
![Page 40: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/40.jpg)
Thermal Noise
• …caused by the random motion of molecules at any temperature above absolute zero Kelvin.
• Since the 3rd law of thermodynamics prevents one from extracting all heat from a physical system, one cannot reach absolute zero and so cannot entirely avoid thermal noise.
![Page 41: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/41.jpg)
Time & Frequency Domain Rep
• Signals can be manipulated (i.e., amplified, filtered, etc.) in the time domain.
• However, it is often convenient and frequently necessary, when signal analysis and processing is required, to represent the signal in the frequency domain.
![Page 42: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/42.jpg)
Time & Frequency Domain Rep
![Page 43: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/43.jpg)
Time & Frequency Domain Rep
![Page 44: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/44.jpg)
Time & Frequency Domain RepAssignment - 1
• Plot the time and frequency domain representation of the following signals:
![Page 45: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/45.jpg)
Mathematical Representation Of Signals in Freq. Domain
• The theory of complex numbers is essential in understanding frequency domain representation. Revision
• In the ff sections, the concepts of Fourier analysis will provide us with a powerful tool for the general transformation of a signal from the time to frequency domain & the inverse transform!
![Page 46: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/46.jpg)
![Page 47: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/47.jpg)
Euler’s Identity
![Page 48: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/48.jpg)
Complex Nos. Examples
![Page 49: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/49.jpg)
Complex Nos. (Solve)
![Page 50: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/50.jpg)
Complex Nos. (Solution)
![Page 51: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/51.jpg)
Fourier Transform (1)
![Page 52: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/52.jpg)
Joseph Fourier
• Joseph Fourier submitted a paper in 1807 to the Academy of Sciences of Paris. The paper was a mathematical description of problems involving heat conduction, and was at first rejected for lack of mathematical rigour. However, it contained ideas which have developed into an important area of mathematics named in his honour, Fourier analysis.
![Page 53: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/53.jpg)
Fourier Transform (2)
![Page 54: Chapter 2 –.ppt](https://reader033.vdocuments.net/reader033/viewer/2022061205/5481588ab47959270b8b4569/html5/thumbnails/54.jpg)
Classification of signals ..• Energy and power signals
– A signal is an energy signal if, and only if, it has nonzero but finite energy for all time:
– A signal is a power signal if, and only if, it has finite but nonzero power for all time:
– General rule: Periodic and random signals are power signals. Signals that are both deterministic and non-periodic are energy signals.