Pages that link to "Item:Q2502864"
From MaRDI portal
The following pages link to Multiplierless implementation of rotators and FFTs (Q2502864):
Displaying 9 items.
- Fast discrete Fourier transform computations using the reduced adder graph technique (Q838581) (← links)
- Novel design of multiplier-less FFT processors (Q970835) (← links)
- Fast Fourier Transforms using the complex logarithmic number system (Q1405500) (← links)
- Low-power constant-coefficient multiplier generator (Q1405543) (← links)
- Numerical accuracy of Fast Fourier Transforms with CORDIC arithmetic (Q1580048) (← links)
- Derivation of a rotator circuit with homogeneous interconnect (Q1607090) (← links)
- Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations (Q2505083) (← links)
- Multiplierless multiple constant multiplication (Q2944548) (← links)
- Implementation of FFT Structures Using the Residue Number System (Q3859280) (← links)