Efficient address generation for prime factor algorithms (digital signal processing)

DOI10.1109/29.60072MaRDI QIDQ3482813zbMATH OpenOpenAlexFDO

Authors Kar-Lik Wong, Daniel P. K. Lun, W. C. Siu, Raymond H. Chan

Publication date 1990

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/29.60072

zbMATH Keywords

discrete Fourier transformChinese remainder theoremprime factor algorithmindex mappingAddress generation schemesin-order DFT-algorithmin-place DFT-algorithm

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Recommendations

• Efficient prime factor algorithm and address generation techniques for the discrete cosine transform
• scientific article; zbMATH DE number 1759305
• Efficient method for generating strong primes with constraint of bit length
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Generating Provable Primes Efficiently on Embedded Devices
• Simple parallel algorithms for primality testing and integer factorization
• scientific article; zbMATH DE number 5876376

Cited in

(4)

• A pipeline design for the realization of the prime factor algorithm using the extended diagonal structure
• An analysis for the realization of an in-place and in-order prime factor algorithm
• Efficient prime factor algorithm and address generation techniques for the discrete cosine transform
• Symmetric Prime Factor Fast Fourier Transform Algorithms

This page was built for publication: Efficient address generation for prime factor algorithms (digital signal processing)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3482813)