Examples
Examples
Try the starting example
- Filter taps
- 65
- Input block size
- 256
- Input sample count
- 10000
- Minimum FFT length
- 320
- Power-of-two FFT length
- 512
- Block count
- 40
- Overlap samples
- 64
Try another scenario
- Filter taps
- 66
- Input block size
- 256
- Input sample count
- 10000
- Minimum FFT length
- 321
- Power-of-two FFT length
- 512
- Block count
- 40
- Overlap samples
- 65
Calculation method
Calculation method
Minimum FFT length
Block size + filter length−1.
Power-of-two FFT length
Smallest power of two at least minimum length.
Block count
ceil(total input/block size).
Overlap samples
Filter length−1.
Symbols and units
- a
- Filter taps
- b
- Input block size
- c
- Input sample count
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Filter length, block size, sample count. Returns FFT sizes, block count and overlap. All coefficients and observations are user supplied; results describe only the stated mathematical model. Quantities are deterministic calculations from supplied observations and assumptions; no external data is fetched. Supported limits: Finite inputs only; numeric fields bounded as labelled. Lists and JSON records are limited to 256 entries unless a stricter tool bound is stated. No automatic design approval, legal conclusion, treatment recommendation or safety certification. Filter taps: minimum 1, maximum 1000000. Input block size: minimum 1, maximum 1000000. Input sample count: minimum 1, maximum 100000000.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
Background reading; this does not imply endorsement or independent review of SumFizz.