Undergrad Domain of convolution vs. domain of Fourier transforms

Click For Summary
Convolution of two signals results in an output signal longer than the inputs, specifically of length X+Y-1. The Convolution Theorem states that convolution in the time domain corresponds to pointwise multiplication in the Fourier domain, but requires careful handling of signal lengths. The Discrete Fourier Transform (DFT) assumes periodic signals, leading to circular convolution unless zero-padding is applied to achieve linear convolution. Zero-padding both signals ensures that the output length meets the requirement of X+Y-1 without artifacts from periodicity. Clarifying the context, particularly that the discussion pertains to discrete-time signals, is essential for accurate interpretation.
skynelson
Messages
57
Reaction score
4
TL;DR
Convolving two signals, g and h, of lengths X and Y respectively, results in a signal with length X+Y-1. How can the length of an output signal of convolution be different from the input signals , given the contents of the Convolution Theorem? Thank you!
Convolving two signals, g and h, of lengths X and Y respectively, results in a signal with length X+Y-1. But through convolution theorem, g*h = F^{-1}{ F{g} F{h} }, where F and F^{-1} is the Fourier transform and its inverse, respectively. The Fourier transform is unitary, so the output signal is the same length as the input signal for that operation. The prescribed pointwise multiplication also requires signals of the same length (I believe the smaller will be padded to match the larger if needed).

How can the length of an output signal of convolution be different from the input signals , due to the Convolution Theorem?
 
Physics news on Phys.org
Fourier is unitary for the ##L^2## norm, not for the length of the support. Consider this, the Fourier transform of a function of compact support will not have compact support.
 
  • Like
Likes skynelson
You aren't being careful enough with your statement of the convolution theorem. Recall that the Discrete Fourier Transform (DFT) assumes that the input signal is one period of an infinitely long periodic signal. So using the DFT computes the so-called circular convolution of the two periodic signals. If you want the linear convolution (which has the length you are stating) then you will need to zero-pad both signals so that you do not get any of the artifacts from the periodic extension of the signals. At the end of the day you should find that in order to compute the linear convolution via the DFT, you need to zero pad both signals so that they each have length## \geq X+Y-1##.

jason

EDIT: I am obviously assuming you are dealing with discrete-time signals because otherwise your length question doesn't make sense. If my assumption is incorrect then your question might not make sense. In any case, it is usually best to give such details in your question.
 
Last edited:
  • Like
Likes skynelson and hutchphd
Thank you for your helpful reply. Indeed, this clears things up. Yes, I am referring to a discrete transform. Much appreciated!
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
7K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 26 ·
Replies
26
Views
853
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
5K