![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
M. K. Ibrahim
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2007
- [j11]Abdurazzag Sulaiman Almiladi, M. K. Ibrahim, M. Al Akidi, Amar Aggoun
:
High-performance scalable bidirectional mixed radix-2 n serial-serial multipliers. IET Comput. Digit. Tech. 1(5): 632-639 (2007) - 1998
- [j10]Amar Aggoun
, M. K. Ibrahim, Ahmed S. Ashur:
Design methodology for subdigit pipelined digit-serial IIR filters. Signal Process. 68(1): 73-86 (1998) - 1997
- [j9]M. C. Mekhallalati, Ahmed S. Ashur, M. K. Ibrahim:
Novel Radix Finite Field Multiplier for GF(2m). J. VLSI Signal Process. 15(3): 233-245 (1997) - 1996
- [j8]A. E. Bashagha, M. K. Ibrahim:
Nonrestoring Radix-2k Square rooting Algorithm. J. Circuits Syst. Comput. 6(3): 267-286 (1996) - [j7]M. C. Mekhallalati, Ahmed S. Ashur, M. K. Ibrahim:
Radix Modular Multiplication Algorithm. J. Circuits Syst. Comput. 6(5): 547-568 (1996) - 1995
- [j6]Ahmed S. Ashur, M. K. Ibrahim, Amar Aggoun
:
Novel RNS structures for the moduli set (2n - 1, 2n, 2n + 1) and their application to digital filter implementation. Signal Process. 46(3): 331-343 (1995) - 1994
- [j5]A. E. Bashagha, M. K. Ibrahim:
Digit-Serial Squaring Architecture. J. Circuits Syst. Comput. 4(1): 99-108 (1994) - [j4]M. K. Ibrahim:
Novel digital filter implementations using hybrid RNS-binary arithmetic. Signal Process. 40(2-3): 287-294 (1994) - 1987
- [j3]M. K. Ibrahim:
New high-resolution pseudospectrum estimation method. IEEE Trans. Acoust. Speech Signal Process. 35(7): 1071-1072 (1987) - [j2]M. K. Ibrahim:
Improvement in the speed of the data-adaptive weighted Burg technique. IEEE Trans. Acoust. Speech Signal Process. 35(10): 1474-1476 (1987) - [j1]M. K. Ibrahim:
On line splitting in the optimum tapered Burg algorithm. IEEE Trans. Acoust. Speech Signal Process. 35(10): 1476-1479 (1987)
Conference and Workshop Papers
- 2002
- [c5]Amar Aggoun, A. Farwan, M. K. Ibrahim:
A radix-2n vector inner product. ISCAS (3) 2002: 563-566 - 1999
- [c4]M. C. Mekhallalati, M. K. Ibrahim:
New high radix maximally-redundant signed digit adder. ISCAS (1) 1999: 459-462 - 1997
- [c3]B. Bramer, D. Chauham, M. K. Ibrahim, Amar Aggoun
:
Virtual radix array processors (V-RaAP). FPL 1997: 354-363 - [c2]B. K. Low, M. K. Ibrahim:
A Fast and Accurate Algorithm for Facial Feature Segmentation. ICIP (2) 1997: 518-521 - 1985
- [c1]M. K. Ibrahim, Costas E. Goutis:
Detection algorithms based on prediction error - additive noise - data orthogonality. ICASSP 1985: 644-647
Informal and Other Publications
- 2022
- [i1]F. K. Dankar, M. K. Ibrahim:
A new PCA-based utility measure for synthetic data evaluation. CoRR abs/2212.05595 (2022)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-13 01:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint