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

Rainer Amann

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

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

Systems, architecture and hardware · 2 · 2 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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
finite state machine synthesis
0.011989
Optimal state chains and state codes in finite state machines · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Electronic design automation
logic synthesis
0.011989
Optimal state chains and state codes in finite state machines · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Electronic design automation › logic synthesis
state assignment
0.011989
Optimal state chains and state codes in finite state machines · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989

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

state-chain calculation · 0.0counter-based PLA structure · 0.0
YearPublicationVenuePosition
1989 Optimal state chains and state codes in finite state machines
abstract
A method is presented for the synthesis of optimal regular digital control structures in VLSI circuits. The controllers are modeled as finite-state machines and implemented using counter-based programmable-logic-array structures. Although those structures have already been used in the past, their complete automated design was impossible, due to missing state-assignment algorithms. The state-assignment algorithms presented to close this gap optimize the required silicon area of the controllers. They are divided into two steps: state-chain calculation and state-chain coding. In state-chain calculation the internal states of a finite-state machine are ordered to maximally exploit the counter characteristics. In state-chain coding the internal states are coded so that the state sequences are maintained, while coding constraints are satisfied that permit a further minimization of the circuit.>
Rainer Amann, Utz G. Baitinger
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1988 PLA based finite state machines using Johnson counters as state memories
abstract
The authors present a novel state assignment technique for synchronous finite state machines (FSMs) that are implemented as single programmable logic arrays (PLAs) using Johnson counters as state memories. The goal is to minimize the number of product terms in the PLAs and thus the overall area of the FSMs. The authors use a three-step approach to achieve this. First, the FSM description is adapted to allow an optimal use of the computer properties; then the counter is embedded by ordering the internal states of the FSM; and finally the states are coded. The product term reductions obtained are, on the average 20% to 30% compared to conventional D-latch-based FSM implementations.>
Rainer Amann, Bernhard Eschermann, Utz G. Baitinger
ICCD1