Journal Published Online: 01 March 2004
Volume 32, Issue 2

Time-Constrained Scheduling and Module Allocation for On-Line Testability in Pipelined Data Paths

CODEN: JTEVAB

Abstract

This paper presents an on-line testable-pipelined data path synthesis with the goal of minimizing testing time. An independent time-constrained scheduling with a module allocation algorithm for a pipelined data path is proposed. The algorithm takes any behavioral description represented as a data flow graph as input and generates a pipelined data path. The pipelined data path is composed of resources such as modules, registers, and multiplexers. Our on-line testing methodology applies to modules where multi type operations are assigned. The test is performed on each type of operation assigned to a module. The testing time is reduced by minimizing the overall number of types of operations assigned to modules. Thus, the objective is to minimize the overall number of types of operations assigned to all modules by performing pipelined data path synthesis. Experimental results confirm there can be some improvement in minimizing the overall number of types of operations assigned to all modules.

Author Information

Ismaeel, A
College of Engineering and Petroleum, Kuwait University, Safat, Kuwait
Mathew, R
College of Engineering and Petroleum, Kuwait University, Safat, Kuwait
Pages: 8
Price: $25.00
Related
Reprints and Permissions
Reprints and copyright permissions can be requested through the
Copyright Clearance Center
Details
Stock #: JTE11383
ISSN: 0090-3973
DOI: 10.1520/JTE11383