Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amin M. Nassar

dblp:40/4452 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 44% Parallel and multicore computing · 22% Hardware accelerators and domain-specific architectures · 22%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
array processor
0.112011
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm · IEEE Trans. Parallel Distributed Syst. 2011
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.112011
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm · IEEE Trans. Parallel Distributed Syst. 2011
Integrated circuit design › digital circuit design › arithmetic circuit design
modular multiplication
0.112011
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm · IEEE Trans. Parallel Distributed Syst. 2011
Integrated circuit design › digital circuit design › arithmetic circuit design › modular multiplication
montgomery multiplication
0.112011
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm · IEEE Trans. Parallel Distributed Syst. 2011
Energy-efficient computing › dynamic power reduction
glitch reduction
0.012011
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm · IEEE Trans. Parallel Distributed Syst. 2011
Energy-efficient computing
low-power design
0.012011
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm · IEEE Trans. Parallel Distributed Syst. 2011

Methods — techniques the papers use, named apart from their topics

data dependence graph · 0.1affine scheduling · 0.1
YearPublicationVenuePosition
2021 Design Optimization of Multi-Input Reconfigurable Capacitive DC-DC Converters: A CAD Tool Approach
abstract
Energy harvesting from multiple sources is a more robust method for powering Internet of Things (IoT) nodes and similar wireless systems compared to harvesting from a single source. This work provides a description of an optimization CAD tool for reconfigurable capacitive DC-DC converters with multiple inputs used for energy-harvesting from multiple sources with varying levels of input power. The tool estimates the theoretical maximum efficiency for each converter configuration, along with the input power condition that achieves this performance. In addition, for given values of the available power from the harvesting sources connected to the DC-DC converter inputs, the proposed CAD tool finds the best converter configuration for that power state of the harvesters.
Abdelrahman Elabany, Amin M. Nassar, Hassan Mostafa
ISCAS2
2016 Quality metric-based fitness function for robust watermarking optimisation with Bees algorithm
abstract
The design of a robust watermarking technique has been always suffering from the conflict between the watermark robustness and the quality of the watermarked image. In this study, the embedding strength parameters for per‐block image watermarking in the discrete cosine transform (DCT) domain are optimised. A fitness function is proposed to best suit the optimisation problem. The optimum solution is selected based on the quality and the robustness achieved using that solution. For a given image block, the peak‐signal‐to‐noise ratio (PSNR) is used as a quality metric to measure the imperceptibility for the watermarked block. However, the robustness cannot be measured for a single watermark bit using traditional metrics. The proposed method uses the PSNR quality metric to indicate the degree of robustness. Hence, optimum embedding in terms of quality and robustness can be achieved. To demonstrate the effectiveness of the proposed approach, a recent watermarking technique is modified, and then used as the embedding method to be optimised. The Bees algorithm is selected as the optimisation method and the proposed fitness function is applied. Experimental results show that the proposed method provides enhanced imperceptibility and robustness under different attacks.
Assem M. Abdelhakim, Hassan Ibrahim Saleh, Amin M. Nassar
IET Image Process.3
2011 Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm
abstract
This paper presents a systematic methodology for exploring possible processor arrays of scalable radix 4 modular Montgomery multiplication algorithm. In this methodology, the algorithm is first expressed as a regular iterative expression, then the algorithm data dependence graph and a suitable affine scheduling function are obtained. Four possible processor arrays are obtained and analyzed in terms of speed, area, and power consumption. To reduce power consumption, we applied low power techniques for reducing the glitches and the Expected Switching Activity (ESA) of high fan-out signals in our processor array architectures. The resulting processor arrays are compared to other efficient ones in terms of area, speed, and power consumption.
Atef Ibrahim, Fayez Gebali, Hamed Elsimary, Amin M. Nassar
IEEE Trans. Parallel Distributed Syst.4
2004 LMPS: Localized Multi-path Selection for QoS Routing in VoIP Networks
Khaled M. F. Elsayed, Hassan Fadel, Amin M. Nassar
NETWORKING3
1999 End points detection for noisy speech using a wavelet based algorithm
Amin M. Nassar, Nemat S. Abdel Kader, Amr M. Refat
EUROSPEECH1