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

Nobutaka Kito

dblp:36/8791 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0003-2894-8947ORCID · corroborated

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
Integrated circuit design · 54% Hardware reliability and fault tolerance · 36% Electronic design automation · 11%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › digital circuit design › arithmetic circuit design
adder design
0.412019
Concurrent Error Detectable Carry Select Adder with Easy Testability · IEEE Trans. Computers 2019
Integrated circuit design › digital circuit design › arithmetic circuit design › adder design
carry-select adder
0.412019
Concurrent Error Detectable Carry Select Adder with Easy Testability · IEEE Trans. Computers 2019
Hardware reliability and fault tolerance › error detection
concurrent error detection
0.412019
Concurrent Error Detectable Carry Select Adder with Easy Testability · IEEE Trans. Computers 2019
Integrated circuit design
digital circuit design
0.412019
Concurrent Error Detectable Carry Select Adder with Easy Testability · IEEE Trans. Computers 2019
Hardware reliability and fault tolerance › error detection
parity prediction
0.412019
Concurrent Error Detectable Carry Select Adder with Easy Testability · IEEE Trans. Computers 2019
Electronic design automation
hardware verification and test
0.112019
Concurrent Error Detectable Carry Select Adder with Easy Testability · IEEE Trans. Computers 2019
Electronic design automation › hardware verification and test › fault testing
stuck-at fault testing
0.112019
Concurrent Error Detectable Carry Select Adder with Easy Testability · IEEE Trans. Computers 2019

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

parity comparison · 0.4fault simulation · 0.4duplication · 0.4
YearPublicationVenuePosition
2019 Concurrent Error Detectable Carry Select Adder with Easy Testability
abstract
A concurrent error detectable adder with easy testability is proposed. The proposed adder is based on a multi-block carry select adder. Any erroneous output of the adder caused by a fault modeled as a single stuck-at fault can be detected by comparing the predicted parity of the sum with the parity of the sum, i.e., the XORed value of the sum bits, and comparing the duplicated carry outputs. The adder is also testable with only 10 input patterns under single stuck-at fault model. This property eases detection of a fault before the occurrence of a second fault. Both the concurrent error detectability to detect erroneous results and the easy testability to find a fault during operation are important for realizing reliable systems. Both the concurrent error detectability and the easy testability of the proposed adder are proven. A 32-bit adder has been designed. Its hardware overhead is about 70 percent. Its concurrent error detectability and 100 percent test coverage through the 10 patterns has been confirmed by fault simulation.
Nobutaka Kito, Naofumi Takagi
IEEE Trans. Computers1
2008 Level-Testability of Multi-operand Adders
abstract
Level-testability of multi-operand adders consisting of carry save adders is shown by showing test design for them. A multi-operand adder is a main part of a multiplier. 6L+2 patterns are sufficient to test a multi-operand adder under cell fault model, where L denotes the depth of the multi-operand adder. A test method of the multi-operand adder used as a partial product compressor in a multiplier is also shown. This result gives an upper bound of the number of required test patterns for a multi-operand adder in any multiplier.
Nobutaka Kito, Naofumi Takagi
ATS1