Signal processing
Overlap-save block schedule
Map finite-input FFT blocks, discarded prefixes and retained convolution samples.
Your inputs
Start with an exampleYour result
Example resultAa — A small example of your colors.
How it works
For FFT length N and FIR length M, keep N−M+1 samples per block after discarding M−1. Zero-extend the input at both ends to retain all L+M−1 convolution samples.
For L=10, M=3 and N=8, the hop is 6. Two blocks keep output ranges [0,6) and [6,12).
Limits
At most 10000 blocks, N≥M; a power-of-two FFT is not required mathematically. Zero-based, end-exclusive ranges. This builds a full linear-convolution schedule, not convolution values, an optimal FFT size, latency measurements or a real-time processing guarantee.