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 fft
Search options not deleted
user 7052
The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
2
votes
1
answer
3k
views
Basic question about chirp signal
Suppose I generate chirp signal with the following python code:
t = np.linspace(0, 10, 512)
f0 = 2
f1 = 5
fs = 2*f1
w = chirp(t, f0=f0, f1=f1, t1=10, method='linear')
result = rfft(w)
phase = …
- 243