A low complexity fast fourier transform architecture /
Ahmed Mamdouh Ahmed Elshay
A low complexity fast fourier transform architecture / بنية تحويلة فورير السريعة ذات التعقيد البسيط Ahmed Mamdouh Ahmed Elshay ; Supervised Omar Ahmed Ali Nasr - Cairo : Ahmed Mamdouh Ahmed Elshay , 2016 - 94 P. : charts , facsimiles ; 30cm
Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Electronics and Communications
In digital signal processing eld, it is often required to transform the signal between time and frequency domains using the fast fourier transform (FFT) algorithm. Therefore FFT blocks is one of the basic building block in digital signal processors. The basic computational units of the high-throughput pipeline FFT architectures are the buttery block and a rotator block. The buttery block performs a weighted complex addition and subtraction, while the rotator block performs a rotation in the complex plane by a given rotation angles, i.e., the twiddle factors. Compared to the buttery operation, the rotator operation is the costly one. In this work we propose a restructure to the conventional FFT rotational angles into a modied hardWare friendly FFT (HW-F FFT) angles. The main goal is to enhance either power, area or speed performance while maintaining the signal to Quantization Noise Ratio (SQNR) requirements
Cordic Fast Fourier Transform (FFT) Multiple Constant Multiplication (MCM)
A low complexity fast fourier transform architecture / بنية تحويلة فورير السريعة ذات التعقيد البسيط Ahmed Mamdouh Ahmed Elshay ; Supervised Omar Ahmed Ali Nasr - Cairo : Ahmed Mamdouh Ahmed Elshay , 2016 - 94 P. : charts , facsimiles ; 30cm
Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Electronics and Communications
In digital signal processing eld, it is often required to transform the signal between time and frequency domains using the fast fourier transform (FFT) algorithm. Therefore FFT blocks is one of the basic building block in digital signal processors. The basic computational units of the high-throughput pipeline FFT architectures are the buttery block and a rotator block. The buttery block performs a weighted complex addition and subtraction, while the rotator block performs a rotation in the complex plane by a given rotation angles, i.e., the twiddle factors. Compared to the buttery operation, the rotator operation is the costly one. In this work we propose a restructure to the conventional FFT rotational angles into a modied hardWare friendly FFT (HW-F FFT) angles. The main goal is to enhance either power, area or speed performance while maintaining the signal to Quantization Noise Ratio (SQNR) requirements
Cordic Fast Fourier Transform (FFT) Multiple Constant Multiplication (MCM)