An analysis for the realization of an in-place and in-order prime factor algorithm

It is shown that the prime factor algorithm (PFA) has an intrinsic property that allows it to be easily realized in an in-place and in-order form. In contrast to other approaches that use two equations for loading data from and returning the results to the memory, respectively, it is shown formally...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 41; no. 7; pp. 2362 - 2370
Main Authors Lun, D.P.-K., Siu, W.-C.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.07.1993
Institute of Electrical and Electronics Engineers
Subjects
Algorithm design and analysis
Applied sciences
Buffer storage
Discrete Fourier transforms
Equations
Exact sciences and technology
Hardware
Information retrieval
Information, signal and communications theory
Mathematical methods
Telecommunications and information theory
Design
Signal processing
Storage
Fast Fourier transformation
Algorithm
Memory
Online AccessGet full text

Cover

More Information
Summary:It is shown that the prime factor algorithm (PFA) has an intrinsic property that allows it to be easily realized in an in-place and in-order form. In contrast to other approaches that use two equations for loading data from and returning the results to the memory, respectively, it is shown formally that in many cases only one equation is enough for both operations. Thus a truly in-place and in-order computation is obtained. Nevertheless, the sequence length of the PFA computation must be carefully selected. The conditions under which a particular sequence length is possible for in-place and in-order PFA computation are analyzed.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/78.224245