Timeline for Discrete Convolution of two piecewise sequences having this specific form
Current License: CC BY-SA 4.0
16 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 1, 2021 at 22:20 | comment | added | Mykael Yuday | I would also like to thank @MattL. for your help | |
Mar 1, 2021 at 22:19 | vote | accept | Mykael Yuday | ||
Mar 1, 2021 at 22:19 | answer | added | Fat32 | timeline score: 0 | |
Mar 1, 2021 at 22:15 | comment | added | Fat32 | ok let me do it.. | |
Mar 1, 2021 at 22:13 | comment | added | Matt L. | The closed-form solution is easier to see if you visualize the convolution ('graphic convolution') as shown in many textbooks. | |
Mar 1, 2021 at 22:13 | comment | added | Mykael Yuday | I would be thankful if you can show me how sir @Fat32 | |
Mar 1, 2021 at 22:12 | comment | added | Fat32 | yes you can convert the sum in Eq-3 to a closed form expression. | |
Mar 1, 2021 at 22:10 | comment | added | Matt L. | E.g., $k\ge 0$ and $k\ge a$ is equivalent to $k\ge\max(0,a)$. | |
Mar 1, 2021 at 22:10 | comment | added | Mykael Yuday | Ah I see, one last question is there a closed form for the output of the convolution in terms of $\alpha$ and $\beta$? @MattL. | |
Mar 1, 2021 at 22:09 | comment | added | Matt L. | Because $k$ needs to satisfy two sets of inequalities, so you need to make sure it does by using $max()$ and $min()$. | |
Mar 1, 2021 at 22:08 | comment | added | Fat32 | intersection of sets... | |
Mar 1, 2021 at 22:07 | comment | added | Mykael Yuday | I see, but why does the boundaries of the summation are given as $\max(a,n-d)$ and $\min(b,n-c)$? @MattL. | |
Mar 1, 2021 at 22:06 | comment | added | Matt L. | This is really straightforward. $k$ just needs to be inside $[a,b]$ and $n-k$ needs to be in $[c,d]$, that's all. | |
Mar 1, 2021 at 22:04 | history | edited | Fat32 | CC BY-SA 4.0 |
added 24 characters in body
|
Mar 1, 2021 at 21:31 | review | First posts | |||
Mar 1, 2021 at 21:54 | |||||
Mar 1, 2021 at 21:28 | history | asked | Mykael Yuday | CC BY-SA 4.0 |