By Topic

Enhancing testability of VLSI arrays for fast Fourier transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. -K. Lu ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; C. -W. Wu ; S. -Y. Kuo

Fast-Fourier-transform (FFT) algorithms are used in various digital signal-processing applications such as linear filtering, correlation analysis and spectrum analysis. With the advent of very large-scale-integration (VLSI) technology, a large collection of processing elements can be gathered to achieve high-speed computation economically. However, owing to the low pin-count/component-count ratio, the controllability and observability of such circuits decrease significantly. As a result, testing of such highly complex and dense circuits becomes very difficult and expensive. M-testability conditions for butterfly-connected and shuffle-connected FFT arrays are proposed. Based on them, a novel design-for-testability approach is presented and applied to the module-level systolic FFT arrays. The M-testability conditions guarantee 100% single-module-fault testability with a minimum number of test patterns.

Published in:

IEE Proceedings E - Computers and Digital Techniques  (Volume:140 ,  Issue: 3 )