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

Javad Khakbaz

dblp:89/6756 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1984
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 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
3 papers
Electronic design automation · 65% Hardware reliability and fault tolerance · 35%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.031984
Self-Testing Embedded Parity Checkers · IEEE Trans. Computers 1984
A Testable PLA Design with Low Overhead and High Fault Coverage · IEEE Trans. Computers 1984
Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail Codes · IEEE Trans. Computers 1982
Electronic design automation › hardware verification and test › design for testability
built-in self-test
0.021984
Self-Testing Embedded Parity Checkers · IEEE Trans. Computers 1984
Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail Codes · IEEE Trans. Computers 1982
Hardware reliability and fault tolerance
self-checking circuits
0.021984
Self-Testing Embedded Parity Checkers · IEEE Trans. Computers 1984
Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail Codes · IEEE Trans. Computers 1982
Electronic design automation › hardware verification and test
fault coverage
0.011984
A Testable PLA Design with Low Overhead and High Fault Coverage · IEEE Trans. Computers 1984
Hardware reliability and fault tolerance › error detection
parity checking
0.011984
Self-Testing Embedded Parity Checkers · IEEE Trans. Computers 1984
Electronic design automation › hardware test
testable PLA design
0.011984
A Testable PLA Design with Low Overhead and High Fault Coverage · IEEE Trans. Computers 1984
Hardware reliability and fault tolerance › self-checking circuits
totally self-checking checker
0.011982
Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail Codes · IEEE Trans. Computers 1982

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

even-parity checker design · 0.0design-for-testability · 0.0two-rail code · 0.01-out-of-n code · 0.0
YearPublicationVenuePosition
1984 A Testable PLA Design with Low Overhead and High Fault Coverage
abstract
A new design of testable PLA's is presented. This design has the following characteristics: it requires little extra hardware; it has very little, if any, impact on the speed of the PLA in normal operation; it has very high fault coverage (all single and multiple stuck-at faults, crosspoint faults, and all combinations thereof are detected); and it can be used for designing testable folded PLA's. This design, however, is not appropriate for built-in test.
Javad Khakbaz
IEEE Trans. Computers1
1984 Self-Testing Embedded Parity Checkers
abstract
It is shown that if a 4-by-n binary matrix has four distinct even-parity rows such that each column has exactly two 0's and two 1's, then there exists a totally self-checking even-parity checker that is tested by the four rows of this matrix. The utility of this result in designing self-testing embedded parity checkers is described.
Javad Khakbaz, Edward J. McCluskey
IEEE Trans. Computers1
1982 Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail Codes
abstract
A new design for a totally self-checking 1-out-of-n checker is presented. A comparison with other existing methods [1], [10] is given. It is shown that for many practical values of n the new scheme requires less hardware and/or is faster than the other methods. The entire checker can be tested by applying all of the n possible 1-out-of-n inputs.
Javad Khakbaz
IEEE Trans. Computers1