Free Convolution Calculator

Enter both sequences and click Calculate to see the convolution result.

Convolution is a fundamental operation in mathematics and signal processing, and this convolution calculator enables you to quickly obtain the convolution of two sequences directly online. Whether you are exploring the discrete convolution formula or need a reliable sequence convolution calculator for academic or professional work, the tool streamlines the entire process. The following sections explain how convolution works, how to apply the formulas, and how the online convolution of sequences online tool can assist you.

What Is Convolution?

Convolution is a binary operation that takes two sequences (or continuous functions) and produces a third sequence (or function). It is typically denoted by the asterisk symbol ∗*. In the discrete case, each term of the result is obtained by summing the products of terms whose indices sum to a fixed value. This operation appears in a wide range of fields, including differential equations, probability theory, acoustics, geophysics, signal processing, and computer vision. For example, in signal processing, if the impulse response of a linear time‑invariant system is known, convolution can predict the system’s output for any arbitrary input.

The Discrete Convolution Formula

For two discrete sequences a={a0,a1,a2,… }a = \{a_0, a_1, a_2, \dots\} and b={b0,b1,b2,… }b = \{b_0, b_1, b_2, \dots\}, their convolution c=a∗bc = a * b is defined by the sum

cn=∑k=0nak b n−k,n=0,1,2,…c_n = \sum_{k=0}^{n} a_k \, b_{\,n-k}, \qquad n = 0, 1, 2, \dots

Here the index nn runs over the possible sums of indices. For finite‑length sequences, the formula is applied only when both indices kk and n−kn-k lie within the valid ranges; outside those ranges the terms are treated as zero. The resulting sequence cc has length N+M−1N + M - 1 when aa has NN terms and bb has MM terms.

Expanding the first few terms reveals a clear pattern:

c0=a0b0c1=a0b1+a1b0c2=a0b2+a1b1+a2b0c3=a0b3+a1b2+a2b1+a3b0c4=a0b4+a1b3+a2b2+a3b1+a4b0\begin{aligned} c_0 &= a_0 b_0 \\ c_1 &= a_0 b_1 + a_1 b_0 \\ c_2 &= a_0 b_2 + a_1 b_1 + a_2 b_0 \\ c_3 &= a_0 b_3 + a_1 b_2 + a_2 b_1 + a_3 b_0 \\ c_4 &= a_0 b_4 + a_1 b_3 + a_2 b_2 + a_3 b_1 + a_4 b_0 \end{aligned}

and so on. Each product aibja_i b_j appears in term cnc_n precisely when i+j=ni + j = n.

Step‑by‑Step Example: Convolving [1, 2, 3] and [4, 5, 6]

Let us calculate convolution of the sequences a=[1,2,3]a = [1, 2, 3] and b=[4,5,6]b = [4, 5, 6] using the formula above:

c0=1×4=4c1=1×5+2×4=13c2=1×6+2×5+3×4=28c3=2×6+3×5=27c4=3×6=18\begin{aligned} c_0 &= 1 \times 4 = 4 \\ c_1 &= 1 \times 5 + 2 \times 4 = 13 \\ c_2 &= 1 \times 6 + 2 \times 5 + 3 \times 4 = 28 \\ c_3 &= 2 \times 6 + 3 \times 5 = 27 \\ c_4 &= 3 \times 6 = 18 \end{aligned}

Thus, the convolution result is [4,13,28,27,18][4, 13, 28, 27, 18]. You can confirm this result with the sequence convolution calculator by entering the two sequences (the tool supports up to fifteen terms per sequence) – the convolution output appears instantly after input.

Convolution of Continuous Functions

The concept naturally extends to real‑valued functions. For two functions ff and gg, their convolution (f∗g)(x)(f * g)(x) is defined by the integral

(f∗g)(x)=∫−∞∞f(t) g(x−t) dt.(f * g)(x) = \int_{-\infty}^{\infty} f(t) \, g(x - t) \, dt.

From a geometric standpoint, the function gg is first reflected across the vertical axis (g(−t)g(-t)) and then shifted by xx. The convolution value at xx equals the area under the product of f(t)f(t) and the reflected‑and‑shifted gg. As xx changes, the “window” slides over the signal, emphasizing different parts. In signal‑processing terms, ff is the input and gg plays the role of a filter (e.g., blurring or sharpening depending on the filter design).

Important Algebraic Properties

Convolution enjoys several useful properties that mirror ordinary multiplication:

  • Commutativity: a∗b=b∗aa * b = b * a — the order of the two sequences does not affect the final result.
  • Associativity: a∗(b∗c)=(a∗b)∗ca * (b * c) = (a * b) * c — multiple convolutions can be grouped arbitrarily.
  • Distributivity: a∗(b+c)=a∗b+a∗ca * (b + c) = a * b + a * c.
  • Identity element: The sequence δ=[1,0,0,0,… ]\delta = [1, 0, 0, 0, \dots] (called the unit sample sequence, discrete‑time impulse, or Kronecker delta) acts as an identity: δ∗a=a\delta * a = a. Convolving any sequence with this impulse leaves the original sequence unchanged.

These properties make convolution a flexible tool both for theoretical derivations and practical implementations.

Convolution in Probability Theory

One of the most elegant applications of convolution appears in probability. If XX and YY are two independent random variables with probability density functions (PDFs) fX(x)f_X(x) and fY(y)f_Y(y), then the PDF of their sum Z=X+YZ = X + Y is exactly the convolution of the individual PDFs:

fZ(z)=(fX∗fY)(z)=∫−∞∞fX(t) fY(z−t) dt.f_Z(z) = (f_X * f_Y)(z) = \int_{-\infty}^{\infty} f_X(t) \, f_Y(z - t) \, dt.

This theorem allows analysts and statisticians to determine the distribution of sums of independent variables directly from the component PDFs, without needing moment‑generating functions.

Using the Online Convolution Calculator

Operating this convolution calculator is straightforward:

  • Enter the terms of the first sequence (up to 15 values); additional input fields appear automatically as you type.
  • Repeat for the second sequence.
  • The calculator displays the complete convolution result alongside your original inputs.

The tool handles the discrete convolution formula automatically, saving time and eliminating manual arithmetic errors. It is ideal for students verifying homework, engineers testing filter responses, or anyone who needs to quickly calculate convolution of two sequences. No registration or installation is required – simply access the tool online and start computing.

FAQ

1. What is the formula for discrete convolution?

For two sequences a and b, their convolution c is given by c_n = ∑_{k=0}^{n} a_k * b_{n-k}, where n starts from 0. The resulting sequence has length N + M - 1 when a has N terms and b has M terms.

2. How can I use this convolution calculator?

Enter the terms of your first sequence (up to 15) and then the terms of the second sequence. Additional input fields appear automatically. The tool immediately shows the convolution result and your input summary for verification.

3. Is convolution commutative?

Yes, convolution is commutative. For any two sequences a and b, a * b = b * a. It also satisfies associativity and distributivity, making it behave much like ordinary multiplication.

4. What is the convolution identity element?

The identity element for discrete convolution is the unit sample sequence δ = [1, 0, 0, 0, …]. Convolving any sequence with δ returns the original sequence unchanged.

How to Use

  1. Enter the first sequence (Sequence A) as comma-separated numbers in the input field, e.g., '1, 2, 3'.
  2. Enter the second sequence (Sequence B) as comma-separated numbers in the input field, e.g., '4, 5, 6'.
  3. Click Calculate to instantly compute the convolution of the two sequences. Toggle the step-by-step option to see the intermediate calculations.