Pursuant to the first problem in the fast 1-D convolution series, this problem asks for the fast algorithm to compute the 1-D convolution in its "valid" output shape.
There exists a fast 1-D convolution algorithm way more efficient than MATLAB's built-in conv function invoked in the form conv(u,v,'valid'), and the performance improvement is more pronounced when length(u) and/or length(v) are large. Do you know how? Try it out.
- Previous problem: Fast 1-D Convolution (same shape).
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers17
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
481 Solvers
-
Project Euler: Problem 3, Largest prime factor
1792 Solvers
-
Project Euler: Problem 7, Nth prime
1755 Solvers
-
Matrix with different incremental runs
131 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
256 Solvers
More from this Author28
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
"score.p" is invalid now, the score is size, not speed.