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 ta products of prime squares. Hence the realisation is truly m-place, in-order.
Original language | English |
---|---|
Pages (from-to) | 21-23 |
Number of pages | 3 |
Journal | Electronics Letters |
Volume | 26 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 1990 |
Keywords
- Fourier transforms
- Mathematical techniques
- Prime factor algorithm
- Signal processing
- Transforms
ASJC Scopus subject areas
- Electrical and Electronic Engineering