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

Avinash Sathaye

dblp:18/1624 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 2

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 · 75% Emerging computing paradigms · 25%
Theoretical computer science
1 paper
Coding theory · 50% Mathematical optimization · 50%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms
cellular automata
0.011993
Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation
hardware verification and test
0.011993
Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › hardware verification and test › test generation
pseudoexhaustive testing
0.011993
Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › hardware verification and test
test generation
0.011993
Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Mathematical optimization
characteristic polynomial
0.011993
Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Coding theory
linear feedback shift register
0.011993
Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993

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

linear feedback shift register · 0.0cellular automata · 0.0
YearPublicationVenuePosition
1995 Multiple error detection and identification via signature analysis
T. Raju Damarla, Charles E. Stroud, Avinash Sathaye
J. Electron. Test.3
1993 Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing
abstract
Recent studies have shown that cellular automata (CA) can be used in place of linear feedback shift registers (LFSRs). Due to their regular structure and local feedback connections, VLSI layout of CA is easy and results in saving silicon area. Some properties of CAs derived using Rules 90 and 150 in terms of characteristic polynomials are presented. In particular, (a) computation of characteristic polynomials in CA, (b) computation of sequence lengths generated by various CA/LFSRs, and (c) pseudo-exhaustive testing by sequences generated by CA/LFSRs are accomplished.>
Thyagaraju R. Damarla, Avinash Sathaye
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2