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.

Aly E. Salama

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

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

Systems, architecture and hardware · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.021989
Microprocessors functional testing techniques · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Fault diagnosis of analog circuits · Proc. IEEE 1985
Electronic design automation › hardware verification and test
functional testing
0.011989
Microprocessors functional testing techniques · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Electronic design automation › hardware verification and test › VLSI testing
microprocessor testing
0.011989
Microprocessors functional testing techniques · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Electronic design automation › hardware verification and test › analog circuit testing
analog fault detection
0.011985
Fault diagnosis of analog circuits · Proc. IEEE 1985
Electronic design automation › hardware verification and test
testability analysis
0.011985
Fault diagnosis of analog circuits · Proc. IEEE 1985

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

instruction set reduction · 0.0probabilistic method · 0.0optimization-based diagnosis · 0.0fault simulation · 0.0artificial intelligence · 0.0
YearPublicationVenuePosition
2007 Increasing the Sense Margin of 1T-1C Ferroelectric Random-Access Memories
abstract
The sense margin available for sensing by the sense amplifier during the read access of 1T-1C FRAM cells affects the accuracy of the reading process. In this paper, a procedure for determining the sensing window of the 1T-1C FRAM cell will be discussed. Also, three proposed techniques for increasing the sense margin will be discussed.
Aly E. Salama, Sherif M. Sharroush, Mahmoud Y. Fekry
ISCAS1
2007 Design and Implementation of FPGA-based Systolic Array for LZ Data Compression
abstract
Hardware Implementation of Data compression algorithms is receiving increasing attention due to exponentially expanding network traffic and digital data storage usage. Among lossless data compression algorithms for hardware implementation, Lempel -Ziv algorithm is one of the most widely used. The main objective of this paper is to enhance the efficiency of systolic- array approach for implementation of Lempel- Ziv algorithm. The proposed implementation is area and speed efficient. The compression rate is increased by more than 40% and the design area is decreased by more than 30%. The effect of the selected buffer's size on the compression ratio is analyzed. An FPGA implementation of the proposed design is carried out. It verifies that data can be compressed and decompressed on-the-fly.
Mohamed Abdelghany, Aly E. Salama, Ahmed Hussein Khalil
ISCAS2
2000 Analog VLSI design of supervised-learnable neural cell using switched-current technique
abstract
This paper addresses the design of an analog very large-scale integration (VLSI) high accuracy neural cell with supervised learning ability using standard 2-/spl mu/m CMOS technology. A novel architecture is presented such that all cells, input, output, or hidden, have the same architecture which ensures a high degree of flexibility in terms of topology programming. Moreover, in designing the cell architecture, a new design technique based on hardware functionality multiplexing is employed. This technique resulted in a considerable compact cell. On the circuit level, the cell design is based mainly on a novel very high accuracy switched-current (SI) memory cell. With minor modifications, the SI memory cell is used in building all of the switched-current-based modules in the cell, which resulted in a high accuracy neural cell. The performance and timing for the separate modules and the whole cell are extensively studied. The cell is tested through a multi-layer perceptron network (MLP) using SPICE simulations to solve the digits-recognition problem.
Rany A. Tawfik, Aly H. Fahmy, Aly E. Salama
ISCAS3
1989 Microprocessors functional testing techniques
abstract
The authors address the functional testing of microprocessors. A method is introduced for obtaining a minimum set of instructions that replaces the whole instruction set during testing procedure. The method is illustrated on the digital signal processor TM32010.>
El-Sayed A. Talkhan, Aly M. H. Ahmed, Aly E. Salama
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
1985 Fault diagnosis of analog circuits
abstract
In this paper, various fault location techniques in analog networks are described and compared. The emphasis is on the more recent developments in the subject. Four main approaches for fault location are addressed, examined, and illustrated using simple network examples. In particular, we consider the fault dictionary approach, the parameter identification approach, the fault verification approach, and the approximation approach. Theory and algorithms that are associated with these approaches are reviewed and problems of their practical application are identified. Associated with the fault dictionary approach we consider fault dictionary construction techniques, methods of optimum measurement selection, different fault isolation criteria, and efficient fault simulation techniques. Parameter identification techniques that either utilize linear or nonlinear systems of equations to identify all network elements are examined very thoroughly. Under fault verification techniques we discuss node-fault diagnosis, branch-fault diagnosis, subnetwork testability conditions as well as combinatorial techniques, the failure bound technique, and the network decomposition technique. For the approximation approach we consider probabilistic methods and optimization-based methods. The artificial intelligence technique and the different measures of testability are also considered. The main features of the techniques considered are summarized in a comparative table. An extensive, but not exhaustive, bibliography is provided.
John W. Bandler, Aly E. Salama
Proc. IEEE2