Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: design and simulation of 32 and 64 point fft using multiple radix algorithm miss .
design of 16 - point radix - 4 fast fourier transform in 0 . 18aµm cmos technology .
Design of Approximate Radix-4 Booth Multipliers for Error-Tolerant Computing
THE HYBRID ARCHITECTURE PARALLEL FAST FOURIER TRANSFORM (HAPFFT)
Efficient Design of FIR Filter using Modified Booth Multiplier
Accelerating the Nonuniform Fast Fourier Transform Using FPGAs
Real-valued Fast Fourier Transform Algorithms
Fast Fourier Transforms: for fun and profit
FFT implementation and optimization on FPGA
Pipeline FFT architectures optimized for FPGAs
Improving the Performance of the FFT-based Parallel Code-phase Search Acquisition of GNSS Signals by Decomposition of the Circular Correlation
Low-power twiddle factor unit for FFT computation
Analog CMOS implementation of FFT using cascode current mirror
Some New Parallel Fast Fourier Transform Algorithms
Pruning of Winograd and FFT Based Convolution Algorithm
An efficient floating point multiplier design for high speed applications using Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm
Array hybrid multiplier versus modified booth multiplier: comparing area and power consumption of layout implementations of signed radix-4 architectures
Fast Acquisition of GPS Signal Using Radix-2 and Radix-4 FFT Algorithms
FPGA implementations of fast Fourier transforms for real-time signal and image processing
The FastFourierTransformand ItsApplications
Computational Frameworks for the Fast Fourier Transform (Charles Van Loan)
it ' s computational thinking ! bebras tasks in the curriculum .
High Performance Complex Number Multiplier Using Booth-Wallace Algorithm
As time goes by: Hippocampal connectivity changes with remoteness of autobiographical memory retrieval
Effectiveness of intrauterine treatment with cephapirin in dairy cows with purulent vaginal discharge.
Evaluation of tracking algorithm performance without ground-truth data