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

Osamu Nishina

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

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

Systems, architecture and hardware · 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 · 93% Integrated circuit design · 7%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
circuit partitioning
0.011987
Partitioning and Placement Technique for CMOS Gate Arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation › physical design › placement › cell placement
gate array placement
0.011987
Partitioning and Placement Technique for CMOS Gate Arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation
physical design
0.011987
Partitioning and Placement Technique for CMOS Gate Arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation › physical design
placement
0.011987
Partitioning and Placement Technique for CMOS Gate Arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Integrated circuit design › ASIC design
CMOS gate array
0.011987
Partitioning and Placement Technique for CMOS Gate Arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987

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

top-down partitioning · 0.0hierarchical design data · 0.0bottom-up extraction · 0.0
YearPublicationVenuePosition
1987 Partitioning and Placement Technique for CMOS Gate Arrays
abstract
This paper describes an automatic partitioning and placement system for CMOS gate arrays utilizing two different kinds of data: circuit structure and hierarchical design data. Characteristic circuit structures such as the bus structure and the iterative structure are automatically extracted and handled like single cells in the placement process. The partitioning process has employed two processes: one is the bottom-up extraction of these structures, and the other is the top-down process, which divides the given circuit into several subcircuits. Making use of the partitioning results, the placement program is also carried out by two-level processes: subcircuit-level placement and cell-level placement. Through experiments, it has been proved that the proposed technique is effective for attaining better layout results.
Gotaro Odawara, Takahisa Hiraide, Osamu Nishina
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3