33
CELLULAR COMMUNICATIONS 3. DSP: A crash course

CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Embed Size (px)

Citation preview

Page 1: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

CELLULAR COMMUNICATIONS

3. DSP: A crash course

Page 2: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Signals

Page 3: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

DC Signal

Page 4: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Unit Step Signal

Page 5: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Sinusoidal Signal

Page 6: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Stochastic Signal

Page 7: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Some Signal Arithmetic

Page 8: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Operational Symbols

Page 9: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Time Delay Operator

Page 10: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Vector Space of All Possible Signals

Page 11: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Shifted Unit Impulse (SUI) signals are basis for the signal vector space

Page 12: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Periodic Signals

Periodic Signals have another basis signal: sinusoids

Example: Building square wave from sinusoids

Page 13: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Fourier Series

Page 14: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Another version Fourier Series

Page 15: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Complex Representation

Page 16: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Parseval Relationship

Page 17: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Fourier Transform

Works for all analog signals (not necessary periodic)

Some properties

Page 18: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Discrete Fourier Transform (DFT) FT for discrete periodic signals

Page 19: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Frequency vs. Time Domain Representation

Page 20: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Power Spectral Density (PSD)

Page 21: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Linear Time-Invariant(LTI) Systems

Page 22: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Example of LTI

Page 23: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Unit Response of LTI

Page 24: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

24

Convolution sum representation of LTI system

Mathematically

Page 25: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

25

Graphically

Sum up all the responses for all K’s

Page 26: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Sinusoidal and Complex Exponential Sequences

LTI

h(n)

LTI

h(n)

njenx )(

k

knxkhny )()()(

k

knjekh )()(

jn

k

jk eekh )(

jnj eeH )(

Page 27: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Frequency Response

nje jnj eeH )()( jeH

eigenvalueeigenfunction

k

jkj ekheH )()(

Page 28: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Example: Bandpass filter

Page 29: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Nyquist Limit on Bandwidth

Find the highest data rate possible for a given bandwidth, B Binary data (two states) Zero noise on channel

1 0 1 0 0 0 1 0 1 1 0 1 00 0

Period = 1/B

• Nyquist: Max data rate is 2B (assuming two signal levels)• Two signal events per cycle

Example shown with bandfrom 0 Hz to B Hz (Bandwidth B)Maximum frequency is B Hz

Page 30: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Nyquist Limit on Bandwidth (general)

If each signal point can be more than two states, we can have a higher data rate M states gives log2M bits per signal point

10 00 11 00 00 00 11 01 10 10 01 00 0000 11

Period = 1/B

• General Nyquist: Max data rate is 2B log2M • M signal levels, 2 signals per cycle

4 signal levels:2 bits/signal

Page 31: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Practical Limits

Nyquist: Limit based on the number of signal levels and bandwidth Clever engineer: Use a huge number of signal levels

and transmit at an arbitrarily large data rate

• The enemy: Noise• As the number of signal levels grows, the

differences between levels becomes very small• Noise has an easier time corrupting bits

2 levels - better margins 4 levels - noise corrupts data

Page 32: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Characterizing Noise

Noise is only a problem when it corrupts data Important characteristic is its size relative

to the minimum signal information• Signal-to-Noise Ratio• SNR = signal power / noise power• SNR(dB) = 10 log10(S/N)

• Shannon’s Formula for maximum capacity in bps• C = B log2(1 + SNR)• Capacity can be increased by:

• Increasing Bandwidth• Increasing SNR (capacity is linear in SNR(dB)

)

Warning: Assumes uniform (white) noise!

SNR in linear form

Page 33: CELLULAR COMMUNICATIONS 3. DSP: A crash course. Signals

Shannon meets Nyquist

From Nyquist: MBC 2log2From Shannon: )1(log2 SNRBC

Equating: )1(loglog2 22 SNRBMB )1(loglog2 22 SNRM

)1(loglog 22

2 22 SNRM SNRM 12

SNRM 1 12 MSNRor

M is the number of levelsneeded to meet Shannon Limit

SNR is the S/N ratio needed tosupport the M signal levels

Example: To support 16 levels (4 bits), we need a SNR of 255 (24 dB)

Example: To achieve Shannon limit with SNR of 30dB, we need 32 levels

)1(loglog 22

2 SNRM