A class of fast cyclic convolution algorithms based on block pseudocirculants

Pseudocirculant matrices have been studied in the past in the context of FIR filtering, block filtering, polyphase networks and others. For completeness, their relation to cyclic convolution, stride permutations, circulant matrices, and to certain permutations of the Fourier matrix is explicitly established in this work. Within this process, a class of highly regular fast cyclic convolution algorithms, based on block pseudocirculant matrices, is obtained.<
>