Compute the discrete linear convolution of two sequences, with length, peak, and sum verification.
Result
How to use this tool
Enter comma-separated numbers for the first sequence.
Enter comma-separated numbers for the second sequence.
Read the convolution, its length and peak value.
Confirm the result sum equals the product of the input sums.
Formula & worked example
The convolution of [1, 2, 3] and [0, 1, 0.5] is [0, 1, 2.5, 4, 1.5].
Limitations — read this before you rely on it
Finite real sequences up to 500 values each; complex-valued signals and circular convolution are not covered.
Frequently asked questions
A way of combining two sequences so each output value blends one sequence with a reversed, sliding copy of the other.
This tool computes linear convolution, the version used for finite signals and filters, not the wraparound circular version.
The result has length m+n−1, because the sliding overlap extends past both ends of the inputs.
The sum of the convolution always equals the product of the input sums, which catches entry errors.
In filtering, smoothing, probability (sums of independent variables), and signal processing.