Fahad Qureshi

According to our database1, Fahad Qureshi authored at least 17 papers between 2009 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Efficient FPGA Mapping of Pipeline SDF FFT Cores.
IEEE Trans. Very Large Scale Integr. Syst., 2017

Multiplierless reconfigurable processing element for mixed radix-2/3/4/5 FFTs.
Proceedings of the 2017 IEEE International Workshop on Signal Processing Systems, 2017

Multiplierless unified architecture for mixed radix-2/3/4 FFTs.
Proceedings of the 25th European Signal Processing Conference, 2017

Twiddle factor complexity analysis of Radix-2 FFT algorithms for pipelined architectures.
Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2016
Multiplierless Unity-Gain SDF FFTs.
IEEE Trans. Very Large Scale Integr. Syst., 2016

New Identical Radix-2^k Fast Fourier Transform Algorithms.
Proceedings of the 2016 IEEE International Workshop on Signal Processing Systems, 2016

Hardware-Efficient Twiddle Factor Generator for Mixed Radix-2/3/4/5 FFTs.
Proceedings of the 2016 IEEE International Workshop on Signal Processing Systems, 2016

2014
Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI).
IEEE Trans. Circuits Syst. I Regul. Pap., 2014

Efficient FPGA-mapping of 1024 point FFT Pipeline SDF Processor.
Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

2012
Optimization of Rotations in FFTs.
PhD thesis, 2012

2011
Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

On the efficient computation of single-bit input word length pipelined FFTs.
IEICE Electron. Express, 2011

Generation of all radix-2 fast Fourier transform algorithms using binary trees.
Proceedings of the 20th European Conference on Circuit Theory and Design, 2011

2010
Addition Aware Quantization for Low Complexity and High Precision Constant Multiplication.
IEEE Signal Process. Lett., 2010

Twiddle factor memory switching activity analysis of radix-2<sup>2</sup> and equivalent FFT algorithms.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2010), May 30, 2010

Alternatives for low-complexity complex rotators.
Proceedings of the 17th IEEE International Conference on Electronics, 2010

2009
Low-complexity Reconfigurable Complex Constant Multiplication for FFTs.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009


  Loading...