Please use this identifier to cite or link to this item:
Title: Analysis for the realization of an in-place and in-order prime factor algorithm
Authors: Lun, DPK 
Siu, WC 
Issue Date: 1993
Source: IEEE transactions on signal processing, 1993, v. 41, no. 7, p. 2312-2370
Abstract: For the computation of the prime factor algorithm (PFA), an in-place and in-order approach is always desirable not only because of its reduction on memory requirement for the storage of the temporary results, but also because the computation time which is required to unscramble the output sequence to a proper order can also be saved. In this paper, we show that the PFA has an intrinsic property that allows it to be easily realized in an in-place and in-order form. As it is different from the other propositions which use two equations respectively for loading data from and retrieving results back to the memory, in this paper we show formally that in many cases only one equation is enough for both operations. Thus a truly in-place and in-order computation is accomplished. Nevertheless, the sequence length of the PFA computation must be carefully selected. Another objective of this paper is to analyze the conditions on which a particular sequence length is possible for in-place and in-order PFA computation. The result of this paper is useful to both the hardware and software realization of the PFA.
Publisher: Institute of Electrical and Electronics Engineers
Journal: IEEE transactions on signal processing 
ISSN: 1053-587X
EISSN: 1941-0476
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 21, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 28, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.