Skip to main content

Questions tagged [convolution]

Convolution is a mathematical operation on two functions f and g, producing a third function that is typically viewed as a modified version of one of the original functions.

Filter by
Sorted by
Tagged with
0 votes
1 answer
51 views

Specifically I'm unsure about a factor of 2 scale factor when converting the measured insertion loss to a double sided spectrum, necessary for the ifft. In the past I have always believed that ...
Christian's user avatar
  • 135
0 votes
0 answers
32 views

To compute the value of each CUT fast, I have been using the FFT to convolve/sum the test cell together. But I have seen that the zero-padding needed for linear convolution is being included in the ...
Joe's user avatar
  • 1
4 votes
4 answers
1k views

In introductory course or textbook on signal processing, there seems to be an underlying mantra of "Filtering only happens in time domain, while filter design only happens in frequency domain&...
Fraïssé's user avatar
  • 643
0 votes
1 answer
154 views

I read through a lot of the already existing posts about autocorrelation via FFT on this forum and elsewhere but I am still confused. Also, I am still not sure whether this is the right place to ask ...
durst's user avatar
  • 103
2 votes
1 answer
86 views

I'm given the following: Where in the last box it says "reconstruct". As you can see $x(t)$ is multiplied by the impulse train $p(t)$ and then passed through this LPF and then to the ...
Nate3384's user avatar
  • 121
0 votes
2 answers
111 views

The Fourier Transform of a chirp is another chirp $$ \mathscr{F}\{\,e^{j\pi k t^2}\}(f) \;=\; \sqrt{\frac{1}{|k|}}\;e^{\,j\,\operatorname{sgn}(k)\,\frac{\pi}{4}}\; \exp\!\Bigl(-\,j\pi\,\frac{f^2}{k}\...
Tom Huntington's user avatar
0 votes
1 answer
84 views

Given $h (t) = e^{-t} u(t)$, where $u$ denotes the Heaviside step function, find $h_{\text{per}}(t)$, the periodization of $h$ with period $T$. I found $H(\omega) = \dfrac{1}{1 + j\omega}$, and now I'...
Nate3384's user avatar
  • 121
1 vote
1 answer
110 views

In the usual derivation of the LTI convolution formula, we often start with this identity: $$x(t) = (x*\delta)(t) = \int _{-\infty}^{\infty} x(\tau) \delta(t - \tau) \ d\tau$$ Then for a linear system ...
hasanghaforian's user avatar
2 votes
3 answers
154 views

For a LTI system, suppose it output $h[n]$ for input $\delta[n]$ ("impulse response"). We can decompose any input signal $x[n]$ using linear combination of the time dilations of $\delta[n]$: ...
Mark Ren's user avatar
0 votes
1 answer
96 views

Let $x[n]$ and $y[n]$ be two periodic signals of period $N$. Can the circular convolution of $x$ and $y$ be defined as follows: $$ (x \circledast y)[n] = \sum_{k=0}^{N-1} x[k] y[n-k] \qquad (n \in \...
boaz's user avatar
  • 181
0 votes
1 answer
68 views

Let $F_x[k]$ denotes the DFT of the periodic signal $x[n]$. If $x$ and $y$ are periodic with period $N$, then their (usual) convolution $x*y$ is also periodic with period $N$. Is it true that $$ F_{x*...
boaz's user avatar
  • 181
0 votes
2 answers
65 views

The zero-state response of a filter with impulse response $h[k]$ to an input signal $x[k]$ can be calculated by performing the convolution $$y[k] = x[k] \ast h[k] \tag1$$ If $x[k]$ has length $m$ and $...
Carl's user avatar
  • 546
3 votes
0 answers
68 views

Following the approaches in [1], [2], and other related references, it is well established that the time-domain OFDM signal can be oversampled without increasing the effective length of the channel ...
Sajjad's user avatar
  • 433
2 votes
2 answers
166 views

I have become confused about a subtlety about window functions. Context My application is that I start with an interferogram (which is basically an image of a cosine function). The pipeline is: I ...
David's user avatar
  • 123
8 votes
2 answers
1k views

Say there are two signals $x_1(t)$ and $x_2(t)$ that are not equal except for over the domain $t=-0.5$ to $t=0.5$. Therefore $rect(t)x_1(t)=rect(t)x_2(t)$. Taking the Fourier transform of both sides ...
Levi's user avatar
  • 351

15 30 50 per page
1
2 3 4 5
71