Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

N-argument convolution #338

Open
wants to merge 34 commits into
base: master
Choose a base branch
from
Open

N-argument convolution #338

wants to merge 34 commits into from

Conversation

HDictus
Copy link
Contributor

@HDictus HDictus commented Jan 9, 2020

redo of #299 , Adresses #224

Allows convolution of an arbitrary number of arrays, also making seperable convolution possible in any configuration of any number of dimensions.

galenlynch and others added 25 commits May 15, 2019 10:48
I have added an overlap-save algorithm to convolution, which is substantially
faster (~2x) for large convolution problems. It is also substantially faster
than other packages like ImageFiltering.jl. For smaller convolutions, it is
about the same or a little bit slower than standard fft convolution. The cutoff
between overlap-save and simple fft convolution is pretty arbitrary at the
moment, so it would be nice to add some benchmarking to allow DSP.jl to choose
between the two algorithms depending on the size of the input. It would also be
nice to add spatial/time domain filtering for small convolutions, as it would
almost certainly be faster than fft convolutions. This is relevant to JuliaDSP#224.
performs overlap-save on the first argument if it is large
enough to warrant it. Performs fft convolution of all others.
public conv needs 2 or more arguments
redundant union removed
permsort with rev=true
comprehension replaced with elementwise operation
(fix minor issue)
also fix issue that test revealed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants