Arithmetic Test Strategy for FFT Processor

Ji-Xue Xiao, Guang-Ju Chen, Yong-Le Xie
{"title":"Arithmetic Test Strategy for FFT Processor","authors":"Ji-Xue Xiao, Guang-Ju Chen, Yong-Le Xie","doi":"10.1109/ATS.2005.25","DOIUrl":null,"url":null,"abstract":"For Fast Fourier Transform (FFT) processors, this paper presents a novel pseudo-exhaustive test strategy, in which adders in FFT processor generate all the test patterns. The scheme can detect all combinational faults within every basic building cell of FFT processors. Because of the reuse of some building blocks such as adders and registers existing in FFT processor, and the regularity of the circuit structure, the test scheme can be implemented at-speed and in parallel without performance degradation and additional hardware overhead, and with minimal additional area overhead..","PeriodicalId":373563,"journal":{"name":"14th Asian Test Symposium (ATS'05)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th Asian Test Symposium (ATS'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.2005.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

For Fast Fourier Transform (FFT) processors, this paper presents a novel pseudo-exhaustive test strategy, in which adders in FFT processor generate all the test patterns. The scheme can detect all combinational faults within every basic building cell of FFT processors. Because of the reuse of some building blocks such as adders and registers existing in FFT processor, and the regularity of the circuit structure, the test scheme can be implemented at-speed and in parallel without performance degradation and additional hardware overhead, and with minimal additional area overhead..
FFT处理器的算术测试策略
针对快速傅里叶变换(FFT)处理器,提出了一种伪穷举测试策略,其中FFT处理器中的加法器生成所有测试模式。该方案可以检测FFT处理器每个基本构建单元内的所有组合故障。由于FFT处理器中存在的加法器和寄存器等构建模块的重用,以及电路结构的规律性,该测试方案可以在不降低性能和额外硬件开销的情况下快速并行地实现,并且额外的面积开销最小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信