## Abstract

We consider energy consumption during testing for C-testable iterative logic arrays (ILAs) We show that the cell test sequences in the ILA have a property of repetition and ensure that the test energy depends on the order of the test patterns, which is obvious for random logic, but is not for ILAs due to its iteration property. The time complexity for obtaining the transition energy of all possible pattern sequences is reduced from O(X^{2}N^{2}C^{2}) to O(X^{2}C^{2}), where X, N, and C represent the test length, array size, and cell complexity, respectively. We formulate the problem of finding the optimal test sequence, as a shortest-path problem. Using the obtained test sequence the total energy consumption is minimized, and the transition power is within the design specification. The time complexity is independent of the array size.

Original language | English |
---|---|

Pages (from-to) | 899-911 |

Number of pages | 13 |

Journal | Journal of Information Science and Engineering |

Volume | 15 |

Issue number | 6 |

Publication status | Published - 1999 Nov 1 |

## All Science Journal Classification (ASJC) codes

- Software
- Human-Computer Interaction
- Hardware and Architecture
- Library and Information Sciences
- Computational Theory and Mathematics