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

Raymond R. Olson

dblp:178/6107 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1970
—ORCID · none

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

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

Theoretical computer science
1 paper
Automata and formal languages · 56% Coding theory · 44%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › convolutional codes
feedforward inverse
0.011970
Note on Feedforward Inverses for Linear Sequential Circuits · IEEE Trans. Computers 1970
Automata and formal languages › finite automata › sequential machines
linear sequential circuits
0.011970
Note on Feedforward Inverses for Linear Sequential Circuits · IEEE Trans. Computers 1970
Automata and formal languages › finite automata › sequential machines
sequential circuits
0.011970
Note on Feedforward Inverses for Linear Sequential Circuits · IEEE Trans. Computers 1970

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

existence proof · 0.0construction procedure · 0.0
YearPublicationVenuePosition
1970 Note on Feedforward Inverses for Linear Sequential Circuits
abstract
A necessary and sufficient condition for the existence of a feedforward inverse for a linear sequential circuit is presented. As a result of the proof of this existence condition, a procedure for construction of feedforward inverses, when they exist, is developed. It is shown that the delay of the inverse that is realized by the construction procedure is minimal over all inverse circuits. This work is a generalization and extension of certain results obtained by Massey and Sain concerning the existence of feedforward inverses of feedforward linear sequential circuits.
Raymond R. Olson
IEEE Trans. Computers1