|
Search the dblp DataBase
Saad Bouguezel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
An efficient split-radix FFT algorithm. [Citation Graph (0, 0)][DBLP] ISCAS (4), 2003, pp:65-68 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
A split-radix algorithm for 2-D DFT. [Citation Graph (0, 0)][DBLP] ISCAS (3), 2003, pp:698-701 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
Efficient pruning algorithms for the DFT computation for a subset of output samples. [Citation Graph (0, 0)][DBLP] ISCAS (4), 2003, pp:97-100 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
Efficient output-pruning of the 2-D FFT algorithm. [Citation Graph (0, 0)][DBLP] ISCAS (3), 2004, pp:285-288 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
Improved radix-4 and radix-8 FFT algorithms. [Citation Graph (0, 0)][DBLP] ISCAS (3), 2004, pp:561-564 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
An efficient split-radix FHT algorithm. [Citation Graph (0, 0)][DBLP] ISCAS (3), 2004, pp:565-568 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
An approach for computing the radix-2/4 DIT FHT and FFT algorithms using a unified structure. [Citation Graph (0, 0)][DBLP] ISCAS (1), 2005, pp:836-839 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
An efficient multidimensional decimation-in-frequency FHT algorithm based on the radix-2/4 approach. [Citation Graph (0, 0)][DBLP] ISCAS (3), 2005, pp:2405-2408 [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
An efficient algorithm for the computation of the reverse jacket transform. [Citation Graph (0, 0)][DBLP] ISCAS, 2006, pp:- [Conf]
- Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy
Design of a multidimensional split vector-radix decimation-in-frequency FFT algorithm. [Citation Graph (0, 0)][DBLP] ISCAS, 2006, pp:- [Conf]
A new blind-block reciprocal parametric transform. [Citation Graph (, )][DBLP]
An Alternate Approach for Developing Higher Radix FFT Algorithms. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|