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

Masahiko Toyonaga

dblp:17/3949 · also Masahiko Toyonga · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 4 · 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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.112005
A watermarking system for IP protection by a post layout incremental router · DAC 2005
Electronic design automation
intellectual property protection
0.112005
A watermarking system for IP protection by a post layout incremental router · DAC 2005
Electronic design automation › intellectual property protection
watermarking
0.112005
A watermarking system for IP protection by a post layout incremental router · DAC 2005
Electronic design automation
physical design
0.012005
A watermarking system for IP protection by a post layout incremental router · DAC 2005
Electronic design automation › physical design
routing
0.012005
A watermarking system for IP protection by a post layout incremental router · DAC 2005

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

probabilistic rip-up and reroute · 0.1DES encryption · 0.1
YearPublicationVenuePosition
2013 A multilevel fingerprinting method for FPGA IP protection
abstract
With the increasing risk of IP reuse in System on Chip (SoC) design, intellectual property (IP) techniques becomes one of the most important issues. Compare with watermarking, fingerprinting is a more effective method because is not only protects the IP owner's benefits but also user's rights. In this paper, we firstly propose a multilevel fingerprinting method for IP protection. In the typical field programmable gate array (FPGA) design flow, we first embed the watermarks into a FPGA design at netlist level by manipulating LUTs. When the IP core is compiled into a bitstream file, an individual fingerprint from IP user is then embedded into margin of FPGA. The experimental results show that the method has low resource and timing overhead, while proves a strong certificate both of IP owner and users.
Tingyuan Nie, Yansheng Li 0005, Lijian Zhou, Masahiko Toyonaga
ISCAS4
2005 A watermarking system for IP protection by a post layout incremental router
abstract
In this paper, we introduce a new watermarking system for IP protection on post-layout design phase. Firstly the copyright is encrypted by DES (Data Encryption Standard) and then embedded by using an incremental router into the layout design. This watermarking technique uniquely identifies the circuit origin, yet is difficult to be detected or fabricated. The incremental router consists of a rip-up and a special re-router that inserts redundant bends into wires probabilistic. We evaluated the technique on various generated benchmark circuits to validate the completeness of the procedure. The results show it achieves almost 100% success for embedding with no extra area cost on design performances.
Tingyuan Nie, Tomoo Kisaka, Masahiko Toyonaga
DAC3
2000 A practical clock tree synthesis for semi-synchronous circuits
abstract
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such that a clockinput timing of each register is a multiple of a predefined unit delay and the length of interconnection from a parent node to its child is upper bounded. The clock trees are constructed for several practical circuits. The size of each clock tree is comparable to a zero skew clock tree. In order to assure the practical quality, they are examined under the five delay conditions, which cover various environmental and manufacturing conditions. As a result, they are proved stable under each condition and improve the clock speed up to 17.3 % against the zero skew clock trees. Keywords Semi-synchronous, clock-input timing, clock scheduling, environmental and manufacturing conditions, zero skew clock tree, various timing clock tree. 1.
Masahiko Toyonaga, Keiichi Kurokawa, Takuya Yasui, Atsushi Takahashi 0001
ISPD1
1994 A New Approach of Fractional-Dimension Based Module Clustering for VLSI Layout
abstract
This paper describes a new clustering approach for VLSI placement, which is based on a fractal dimension analysis for the topological structure of modules in a logic diagram. A distinctive feature of this approach is that the concept of a fractal dimension has been introduced into a logic diagram in such a way that clustering of modules is iterated while the fractal dimension of clustered modules remains in a prescribed range. A part of experimental results is also shown, which demonstrates that our clustering approach achieves better solutions than the conventional placement without clustering.>
Masahiko Toyonaga, Shih-Tsung Yang, Toshiro Akino, Isao Shirakawa
ISCAS1