Testing Schemes for FIR Filter Structures
Pages 674 - 688
Abstract
This paper presents a new pseudoexhaustive test methodology for digital finite impulse response (FIR) filters. The proposed scheme can be employed to detect any combinational faults within the basic cell of the functional units occurring in linear phase comb filters, trees of sign-extended adders and phase-shift multipliers. It uses additive generators as a source of pseudo-exhaustive patterns to systematically test all FIR filter building blocks.
References
[1]
V.D. Agrawal, C.R. Kime, and K.K. Saluja, "A Tutorial on Built-In Self-Test, Part 1: Principles," IEEE Design and Test of Computers, vol. 10, no. 1, pp. 73-82, Mar. 1993.
[2]
V.D. Agrawal, C.R. Kime, and K.K. Saluja, "A Tutorial on Built-In Self-Test, Part 2: Applications," IEEE Design and Test of Computers, vol. 10, no. 2, pp. 69-77, June 1993.
[3]
A. Chatterjee and J. Abraham, "Test Generation for Iterative Logic Arrays Based on an N-Cube of Cell States Model," IEEE Trans. Computers, vol. 40, no. 10, pp. 1133-1148, Oct. 1991.
[4]
C.-I.H. Chen and J.T. Yuen, "Automated Synthesis of Pseudo-Exhaustive Test Generator in VLSI BIST Design," IEEE Trans. VLSI Systems, vol. 2, no. 3, pp. 273-291, Sept., 1994.
[5]
A.D. Friedman, "A Functional Approach to Efficient Fault Detection in Iterative Logic Arrays," IEEE Trans. Computers, vol. 43, no. 12, pp. 1365-1375, Dec. 1994.
[6]
F.G. Gray and R.A. Thompson, "Fault Detection in Bilateral Arrays of Combinational Cells," IEEE Trans. Computers, vol. 27, no. 10, pp 1206-1213, Oct. 1978.
[7]
S. Gupta, J. Rajski, and J. Tyszer, "Arithmetic Additive Generators of Pseudo-Exhaustive Test Patterns," IEEE Trans. Computers, vol. 45, no. 8, pp. 939-949, Aug. 1996.
[8]
R.J. Higgins, Digital Signal Processing in VLSI. Prentice Hall, 1990.
[9]
I. Koren, Computer Arithmetic Algorithms. Prentice Hall, 1993.
[10]
D. Kagaris, F. Makedon, and S. Tragoudas, "A Method for Pseudo-Exhaustive Test Pattern Generation," IEEE Trans. Computer-Aided Design, vol. 13, no. 9, pp. 1170-1178, Sept. 1994.
[11]
N. Mukherjee, "Built-In Self Test for Functional Blocks in Data Path Architectures," PhD thesis, McGill Univ., Montreal, Canada, 1996.
[12]
N. Mukherjee, M. Kassab, J. Rajski, and J. Tyszer, "Arithmetic Built-In Self-Test for High-Level Synthesis," Proc. VTS, pp. 132-139, May 1995.
[13]
Y. Neuvo, "Digital Filter Implementation Considerations," Handbook for Digital Signal Processing, S.K. Mitra and J.K. Kaiser, eds., pp. 337-417, John Wiley & Sons, 1993.
[14]
R. Parthasarathy and S.M. Reddy, "A Testable Design of Iterative Logic Arrays," IEEE Trans. Computers, vol. 30, no. 11, pp. 833-841, Nov. 1981.
[15]
J.G. Proakis and D.G. Manolakis, Digital Signal Processing: Principles, Algorithms, and Applications. Prentice Hall, 1996.
[16]
J. Rajski and J. Tyszer, Arithmetic Built-In Self-Test for Embedded Systems. Prentice Hall, 1998.
[17]
J.P. Shen and F.J. Ferguson, "The Design of Easily Testable VLSI Array Multipliers," IEEE Trans. Computers, vol. 33, no. 6, pp. 554-557, June 1984.
[18]
R. Srinivasan, S.K. Gupta, and M.A. Breuer, "Novel Test Pattern Generators for Pseudo-Exhaustive Testing," Proc. IEEE Int' Test Conf., pp. 1041-1050, 1993.
[19]
C. Su and C. Wu, "Testing Iterative Logic Arrays for Sequential Faults with a Constant Number of Patterns," IEEE Trans. Computers, vol. 43, no. 4, pp. 495-501, Apr. 1994.
[20]
A. Vergis, "On the Testability of One-Dimensional ILAs for multiple Sequential Faults," IEEE Trans. Computers, vol. 41, no. 7, pp. 906-916, July 1992.
[21]
N.W.E. Weste and K. Eshraghian, Principles of CMOS VLSI Design. Addison-Wesley, 1992.
Recommendations
On arbitrary-length, M-channel linear-phase FIR filter banks
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)Tree-structured IIR/FIR uniform-band and octave-band filter banks with very low-complexity analysis or synthesis filters
This paper introduces new tree-structured uniform-band and octave-band digital filter banks (FBs). These FBs make use of half-band IIR filters in the analysis FBs and FIR filters in the synthesis FBs. The resulting FBs are asymmetric in the sense that ...
Design of two-channel linear phase IIR PRQMF banks based on the approximation of FIR filters
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)This paper presents an algorithm to design two-channel linear phase IIR PRQMF (LP IIR PRQMF) banks. This algorithm is based on the approximation of the FIR by IIR digital filters matching a finite portion of the impulse response and the autocorrelation ...
Reviews
Festus Gail Gray
This is a very interesting research paper. The presentation is very formal, and some mathematical background is required to understand the results. It will be of interest to those involved in the theory and practice of testing, as well to those directly involved in the design of FIR chips. The paper presents a new pseudoexhaustive test methodology guaranteed to detect all combinational faults in the basic cells of all functional blocks in digital finite impulse response (FIR) filters. Separate sections treat FIFO Buffer-Comb filters, constant input multipliers, trees of adders, and phase shift multipliers. Using only simple arithmetic functions, the concept of exhaustive coverage of contiguous input subspaces is applied to develop test vectors that exhaustively cover any specific subspace size at the input to a functional block without the need for functional modeling or expensive fault simulation. Existing registers in the filter structure act as parallel scan chains to enhance the controllability of deeply embedded structures. Other existing pipeline registers are used to hold and apply the test vectors. Therefore, fairly minimal modifications need to be made to the original filter to implement the testing scheme. This paper is well written and apparently free of technical errors. It is essential reading for those performing research in testing and for those designing FIR chips. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 1996 IEEE. All Rights Reserved.
Publisher
IEEE Computer Society
United States
Publication History
Published: 01 July 2001
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025