FFT Signal Processing to Clean Up Distortion/Noise

Click For Summary

Discussion Overview

The discussion revolves around methods for cleaning up a signal affected by low-frequency distortion or noise, specifically using FFT (Fast Fourier Transform) techniques. Participants explore various approaches to separate the original signal from the noise, considering the implications of signal multiplication versus addition.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Homework-related

Main Points Raised

  • One participant proposes using FFT on the combined signal h(t) = v(t)*g(t) and removing lower frequencies, but expresses concern that this may also eliminate parts of v(t).
  • Another participant suggests that the fundamental issue lies in the challenge of removing noise and mentions the importance of selecting an appropriate method for suppressing low frequencies, such as using a function inversely proportional to frequency.
  • A different participant questions whether the operation is convolution or multiplication, emphasizing the need for clarity in notation.
  • Clarifications are made that the operation is indeed multiplication, not convolution, and that the context involves receiving an AM radio signal affected by atmospheric conditions.
  • One participant claims to have solved the problem by taking the logarithm of the function, leading to a different approach involving filtering in the frequency domain.
  • Another participant challenges the effectiveness of linear filtering in recovering v(t) from the modulation caused by g(t), suggesting that a non-linear operation would be necessary for recovery.

Areas of Agreement / Disagreement

Participants express differing views on the effectiveness of various methods for noise removal, with some suggesting linear filtering and others advocating for non-linear approaches. There is no consensus on the best method to recover the original signal.

Contextual Notes

Participants note the potential confusion between multiplication and convolution in signal processing, which may affect the interpretation of the problem. The discussion also highlights the limitations of linear filtering in the context of non-linear signal modulation.

singedang2
Messages
25
Reaction score
0
hello!

i'm given a signal h(t) = v(t)*g(t)
where g(t) is a distortion/noise that got added
and has a very low frequency compared to v(t)

i need to devise a method to clean up g(t)

i'm thinking of to do the fft on the signal h(t),
and remove the lower frequencies and do the inverse fft,
but this might not just remove g(t), but it may as well remove v(t)

any hints?
 
Engineering news on Phys.org
I haven't studied this in any good detail, so my answer is not going to be the best. But I think your solution is correct, and that the problem with this is a fundamental problem with removing noise. I have been searching my files because I remember reading all about this, but I can't find what I read anywhere.

I think the answer is in choosing the right method of suppressing low frequencies, for example, multiplying the Fourier transform by some function which is inversely proportional to frequency.

I wish I had this book though! By the way, is * a convolution in your notation or multiplication?
 
singedang2 said:
hello!

i'm given a signal h(t) = v(t)*g(t)
where g(t) is a distortion/noise that got added
and has a very low frequency compared to v(t)

i need to devise a method to clean up g(t)

i'm thinking of to do the fft on the signal h(t),
and remove the lower frequencies and do the inverse fft,
but this might not just remove g(t), but it may as well remove v(t)

any hints?

I have the same question as MikeyW. You say in your post that g(t) is added, but are using * as the combination symbol. If the g(t) is just added, and is lower frequency, they it seems that running h(t) through a DSP highpass filter would do what you want?
 
sorry for the confusion. it's a multiplication. by 'add' i meant the two signals got mixed altogether.
 
singedang2 said:
sorry for the confusion. it's a multiplication. by 'add' i meant the two signals got mixed altogether.

Why are they multiplied? Where is the non-linearity? Or is this just a coursework exercise? What is the context please?
 
i don't know about the non-linearity. this is for a course, and we've only learned fft and some Fourier analysis.

the questions is we're suppose to receive am radio singal, but due to atmospheric/weather condition, loudness of the signal changes.

so the original signal we wanted to receive was v(t), but instead we get v(t)*g(t),
and g(t) has relatively low frequency compared to v(t).
 
Can you double check that it's not a convolution?

If you multiply two functions v(t)g(t) would be my notation, to me v(t)*g(t) suggests convolution, especially in signal processing... is the question in original form specific about what the symbol "*" means?
 
i've checked and it's multiplication, NOT CONVOLUTION. so v(t)g(t), instead of v(t)*g(t).
sorry for the confusion.
 
i was able to solve this problem.

the key was to take log of the function.

then it becomes logv(t) + log(g(t))
then we do the usual fft then do the filtering, then do inverse fft to get back the original signal.
 
  • #10
singedang2 said:
i was able to solve this problem.

the key was to take log of the function.

then it becomes logv(t) + log(g(t))
then we do the usual fft then do the filtering, then do inverse fft to get back the original signal.
Well you would not have the original signal, you would have log( original signal ).

BTW, as pointed out above the expression v(t) times g(t) is not an addition of noise, it is a modulation, a non-linear operation for any non-trivial g(t). No linear filter operation will recover the v(t). You'd need another non-linear operation to recover v(t), such as a demodulation.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
8
Views
2K
Replies
4
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K