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

Mohamed Soufi

dblp:03/4820 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1996
—ORCID · none

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

Systems, architecture and hardware · 4 · 4 first-author

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
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 › design for testability
built-in self-test
0.011995
Producing Reliable Initialization and Test of Sequential Circuits with Pseudorandom Vectors · IEEE Trans. Computers 1995
Electronic design automation
hardware verification and test
0.011995
Producing Reliable Initialization and Test of Sequential Circuits with Pseudorandom Vectors · IEEE Trans. Computers 1995
Electronic design automation › hardware verification and test › random testing
pseudorandom testing
0.011995
Producing Reliable Initialization and Test of Sequential Circuits with Pseudorandom Vectors · IEEE Trans. Computers 1995
Electronic design automation › hardware verification and test
sequential circuit testing
0.011995
Producing Reliable Initialization and Test of Sequential Circuits with Pseudorandom Vectors · IEEE Trans. Computers 1995
Electronic design automation › hardware verification and test
test generation
0.011995
Producing Reliable Initialization and Test of Sequential Circuits with Pseudorandom Vectors · IEEE Trans. Computers 1995

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

markov chain model · 0.0
YearPublicationVenuePosition
1996 Design and performance of CMOS TSPC cells for high speed pseudo random testing
abstract
In this paper the problem of testing high speed CMOS circuits is considered. A test methodology based on a Built-in Self-Test scheme adapted to TSPC circuits is proposed. We show through HSpice simulations on netlists extracted from layout that this scheme can operate at more than 580 MHz. Moreover, an efficient solution to the problem of redesigning an easily testable functionally equivalent logic block to eliminate hard to test and untestable faults in TSPC circuits is introduced.
Mohamed Soufi, Steve Rochon, Yvon Savaria, Bozena Kaminska
VTS1
1995 On Using Partial Reset for Pseudo-Random Testing
abstract
An inexpensive Design For Testability (DFT) technique, called Partial Reset (PR), was recently proposed to ease automatic test pattern generation of sequential circuits. In the present paper, we propose a new PR-like method. With this method, flip-flops to be reset are selected in order to ease pseudo-random testing of sequential circuits. Moreover, the control of these reset are condensed on a reduced set of input lines. Therefore, only a small number of additional primary inputs are required. This technique has been evaluated on a large subset of the 1989 ISCAS sequential benchmark circuits and promising results were obtained.
Mohamed Soufi, Yvon Savaria, Bozena Kaminska
ISCAS1
1995 On the design of at-speed testable VLSI circuits
abstract
In this paper, a new design-for-testability technique for sequential circuits is presented. This technique may be considered as an alternative to full scan. The fault coverages obtained with this technique are comparable to those produced by full scan techniques. However, the present method improves full scan in several ways. The application test time of a device is reduced to that of applying parallel vectors at the operational speed. This characteristic of applying test vectors at the operational speed has a positive impact on the test quality. Indeed, a stuck-at test, applied at the operational speed of the circuit, identifies more defective chips than the same test applied at a lower speed. Furthermore, the timing and the area overheads, which are often considered to be serious disadvantages of DFT techniques, are in this case acceptable. With this method, all FFs are replaced with XFF gates. The XFF gate is similar to a T flip-flop without feedback. However, in some cases, when observability problems are still important, a probe observation point is inserted at the pseudo-primary inputs (PPIs).
Mohamed Soufi, Yvon Savaria, Bozena Kaminska
VTS1
1995 Producing Reliable Initialization and Test of Sequential Circuits with Pseudorandom Vectors
abstract
In this paper, the initialization of sequential circuits using pseudorandom input patterns is addressed. An extended Markov chain model that covers the initialization phase is proposed. This model supports the theoretical framework used to demonstrate that sequential circuits can be initialized with pseudorandom vectors. This leads to a uniform BIST approach in which initialization and testing are performed together with a single pseudorandom generator.>
Mohamed Soufi, Yvon Savaria, F. Darlay, Bozena Kaminska
IEEE Trans. Computers1