default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaad Bouguezel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j14]Laid Chergui
, Saad Bouguezel:
A New Post-whitening Transform Domain LMS Algorithm. Traitement du Signal 36(3): 245-252 (2019)- 2018
- [j13]Younes Terchi, Saad Bouguezel:
A blind audio watermarking technique based on a parametric quantization index modulation. Multim. Tools Appl. 77(19): 25681-25708 (2018) - 2017
- [j12]Laid Chergui, Saad Bouguezel:
A new pre-whitening transform domain LMS algorithm and its application to speech denoising. Signal Process. 130: 118-128 (2017) - 2013
- [j11]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
Binary Discrete Cosine and Hartley Transforms. IEEE Trans. Circuits Syst. I Regul. Pap. 60-I(4): 989-1002 (2013) - [c17]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A new involutory parametric transform and its application to image encryption. ISCAS 2013: 2605-2608 - 2012
- [j10]Saad Bouguezel:
A Reciprocal-Orthogonal Parametric Transform and Its Fast Algorithm. IEEE Signal Process. Lett. 19(11): 769-772 (2012) - 2011
- [j9]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation. IEEE Trans. Circuits Syst. I Regul. Pap. 58-I(3): 562-575 (2011) - [c16]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
An efficient algorithm for the conjugate symmetric sequency-ordered complex Hadamard transform. ISCAS 2011: 1516-1519 - [c15]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A low-complexity parametric transform for image compression. ISCAS 2011: 2145-2148 - 2010
- [c14]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
Image encryption using the reciprocal-orthogonal parametric transform. ISCAS 2010: 2542-2545
2000 – 2009
- 2009
- [j8]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A New Class of Reciprocal-Orthogonal Parametric Transforms. IEEE Trans. Circuits Syst. I Regul. Pap. 56-I(4): 795-805 (2009) - 2008
- [c13]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A new blind-block reciprocal parametric transform. ISCAS 2008: 3102-3105 - 2007
- [j7]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-2m. IEEE Trans. Signal Process. 55(8): 4127-4138 (2007) - 2006
- [j6]Saad Bouguezel, M. Omair Ahmad, M. N. Shanmukha Swamy:
New radix-(2×2×2)/(4×4×4) and radix-(2×2×2)/(8×8×8) DIF FFT algorithms for 3-D DFT. IEEE Trans. Circuits Syst. I Regul. Pap. 53-I(2): 306-315 (2006) - [j5]Saad Bouguezel, M. N. Shanmukha Swamy, M. Omair Ahmad:
Multidimensional vector radix FHT algorithms. IEEE Trans. Circuits Syst. I Regul. Pap. 53-I(4): 905-917 (2006) - [j4]Saad Bouguezel, M. Omair Ahmad, M. N. Shanmukha Swamy:
A Split Vector-Radix Algorithm for the 3-D Discrete Hartley Transform. IEEE Trans. Circuits Syst. I Regul. Pap. 53-I(9): 1966-1976 (2006) - [c12]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
An Alternate Approach for Developing Higher Radix FFT Algorithms. APCCAS 2006: 227-230 - [c11]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
An efficient algorithm for the computation of the reverse jacket transform. ISCAS 2006 - [c10]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
Design of a multidimensional split vector-radix decimation-in-frequency FFT algorithm. ISCAS 2006 - 2005
- [j3]Saad Bouguezel, M. Omair Ahmad, M. N. Shanmukha Swamy:
A note on "Split vector-radix-2/8 2-D Fast Fourier Transform". IEEE Signal Process. Lett. 12(3): 185 (2005) - [c9]Saad Bouguezel, M. Omair Ahmad, M. N. Shanmukha Swamy:
Arithmetic complexity of the split-radix FFT algorithms. ICASSP (5) 2005: 137-140 - [c8]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. ISCAS (1) 2005: 836-839 - [c7]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
An efficient multidimensional decimation-in-frequency FHT algorithm based on the radix-2/4 approach. ISCAS (3) 2005: 2405-2408 - 2004
- [j2]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A new radix-2/8 FFT algorithm for length-q×2m DFTs. IEEE Trans. Circuits Syst. I Regul. Pap. 51-I(9): 1723-1732 (2004) - [j1]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A new split-radix FHT algorithm for length-q*2mDHTs. IEEE Trans. Circuits Syst. I Regul. Pap. 51-I(10): 2031-2043 (2004) - [c6]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
Efficient output-pruning of the 2-D FFT algorithm. ISCAS (3) 2004: 285-288 - [c5]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
Improved radix-4 and radix-8 FFT algorithms. ISCAS (3) 2004: 561-564 - [c4]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
An efficient split-radix FHT algorithm. ISCAS (3) 2004: 565-568 - 2003
- [c3]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
An efficient split-radix FFT algorithm. ISCAS (4) 2003: 65-68 - [c2]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
Efficient pruning algorithms for the DFT computation for a subset of output samples. ISCAS (4) 2003: 97-100 - [c1]Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy:
A split-radix algorithm for 2-D DFT. ISCAS (3) 2003: 698-701
Coauthor Index
aka: M. N. Shanmukha Swamy
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-10 19:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
