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

Prawat Nagvajara

dblp:52/3046 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 1997
—ORCID · none

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

Systems, architecture and hardware · 6 · 4 first-authorTheory of computation · 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
Electronic design automation · 100%
Theoretical computer science
1 paper
Coding theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 6 heaviest of 6, 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.011990
Optimal Robust Compression of Test Responses · IEEE Trans. Computers 1990
Electronic design automation
hardware verification and test
0.011990
Optimal Robust Compression of Test Responses · IEEE Trans. Computers 1990
Electronic design automation › hardware verification and test
test response compaction
0.011990
Optimal Robust Compression of Test Responses · IEEE Trans. Computers 1990
Coding theory › error-correcting codes
error detection
0.011989
Optimal codes for minimax criterion on error detection · IEEE Trans. Inf. Theory 1989
Coding theory › error-correcting codes
nonlinear codes
0.011989
Optimal codes for minimax criterion on error detection · IEEE Trans. Inf. Theory 1989
Cryptographic primitives and cryptanalysis › boolean functions
bent functions
0.011989
Optimal codes for minimax criterion on error detection · IEEE Trans. Inf. Theory 1989

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

minimax optimization · 0.0
YearPublicationVenuePosition
1997 Multichip Module Diagnosis by Product-Code Signatures
Prawat Nagvajara, P. Nilagupta
J. Electron. Test.1
1992 Coset error detection in BIST design
abstract
A finite-field algebraic description of a built-in self-test (BIST) design based on primitive feedback shift registers (LFSRs) implementing the test generator and the signature analyzer (SA) is presented. That the BIST schemes that use the TG and the SA with the same feedback polynomial detect errors which distort the output functions of the circuits-under-test for a set of the input vectors forming a coset of a subspace. The authors term this type of error the 'single coset error'. Signature schemes which detect the coset errors of multiplicity r are further described, (r>
Prawat Nagvajara, Mark G. Karpovsky
VTS1
1991 Built-In Self-Diagnostic Read-Only-Memories
Prawat Nagvajara, Mark G. Karpovsky
ITC1
1991 Efficient test generation for built-in self-test boundary-scan template
abstract
An analysis and design of a pseudorandom pattern generator, (PRPG), based on a linear recurrence, for built-in self-test (BIST) boundary scan design is presented. The authors present for the case when r>or=s, a design of an s-stage PRPG capable of producing 2/sup s/-1 distinct r-bit patterns within 2/sup s/-1 clock pulses independent of the hardware realization of the PRPG. For the case when r>
Prawat Nagvajara, Mark G. Karpovsky, Lev B. Levitin
VTS1
1990 Optimal Robust Compression of Test Responses
abstract
A compression of test responses technique for a built-in self-test (BIST) VLSI design is presented. The authors introduce the notion of a robust compression technique which incorporates prior knowledge of the statistics of fault-free responses under pseudorandom testing to achieve a guaranteed error detectability independent of a distribution of errors. The presented robust quadratic compressor requires two r-bit registers (r-bit signature) more than a multiple-input linear feedback shift register; however, it provides for equal protection against all error patterns. Therefore, quadratic compressors are optimal and robust with respect to a statistics of errors in a device under test.>
Mark G. Karpovsky, Prawat Nagvajara
IEEE Trans. Computers2
1989 Optimal codes for minimax criterion on error detection
abstract
Nonlinear quadratic codes that are optimal for the minimax error detection are presented. Characteristic functions for these codes are asymptotically bent. For a given block size n and the number of codewords mod C mod , these codes minimize max Q(e), e not=0, where Q(e) is the conditional error-masking probability, given the error pattern e. The codewords are blocks of n symbols from GF(q). Encoding and decoding procedures for the codes are described.>
Mark G. Karpovsky, Prawat Nagvajara
IEEE Trans. Inf. Theory2
1988 Board-Level Diagnosis by Signature Analysis
abstract
Board-level diagnostic techniques by signature analysis based on single-error-correcting Hamming codes over GF(2/sup M/) (where M is the number of outputs per chip) are presented. Two techniques are considered: the space-time compressor technique for the case when responses from N chips on the board are wired to the compressor; and the time compressor technique for the case when test responses from each chip are transferred to the compressor via system bus. Assuming a single-faulty-chip model, a faulty chip on the board under test is located by an analysis of the relationship between the distortions in the obtained signatures. Both techniques for board-level diagnosis require less hardware than the straightforward diagnostic techniques using a built-in signature analyzer for every chip or selective testing of each chip via the system bus, hence offering an efficient approach for a design of a built-in-self-test board for for manufacturing testing.>
Mark G. Karpovsky, Prawat Nagvajara
ITC2