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

M. Orsic

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

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

Systems, architecture and hardware · 1Theory 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.

Theoretical computer science
1 paper
Information theory · 77% Automata and formal languages · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 77% Hardware reliability and fault tolerance · 12% Integrated circuit design · 12%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.011974
Channel capacity of a finite-state linear automation (Corresp.) · IEEE Trans. Inf. Theory 1974
Information theory › channel capacity › state-dependent channel
finite-state channel
0.011974
Channel capacity of a finite-state linear automation (Corresp.) · IEEE Trans. Inf. Theory 1974
Electronic design automation › hardware verification and test
fault diagnosis
0.011970
Fault Diagnosis and Repair of Cutpoint Cellular Arrays · IEEE Trans. Computers 1970
Electronic design automation
hardware test
0.011970
Fault Diagnosis and Repair of Cutpoint Cellular Arrays · IEEE Trans. Computers 1970
Automata and formal languages
finite automata
0.011974
Channel capacity of a finite-state linear automation (Corresp.) · IEEE Trans. Inf. Theory 1974
Automata and formal languages › finite automata › sequential machines
linear automata
0.011974
Channel capacity of a finite-state linear automation (Corresp.) · IEEE Trans. Inf. Theory 1974
Integrated circuit design › VLSI design
cellular array
0.011970
Fault Diagnosis and Repair of Cutpoint Cellular Arrays · IEEE Trans. Computers 1970
Hardware reliability and fault tolerance › memory reliability
fault repair
0.011970
Fault Diagnosis and Repair of Cutpoint Cellular Arrays · IEEE Trans. Computers 1970

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

shannon capacity theorem · 0.0fault-diagnosis procedure · 0.0array repair · 0.0
YearPublicationVenuePosition
1974 Channel capacity of a finite-state linear automation (Corresp.)
abstract
A finite-state deterministic linear automaton is viewed as a communication channel from a source to a receiver, accepting source symbols as inputs and generating outputs for a receiver. The automaton is assumed to be composed of two subautomata, one representing the next-state function and one the output function. With the use of Shannon's theorem for capacities of discrete channels, it is demonstrated that the channel capacities of the linear automaton and its subautomata can be readily determined by an analytical procedure rather than by applying an iterative algorithm as required for general finite-state automata.
E. M. Rounds, M. Orsic
IEEE Trans. Inf. Theory2
1970 Fault Diagnosis and Repair of Cutpoint Cellular Arrays
abstract
A systematic fault-diagnosis procedure to locate all the faulty main-array columns and faulty rotated-array rows is presented. A simple method for repairing a cutpoint cellular array when the rotated array is not limited to being used as a collector array is given.
Stephen S. Yau, M. Orsic
IEEE Trans. Computers2