Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32383
Title: Yet a faster address generation scheme for the computation of prime factor algorithms
Authors: Lun, DPK 
Chan, R
Siu, WC 
Issue Date: 1990
Publisher: IEEE
Source: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 1990, v. 3, p. 1499-1502 How to cite?
Abstract: An in-place, in-order address generation scheme is proposed for the realization of prime factor mapping (PFM). The new approach has the characteristic of forming systematic and regular structures. Hence it is suitable for realizations using both high-level and low-level languages. Furthermore, it requires very few modulo operations and no modulo inverse for its computation; such inverses often take up memory space for their storage and/or extra time for the computation in other address generation algorithms. The approach has been implemented using Fortran 77 and the assembly language of the 320C25 DSP. It shows that a maximum of 86% saving in address generation time can be achieved as compared to the conventional approach.
Description: 1990 International Conference on Acoustics, Speech, and Signal Processing: Speech Processing 2, VLSI, Audio and Electroacoustics Part 2 (of 5), Albuquerque, New Mexico, USA, 3-6 April 1990
URI: http://hdl.handle.net/10397/32383
ISSN: 0736-7791
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

3
Citations as of Feb 12, 2016

Page view(s)

48
Last Week
6
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check



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