week 5 Flashcards

1
Q

which is more effective: sampling MORE times per cycle or less?

A

sampling more times per cycle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

aliasing

A

when a signal is discretely sampled at an insufficient range to catch changes in the signals

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

2 faults with aliasing

A
  1. different signals become indistinguishable
  2. components of digitized signals at high frequencies get mistaken for components at low freuencies
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

how to avoid aliasing?

A

sampling rate should be greater than or equal to TWICE the highest frequency present in the signal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what sampling frq should be used to digitize this signal?
A(t) = 5sin(4pit) + 2sin(8pit) + 3sin(12pi*t)

A

use 12 sampling frequency and sample 6 times per signal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

highest frequency component

A

signal that defines the sampling frequency (fs)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

smallest frequency component

A

signal that defines the period of the signal (T)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

what does lower sampling frequency look like graphically?

A

the graph is jagged

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what does higher sampling frequency look like graphically?

A

the graph is loopy (too curvy/wavy)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

common post-processing operations

A

shifting, scaling, and noise reduction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

shifting/offsetting/DC shifting

A

adding a constant value to each data point
F2(t) = F(t) + C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

scaling

A

multiplying each data point by a constant value to amplify or attenuate the signal
F2(t) = F(t) * C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

scaling
C>1 does what?

A

amplifies the signal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

scaling
C<1 does what?

A

attenuates the signal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

noise reduction

A

reduce noise in measured signal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

2 methods of noise reduction

A

signal averaging and signal smoothing/filtering

17
Q

signal averaging

A

reduces noise power of a signal, best when frequency spectra of the signal and noise overlap

18
Q

2 steps of signal averaging

A

1) average all even numbered signals
2) average all odd numbered signals

19
Q

equation for estimation of noise in signal averaging

A

noise = average_odd - average_even

20
Q

how do you calculate the average of even data points in matlab?

A

avg_even = mean(noisy_signal(2:2:end, :))

21
Q

how do you calculate the average of odd data points in matlab?

A

avg_odd = mean(noisy_signal(1:2:end, :))

22
Q

how do you calculate SNR in matlab

A

rmsy = sqrt(mean(y2 .^ 2))
rmsnoise = sqrt(mean(error.^2))
SNR = 20* log10(rmsy/rmsnoise)

23
Q

filters

A

used to remove unwanted parts of data

24
Q

moving average filter

A

most common digital signal processing method replaces each data value with the average of itself and nearby data points

25
Q

types of moving average filters

A

symmetrical, asymmetrical, weighted, and unweighted

26
Q

symmetrical moving average filter

A

replace data point with average of itself and next door neighbors

27
Q

asymmetrical moving average filter

A

replace data point with average of itself and future OR past values, its asymmetric so it’s one way or the other

28
Q

when are moving average filters useful?

A

for time domain encoded signals
it smooths data
reduces energy occupying the high-frequency end of the signal frequency spectrum.
removes random noise

29
Q

weighted moving average filter

A

replaces each value with average of nearby data points and fives MOST weight to data point being replaces and LEAST to points further away

30
Q

weighted moving average filter weight example

A

*relative to the data point being replaces
2 indices before/after -> multiply by one
1 index before/after -> multiply by two
index of interest -> multiply by 3

average by summing all that up and dividing by (1+2+3+2+1) (sum of multiples)

31
Q

in signal averaging
noise average will approach ___ while number of signals in average approaches _____

A

0
inf