Novel mapping scheme for transforms with lengths equal to products of prime squares

Abstract

Conventional addressing schemes for prime factor mapping (PFM) often involve two equations, one for data loading and one for data retrieval. In the letter we show that only one equation is enough in the realisation of PFM for the discrete Fourier transform with lengths equal to products of prime squares. Hence the realisation is truly in-place, in-order.