Digital fourier transform of staggered blocks: recursive solution II

In this work the problem of evaluating the Digital Fourier Transform on ordered sets of N elements staggered of M is considered. A recursive procedure for solving such a problem is given, whose complexity is (N/2) log 4M. A structured of implementing such a procedure is presented. Other solutions of this problem are given elsewhere.