FFT-based Convolution

Convolve two sequences using FFT, which is more efficient than direct convolution for long sequences (O(n log n) vs O(n^2)). Convolution is fundamental in signal processing, filtering, polynomial multiplication, and probability distribution calculations. Returns the convolution of sequences a and b. [Tier: BASIC, Credits: 1]

POST /quantlib/numerical/fft/convolve

FFT-based Convolution

cURL

curl --request POST \
  --url https://api.fincept.in/quantlib/numerical/fft/convolve \
  --header 'Content-Type: application/json' \
  --header 'X-API-Key: <api-key>' \
  --data '
{
  "a": [
    1,
    2,
    3
  ],
  "b": [
    0.5,
    1,
    0.5
  ]
}
'

200

{
  "success": true,
  "data": {
    "result": [
      0.5,
      2,
      4,
      4,
      1.5
    ],
    "length": 5
  }
}

Authorizations

X-API-Key · string · header · required

API key for authentication. Get your key at https://api.fincept.in/auth/register

Body

application/json

a · number[] · required

First input sequence

Example:

[1, 2, 3]

b · number[] · required

Second input sequence

Example:

[0.5, 1, 0.5]

Response

200

application/json

Successful Response

success · boolean

Example:

true

data · object

Show child attributes