A Testable Realization for Decimal Multipliers

T. Hirayama, Y. Nishitani, S. Kitamura
{"title":"A Testable Realization for Decimal Multipliers","authors":"T. Hirayama, Y. Nishitani, S. Kitamura","doi":"10.1109/ISMVL.2011.45","DOIUrl":null,"url":null,"abstract":"We propose a testable decimal multiplication circuit under the single cell fault model. The multiplier consists of iterative logic arrays of partial product generators and adders. We also give a set of test patterns to detect single faults in the circuit. The number of test patterns is proportional to that of the input digits of the multiplier, which is significantly smaller than the exponential number of test patterns required in non-testable circuits. This efficient testability is achieved only by as light change of the function in the partial product generators and an insertion of some testing inputs in the adders. No additional hardware modules are required in the proposed realization.","PeriodicalId":234611,"journal":{"name":"2011 41st IEEE International Symposium on Multiple-Valued Logic","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 41st IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2011.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a testable decimal multiplication circuit under the single cell fault model. The multiplier consists of iterative logic arrays of partial product generators and adders. We also give a set of test patterns to detect single faults in the circuit. The number of test patterns is proportional to that of the input digits of the multiplier, which is significantly smaller than the exponential number of test patterns required in non-testable circuits. This efficient testability is achieved only by as light change of the function in the partial product generators and an insertion of some testing inputs in the adders. No additional hardware modules are required in the proposed realization.
十进制乘数的可测试实现
提出了一种可测试的单格故障下的十进制乘法电路。乘法器由部分乘积发生器和加法器组成的迭代逻辑阵列组成。我们还给出了一套检测电路中单个故障的测试模式。测试模式的数量与乘法器输入数字的数量成正比,这明显小于不可测试电路所需的测试模式的指数数量。这种有效的可测试性仅通过在部分积生成器中稍微改变函数和在加法器中插入一些测试输入来实现。在提出的实现中不需要额外的硬件模块。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信