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 discrete-signals
Search options not deleted
user 10674
A discrete signal or discrete-time signal is a time series consisting of a sequence of quantities.
1
vote
1
answer
288
views
Inverse DFT in terms of original signals for product of two DFTs
Given $x[n]$ and $h[n]$ that are zero for $n<0$ and $n>15$, their linear convolution being $y[n]=x[n]*h[n]$ and their discrete time Fourier transforms are $X(e^{j\omega})$ and $H(e^{j\omega})$, then
$ …
- 28.4k
2
votes
1
answer
380
views
IDFT of $Y[k]=2X[k]$ for even $k$
If the 16-point DFTs of $x[n]$ and $y[n]$ are given as
$Y[k]=\begin{cases}2X[k], & k=0,2,4,...,14 \\ 0, & k=1,3,5,...,15\end{cases}$, where $x[n],y[n]=0, \forall n<0, n>15$, how can I write $y[n]$ in …
- 28.4k