50 years of FFT algorithms and applications

GG Kumar, SK Sahoo, PK Meher - Circuits, Systems, and Signal …, 2019 - Springer
The fast Fourier transform (FFT) algorithm was developed by Cooley and Tukey in 1965. It
could reduce the computational complexity of discrete Fourier transform significantly from O …

Implementation issues of the two-level residue number system with pairs of conjugate moduli

A Skavantzos, M Abdallah - IEEE Transactions on Signal …, 1999 - ieeexplore.ieee.org
One of the most important considerations when designing residue number systems (RNSs)
is the choice of the moduli set; this is due to the fact that the dynamic range of the system, its …

[PDF][PDF] Error detection & correction in wireless sensor networks by using residue number systems

M Roshanzadeh, S Saqaeeyan - International Journal of …, 2012 - researchgate.net
Wireless Sensor Networks have potential of significantly enhancing our ability to monitor
and interact with our physical environment. Realizing a fault tolerant operation is critical to …

A single modulus complex ALU for signal processing

F Taylor - IEEE transactions on acoustics, speech, and signal …, 1985 - ieeexplore.ieee.org
Fast complex arithmetic is essential to a wide class of real-time digital transform and filter
operations. Traditional methods require a multiplicity of real multiplies and adds be …

An efficient residue to weighted converter for a new residue number system

A Skavantzos - Proceedings of the 8th Great Lakes Symposium …, 1998 - ieeexplore.ieee.org
The Residue Number System (RNS) is an integer system appropriate far implementing fast
digital signal processors since it can support parallel, carry-free, highspeed arithmetic. In this …

On multimoduli residue number systems with moduli of forms r/sup a/, r/sup b/-1, r/sup c/+ 1

M Abdallah, A Skavantzos - … on Circuits and Systems I: Regular …, 2005 - ieeexplore.ieee.org
The residue number system (RNS) is an integer system appropriate for implementing fast
digital signal processors since it can support parallel, carry-free, high-speed arithmetic. One …

On the polynomial residue number system (digital signal processing)

A Skavantzos, FJ Taylor - IEEE Transactions on Signal …, 1991 - ieeexplore.ieee.org
The theory of the polynomial residue number system (PRNS), a system in which totally
parallel polynomial multiplication can be achieved provided that the arithmetic takes place in …

An RNS discrete Fourier transform implementation

FJ Taylor - IEEE transactions on acoustics, speech, and signal …, 1990 - ieeexplore.ieee.org
A novel discrete Fourier transform (DFT) implementation is described. It is based on the
union of number theoretic transforms, modular arithmetic, and distributed arithmetic. In order …

Full adder-based arithmetic units for finite integer rings

T Stouraitis, SW Kim… - IEEE Transactions on …, 1993 - ieeexplore.ieee.org
Most implementations of accumulators, multipliers, or multiplier-accumulator units, operating
in a finite integer ring, R (m), are based on ROM's or PLA's. This paper proposes a full adder …

Low-power implementation of polyphase filters in quadratic residue number system

GC Cardarilli, A Del Re, A Nannarelli… - 2004 IEEE International …, 2004 - ieeexplore.ieee.org
The aim of this work is the reduction of the power dissipated in digital filters, while
maintaining the timing unchanged. A polyphase filter bank in the Quadratic Residue Number …