#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2009

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Fahad Qureshi, Oscar Gustafsson
- ISCAS
- 2009

In this letter, a unified hardware architecture that can be reconfigured to calculate 2, 3, 4, 5, or 7-point DFTs is presented. The architecture is based on the Winograd Fourier transform algorithm (WFTA) and the complexity is equal to a 7-point DFT in terms of adders/subtracters and multipliers plus only seven multiplexers introduced to enable… (More)

In this paper, we propose higher point FFT (fast Fourier transform) algorithms for a single delay feedback pipelined FFT architecture considering the 4096-point FFT. These algorithms are different from each other in terms of twiddle factor multiplication. Twiddle factor multiplication complexity comparison is presented when implemented on FieldProgrammable… (More)

- Oscar Gustafsson, Fahad Qureshi
- IEEE Signal Processing Letters
- 2010

Multiplication by constants can be efficiently realized using shifts, additions, and subtractions. In this work we consider how to select a fixed-point value for a real valued, rational, or floating-point coefficient to obtain a low-complexity realization. It is shown that the process, denoted addition aware quantization, often can determine coefficients… (More)

- Fahad Qureshi, Oscar Gustafsson
- 2011 20th European Conference on Circuit Theory…
- 2011

In this work a systematic method to generate all possible fast Fourier transform (FFT) algorithms is proposed based on the relation to binary trees. The binary tree is used to represent the decomposition of a discrete Fourier transform (DFT) into sub-DFTs. The radix is adaptively changed according to compute sub-DFTs in proposed decomposition. In this work… (More)

- Mario Garrido, Fahad Qureshi, Oscar Gustafsson
- IEEE Trans. on Circuits and Systems
- 2014

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… (More)

- Fahad Qureshi, Oscar Gustafsson
- IEICE Transactions
- 2011

SUMMARY In this work we consider optimized twiddle factor multipliers based on shift-and-add-multiplication. We propose a low-complexity structure for twiddle factors with a resolution of 32 points. Furthermore, we propose a slightly modified version of a previously reported multiplier for a resolution of 16 points with lower round-off noise. For… (More)

- Mario Garrido, Rikard Andersson, Fahad Qureshi, Oscar Gustafsson
- IEEE Trans. VLSI Syst.
- 2016

In this paper we propose a novel approach to implement multiplierless unity-gain SDF FFTs. Previous methods achieve unity-gain FFTs by using either complex multipliers or non-unity-gain rotators with additional scaling compensation. Conversely, this paper proposes unity-gain FFTs without compensation circuits, even when using non-unity-gain rotators. This… (More)

- Fahad Qureshi, Oscar Gustafsson
- ISCAS
- 2010

In this paper, we propose equivalent radix-2 algorithms and evaluate them based on twiddle factor switching activity for a single delay feedback pipelined FFT architecture. These equivalent pipeline FFT algorithms have the same number of complex multipliers with the same resolution as the radix2. It is shown that the twiddle factor switching activity of the… (More)

- Fahad Qureshi
- 2012