Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDG. M. Abdel-Raheem
Person information
- affiliation: University of Assiut, Egypt
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j11]Mamdouh F. Fahmy, G. M. A. El-Raheem:
A fast second-order signal separation algorithms with on-line capabilities. Int. J. Circuit Theory Appl. 30(4): 425-439 (2002)- 2000
- [j10]A. I. Saleh, Mamdouh F. Fahmy, G. M. A. El-Raheem, Gamal Fahmy:
On the design of two channel perfect construction QMF filters. Int. J. Circuit Theory Appl. 28(3): 209-224 (2000) - [j9]Mamdouh F. Fahmy, G. M. A. El-Raheem, A. A. El-Sallam:
Signal separation using second‐ and high‐order statistics. Int. J. Circuit Theory Appl. 28(3): 225-243 (2000) - 1998
- [j8]N. El-Gayed, G. M. Abdel-Raheem, Mamdouh F. Fahmy:
Iterative design of two-channel IIR perfect construction QMG filters. Int. J. Circuit Theory Appl. 26(5): 453-462 (1998) - 1997
- [j7]Mohammed Abo-Zahhad, G. M. A. El-Raheem, Mamdouh F. Fahmy:
Synthesis of IIR digital filters exhibiting simultaneous amplitude and phase responses for VLSI implementations. Int. J. Circuit Theory Appl. 25(1): 1-14 (1997) - 1995
- [j6]Mamdouh F. Fahmy, G. M. Abdel-Raheem, Mohammed Abo-Zahhad
:
Synthesis of fixed point limit-cycle-free digital filters with low roundoff noise. Int. J. Circuit Theory Appl. 23(3): 253-255 (1995) - [j5]Mamdouh F. Fahmy, G. M. Abdel-Raheem, H. M. Ibrahim:
A recursive least squares algorithm for an orthogonal iir adaptive line enhancer. Int. J. Circuit Theory Appl. 23(5): 501-514 (1995) - 1994
- [j4]Mamdouh F. Fahmy, Y. M. Yassin, G. M. Abdel-Raheem, Tarek I. Haweel:
Design of fixed point state space digital filters with low round-off noise. Int. J. Circuit Theory Appl. 22(1): 3-13 (1994) - [j3]Mamdouh F. Fahmy, Mohammed Abo-Zahhad, G. M. Abdel-Raheem:
Design of two-dimensional scaled state space filters with fixed point arithmetic. Int. J. Circuit Theory Appl. 22(6): 467-477 (1994) - [j2]Mamdouh F. Fahmy, Y. M. Yassin, G. M. Abdel-Raheem, N. El-Gayed:
Design of linear-phase IIR filters from FIR specifications. IEEE Trans. Signal Process. 42(2): 437-440 (1994) - 1991
- [j1]Mamdouh F. Fahmy, A. El-Wardaney, G. M. A. El-Raheem, A. Fattah:
Low-sensitivity SC realization of brune and C-type reactance sections. Int. J. Circuit Theory Appl. 19(5): 459-470 (1991)
Conference and Workshop Papers
- 2013
- [c4]Mamdouh F. Fahmy, G. M. Abdel-Raheem, U. S. Mohammed, Omar F. Fahmy:
A new total variation based image denoising and deblurring technique. EUROCON 2013: 1669-1675 - 2002
- [c3]Mamdouh F. Fahmy, G. M. A. El-Raheem:
The lifting theorem and the design of biorthognal filter banks. EUSIPCO 2002: 1-4 - 1999
- [c2]Mamdouh F. Fahmy, G. M. A. El-Raheem, A. A. El-Sallam:
Two rapidly convergent algorithms for signal separation. ISCAS (3) 1999: 13-16 - 1994
- [c1]Mamdouh F. Fahmy, G. M. Abdel-Raheem:
Synthesis of Fixed Point Low Roundoff Noise Digital Filters with no Limit Cycle. ISCAS 1994: 485-488
Coauthor Index
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-19 02:38 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:
