Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with fourier
Search options not deleted
user 10450
Anything related to Fourier series, Fourier transform and similar mathematical tools used to analyze the frequency content of a signal.
0
votes
1
answer
674
views
How to apply fourier transform to \$0.5^n u(n)\$
I have tried using this function \$f_1*f_2 = F_1 * F_2\$, where I'm assuming this means multiplication of two functions is equal to the convolution of their fourier transforms. … So I can calculate the fourier transorm of \$u(n)\$ fine. It is \$\pi\delta(\omega) + 1/(j\omega))\$. However, I cannot for the life of me figure out \$0.5^n\$. …
- 145
4
votes
1
answer
375
views
Nyquist sampling rate with real and imaginary aliasing
However, the fourier transform of this function is \$F(\omega) = \pi(\delta(\omega+6) + \delta(\omega-6) + i\delta(\omega-5) - i\delta(\omega+5)\$. …
- 145
0
votes
2
answers
651
views
What is the bandwidth of an imaginary convolution?
So when I take the Fourier Transform, I can rewrite the equation as such: \$F(\omega) \leftrightarrow F_1 * F_2\$. Easy so far. … The graph of the transform is
fourier transform [sinc^2(3t)sin(100t)]
(also on wolfram-alpha) …
- 145