Digital fourier transform on staggered blocks: recursive solution I

In this paper a procedure and a structured are presented for evaluating the Digital Fourier Transform on successive sets of N elements staggered of M.The procedure is recursive and requires (N/2) Log24M complex multiplications. The structured works in real time and needs (N/(2M) log24M multipliers.