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

Takashi Taniguchi

dblp:62/5892 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2001
0000-0002-1467-3105ORCID · corroborated

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

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

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › digital circuit design
arithmetic circuit design
0.011994
Accurate Ronding Scheme for the Newton-Raphson Method Using Redundant Binary Representation · IEEE Trans. Computers 1994
Integrated circuit design › digital arithmetic circuits › division and square root
floating-point division and square root
0.011994
Accurate Ronding Scheme for the Newton-Raphson Method Using Redundant Binary Representation · IEEE Trans. Computers 1994
Integrated circuit design › digital arithmetic circuits › floating-point unit design
rounding
0.011994
Accurate Ronding Scheme for the Newton-Raphson Method Using Redundant Binary Representation · IEEE Trans. Computers 1994
Integrated circuit design › redundant number representation
redundant binary representation
0.011994
Accurate Ronding Scheme for the Newton-Raphson Method Using Redundant Binary Representation · IEEE Trans. Computers 1994

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

newton-raphson method · 0.0
YearPublicationVenuePosition
2001 A New Inter-Core Built-In-Self-Test Circuits for Tri-State Buffers in the System on a Chip
abstract
A new inter-core BIST circuit for tri-state buffers, T-BIST, mainly consists of simple circuits distributed in the relevant blocks. It can give an excellent test-coverage with a little additional hardware. Its configuration is not specified by each SoC structure, so it is suitable for a general/reusable testable IP.
Tetsuji Kishi, Mitsuyasu Ohta, Takashi Taniguchi, Hiroshi Kadota
Asian Test Symposium3
1994 Accurate Ronding Scheme for the Newton-Raphson Method Using Redundant Binary Representation
abstract
Proposes a new algorithm of estimation and compensation of the error effect for rounding in the case of implementation of division and square root using the Newton-Raphson method. The authors analyze the error of the hardware system to confirm the condition of the implementation with respect to this algorithm. Next, they describe in detail how to compensate the error by using this algorithm. Finally, they show that the hardware components for this algorithm, the direct rounding mechanism in the recode circuit and the sticky digit generating circuit, can be realized simply by improving the redundant binary representation multiplier. The number of increasing cycles for this new algorithm is only one, and the rounding result using this algorithm satisfies IEEE Standard 754 rounding perfectly.>
Hideyuki Kabuo, Takashi Taniguchi, Akira Miyoshi, Hitoshi Yamashita, Miki Urano, Hisakazu Edamatsu, Shigeo Kuninobu
IEEE Trans. Computers2
1987 Design of high speed MOS multiplier and divider using redundant binary representation
abstract
A high speed multiplier and divider for MOS LSI based on a new algorithm is presented. When we implement the multiplier and the divider in LSI, the features such as high speed operation, small number of transistors and easy layout are the most important factors. A computational algorithm using a redundant binary representation has several excellent features such as high speed addition operations. We improved the algorithm and the method of implementation, and designed an advanced multiplier and divider with the above mentioned features. We expect mat our multiplier and divider are excellent compared with multipliers using the Booth algorithm and the Wallace tree, and with divider using the SRT method, respectively.
Shigeo Kuninobu, Tamotsu Nishiyama, Hisakazu Edamatsu, Takashi Taniguchi, Naofumi Takagi
IEEE Symposium on Computer Arithmetic4