This paper presents a new approach to design multiplierless constant rotators. The
approach is based on a combined coefficient selection and shift-and-add implementation …

In this brief, we propose a novel approach to implement multiplierless unity-gain single-
delay feedback fast Fourier transforms (FFTs). Previous methods achieve unity-gain FFTs by …

In this paper, we present a new fast Fourier transform (FFT) hardware architecture called
constant multiplier (CM) FFT. Whereas rotators in previous architectures must rotate among …

As silicon technology advances, field programmable gate arrays appear to gain ground
against the traditional ASIC project starts, reaching out to form the mainstream …

Fast Fourier transformation (FFT), a kernel data processing task in communication systems,
has been studied intensively for efficient software and hardware implementations …

In this work we consider structures for simultaneous multiplication by a small set of two
pairwise coefficients where the coefficients are the real and imaginary part of a limited …

By using the Wallace Tree multipliers architecture and improving the adder in each Wallace
Tree phase, reduce the unnecessary latency. The dominant logic primitive was used for …

Perfluorinated compounds (PFCs) are widely used in semiconductor processing. These inert
gases are used as a safe and efficient method to carry fluorine to etch and chemical vapor …

In this paper, a processor architecture tailored for radix-4 and mixed-radix FFT computations
is described. The processor has native support for power-of-two transform sizes. Several …

In this paper, we introduce a new satellite radio interface technology to provide efficient IMT-
Advanced services. Maximizing the commonalities with the terrestrial system is one of the …