Fahad Qureshi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Fahad Qureshi has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Oscar Gustafsson
Department of Electrical Engineering, Linköping University, Linköping, Sweden
9 shared publications - Jarmo Takala
Faculty of Information Technology and Communication Science, Tampere University, Tampere, Finland
7 shared publications Mario Garrido
Linköping University
2 shared publications- Anastasia Volkova
Sorbonne Universités, UPMC Univ Paris 06, UMR 7606, LIP6, F-75005, Paris, France
1 shared publication - Carl Ingemarsson
Linköping University
1 shared publication Izzet Kale
Applied DSP and VLSI Research Group University of Westminster
1 shared publication
Latest Publications
- Open Access
- 14 October 2018
- Published by Springer Nature
- p. 613-647
Hardware architectures for the fast Fourier transform
- 14 October 2018
- Published by Springer Nature
- p. 613-647
Open AccessHardware architectures for the fast Fourier transform
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1034-1037
Twiddle factor complexity analysis of Radix-2 FFT algorithms for pipelined architectures
This paper presents analysis of fast Fourier transform (FFT) algorithms for pipelined architectures that can be generated by using binary tree representation. Those algorithms have different twiddle factors, however the butterfly operations remain same. Twiddle factor can be implemented by different techniques, which has different hardware cost. This analysis is based on twiddle factors hardware cost of each FFT algorithm. In results, we have shown the trade-off between the hardware components of twiddle factor for selected FFT algorithms.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1034-1037
Twiddle factor complexity analysis of Radix-2 FFT algorithms for pipelined architectures
This paper presents analysis of fast Fourier transform (FFT) algorithms for pipelined architectures that can be generated by using binary tree representation. Those algorithms have different twiddle factors, however the butterfly operations remain same. Twiddle factor can be implemented by different techniques, which has different hardware cost. This analysis is based on twiddle factors hardware cost of each FFT algorithm. In results, we have shown the trade-off between the hardware components of twiddle factor for selected FFT algorithms.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Multiplierless reconfigurable processing element for mixed radix-2/3/4/5 FFTs
This paper presents area-efficient building blocks for computing fast Fourier transform (FFT): multiplierless processing elements to be used for computing of radix-3 and radix-5 butterflies and reconfigurable processing element supporting mixed radix-2/3/4/5 FFT algorithms. The proposed processing elements are based on Wingorad Fourier transform algorithm. However, multiplication is performed by constant multiplier instead of a general complex-valued multiplier. The proposed process elements have potential use in both pipelined and memory based FFT architectures, where the non-power-of-two sizes are required. The results show that the proposed multiplierless processing elements reduce the significant hardware cost in terms of adders.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Multiplierless reconfigurable processing element for mixed radix-2/3/4/5 FFTs
This paper presents area-efficient building blocks for computing fast Fourier transform (FFT): multiplierless processing elements to be used for computing of radix-3 and radix-5 butterflies and reconfigurable processing element supporting mixed radix-2/3/4/5 FFT algorithms. The proposed processing elements are based on Wingorad Fourier transform algorithm. However, multiplication is performed by constant multiplier instead of a general complex-valued multiplier. The proposed process elements have potential use in both pipelined and memory based FFT architectures, where the non-power-of-two sizes are required. The results show that the proposed multiplierless processing elements reduce the significant hardware cost in terms of adders.
- Open Access
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1334-1338
Multiplierless unified architecture for mixed radix-2/3/4 FFTs
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1334-1338
Open AccessMultiplierless unified architecture for mixed radix-2/3/4 FFTs
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 25 (9) , 2486-2497
Efficient FPGA Mapping of Pipeline SDF FFT Cores
In this paper, an efficient mapping of the pipeline single-path delay feedback (SDF) fast Fourier transform (FFT) architecture to field-programmable gate arrays (FPGAs) is proposed. By considering the architectural features of the target FPGA, significantly better implementation results are obtained. This is illustrated by mapping an R2 2 SDF 1024-point FFT core toward both Xilinx Virtex-4 and Virtex-6 devices. The optimized FPGA mapping is explored in detail. Algorithmic transformations that allow a better mapping are proposed, resulting in implementation achievements that by far outperforms earlier published work. For Virtex-4, the results show a 350% increase in throughput per slice and 25% reduction in block RAM (BRAM) use, with the same amount of DSP48 resources, compared with the best earlier published result. The resulting Virtex-6 design sees even larger increases in throughput per slice compared with Xilinx FFT IP core, using half as many DSP48E1 blocks and less BRAM resources. The results clearly show that the FPGA mapping is crucial, not only the architecture and algorithm choices.
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 25 (9) , 2486-2497
Efficient FPGA Mapping of Pipeline SDF FFT Cores
In this paper, an efficient mapping of the pipeline single-path delay feedback (SDF) fast Fourier transform (FFT) architecture to field-programmable gate arrays (FPGAs) is proposed. By considering the architectural features of the target FPGA, significantly better implementation results are obtained. This is illustrated by mapping an R2 2 SDF 1024-point FFT core toward both Xilinx Virtex-4 and Virtex-6 devices. The optimized FPGA mapping is explored in detail. Algorithmic transformations that allow a better mapping are proposed, resulting in implementation achievements that by far outperforms earlier published work. For Virtex-4, the results show a 350% increase in throughput per slice and 25% reduction in block RAM (BRAM) use, with the same amount of DSP48 resources, compared with the best earlier published result. The resulting Virtex-6 design sees even larger increases in throughput per slice compared with Xilinx FFT IP core, using half as many DSP48E1 blocks and less BRAM resources. The results clearly show that the FPGA mapping is crucial, not only the architecture and algorithm choices.
- 12 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 195-200
New Identical Radix-2^k Fast Fourier Transform Algorithms
The radix-2k fast Fourier transform (FFT) algorithm is used to achieve at the same time both a radix-2 butterfly and a reduced number of twiddle factor multiplication. In this paper we present a new identical radix-2^k FFT algorithms, which has same number of butterfly and twiddle factor multiplication. The difference is only in twiddle factor stage location in signal flow graph (SFG). Further, analyze these algorithms and is shown that the round-off noise of identical radix-22, radix-23, and radix-24 FFT algorithms at output is reduced 27%, 8%, 3% respectively.
- 12 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 195-200
New Identical Radix-2^k Fast Fourier Transform Algorithms
The radix-2k fast Fourier transform (FFT) algorithm is used to achieve at the same time both a radix-2 butterfly and a reduced number of twiddle factor multiplication. In this paper we present a new identical radix-2^k FFT algorithms, which has same number of butterfly and twiddle factor multiplication. The difference is only in twiddle factor stage location in signal flow graph (SFG). Further, analyze these algorithms and is shown that the round-off noise of identical radix-22, radix-23, and radix-24 FFT algorithms at output is reduced 27%, 8%, 3% respectively.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 201-206
Hardware-Efficient Twiddle Factor Generator for Mixed Radix-2/3/4/5 FFTs
Twiddle factors are an integral part of FFT computations. Conventionally, they are either computed in run-time, hence increasing computational complexity, or pre-calculated and stored in RAM memory, which requires large memory footprint and increases power consumption. We created a systematic approach for designing digital circuits that generate twiddle factors based on reduced ROM tables. The approach supports radix-2, radix-3, radix-4, radix-5, and mixed radix-2/3/4/5 algorithms and several transform lengths. Number of complex twiddle factors stored in the memory equals only [Nmax/8] + 1 for transform lengths up to Nmax.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 201-206
Hardware-Efficient Twiddle Factor Generator for Mixed Radix-2/3/4/5 FFTs
Twiddle factors are an integral part of FFT computations. Conventionally, they are either computed in run-time, hence increasing computational complexity, or pre-calculated and stored in RAM memory, which requires large memory footprint and increases power consumption. We created a systematic approach for designing digital circuits that generate twiddle factors based on reduced ROM tables. The approach supports radix-2, radix-3, radix-4, radix-5, and mixed radix-2/3/4/5 algorithms and several transform lengths. Number of complex twiddle factors stored in the memory equals only [Nmax/8] + 1 for transform lengths up to Nmax.
- 1 April 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 24 (9) , 3003-3007
Multiplierless Unity-Gain SDF FFTs
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 using either complex multipliers or nonunity-gain rotators with additional scaling compensation. Conversely, this brief proposes unity-gain FFTs without compensation circuits, even when using nonunity-gain rotators. This is achieved by a joint design of rotators, so that the entire FFT is scaled by a power of two, which is then shifted to unity. This reduces the amount of hardware resources of the FFT architecture, while having high accuracy in the calculations. The proposed approach can be applied to any FFT size, and various designs for different FFT sizes are presented.
- 1 April 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 24 (9) , 3003-3007
Multiplierless Unity-Gain SDF FFTs
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 using either complex multipliers or nonunity-gain rotators with additional scaling compensation. Conversely, this brief proposes unity-gain FFTs without compensation circuits, even when using nonunity-gain rotators. This is achieved by a joint design of rotators, so that the entire FFT is scaled by a power of two, which is then shifted to unity. This reduces the amount of hardware resources of the FFT architecture, while having high accuracy in the calculations. The proposed approach can be applied to any FFT size, and various designs for different FFT sizes are presented.
- 4 March 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 61 (7) , 2002-2012
Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)
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 (CCSSI) for the design of the rotators. First, complete freedom is given to the selection of the coefficients, i.e., no constraints to the coefficients are set in advance and all the alternatives are taken into account. Second, the shift-and-add implementation uses advanced single constant multiplication (SCM) and multiple constant multiplication (MCM) techniques that lead to low-complexity multiplierless implementations. Third, the design of the rotators is done by a joint optimization of the coefficient selection and shift-and-add implementation. As a result, the CCSSI provides an extended design space that offers a larger number of alternatives with respect to previous works. Furthermore, the design space is explored in a simple and efficient way. The proposed approach has wide applications in numerous hardware scenarios. This includes rotations by single or multiple angles, rotators in single or multiple branches, and different scaling of the outputs. Experimental results for various scenarios are provided. In all of them, the proposed approach achieves significant improvements with respect to state of the art.
- 4 March 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 61 (7) , 2002-2012
Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)
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 (CCSSI) for the design of the rotators. First, complete freedom is given to the selection of the coefficients, i.e., no constraints to the coefficients are set in advance and all the alternatives are taken into account. Second, the shift-and-add implementation uses advanced single constant multiplication (SCM) and multiple constant multiplication (MCM) techniques that lead to low-complexity multiplierless implementations. Third, the design of the rotators is done by a joint optimization of the coefficient selection and shift-and-add implementation. As a result, the CCSSI provides an extended design space that offers a larger number of alternatives with respect to previous works. Furthermore, the design space is explored in a simple and efficient way. The proposed approach has wide applications in numerous hardware scenarios. This includes rotations by single or multiple angles, rotators in single or multiple branches, and different scaling of the outputs. Experimental results for various scenarios are provided. In all of them, the proposed approach achieves significant improvements with respect to state of the art.