Design-for-testability techniques for arithmetic circuits

Bo Yuan Ye*, Po Yu Yeh, Sy Yen Kuo, Ing Yi Chen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper, a novel test technique is proposed to achieve C-testable DFT designs for arithmetic circuits. Base on famous iterative-logic-array (ILA) test scheme, basic bijective cells (one-to-one mapped I/O function) for adder, subtractor, adder-subtractor and multiplier are proposed. In particular, these basic cells are always bijective for any word-length n. Thus the bijective cells can be easily connected together for various arithmetic circuits such as accumulator, multiplier and FIR (Finite Impulse Response) filter, and these arithmetic circuits can be regarded as C-testable ILAs. The proposed solutions can be reused or cascaded with similar structure circuits. Besides, all the proposed arithmetic DFT designs can be cascaded and tested together for saving lots of test pins and BIST (Build-In Self Test) area.

Original languageEnglish
Title of host publication2009 IEEE Circuits and Systems International Conference on Testing and Diagnosis, ICTD'09
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE Circuits and Systems International Conference on Testing and Diagnosis, ICTD'09 - Chengdu, China
Duration: 28 04 200929 04 2009

Publication series

Name2009 IEEE Circuits and Systems International Conference on Testing and Diagnosis, ICTD'09

Conference

Conference2009 IEEE Circuits and Systems International Conference on Testing and Diagnosis, ICTD'09
Country/TerritoryChina
CityChengdu
Period28/04/0929/04/09

Keywords

  • C-testable
  • Design for testability
  • Iterative logic array
  • Logic testing

Fingerprint

Dive into the research topics of 'Design-for-testability techniques for arithmetic circuits'. Together they form a unique fingerprint.

Cite this