{
  "$schema": "https://json-schema.org/draft/2020-12/schema",
  "$id": "https://www.calculatorx.com/schemas/math.transform.dft/1.2.0/input.json",
  "title": "Discrete Fourier transform — input",
  "type": "object",
  "additionalProperties": false,
  "properties": {
    "mode": {
      "type": "string",
      "enum": [
        "dft",
        "idft",
        "fft",
        "ifft"
      ]
    },
    "samples": {
      "type": [
        "string",
        "array",
        "number"
      ]
    },
    "x": {
      "type": [
        "string",
        "array",
        "number"
      ]
    },
    "re": {
      "type": [
        "string",
        "array",
        "number"
      ]
    },
    "im": {
      "type": [
        "string",
        "array"
      ]
    }
  },
  "description": "Direct DFT / IDFT and radix-2 FFT / IFFT of a length-N sequence, N≤64. FFT requires N=2^k. Numpy backward: unnormalized forward, 1/N inverse. Discovery /dft, /inverse-dft, /fft, /ifft. Not Laplace, not Z, not CAS. (calculation_version 1.2.0) Provide at least 1 of: samples, x, re."
}