Zero padding

Zero padding extends a finite sequence by zero entries to a specified length. For input lengths $r,s$, their full discrete convolution has length at most $r+s-1$. Padding both inputs to $N\ge r+s-1$ allows circular convolution to represent this full result without folded entries.