STRUCTURALLY SELF-TESTABLE DATA-PATH SYNTHESIS OF APPLICATION-SPECIFIC INTEGRATED-CIRCUITS

This paper presents a technique for developing a structurally self-tes table data path from a scheduled data flow graph (SDFG). The approach is based on elimination of self adjacent registers to improve controll ability and observability of the data path, resulting in an increased level of testability. We introduce registers and functional units assi gnment graphs. We propose to interconnect the registers obtained by re gister assignment graph (RAG) with the Functional units obtained by fu nctional-unit assignment graph (FAG). The interconnection is achieved by an interconnection optimization technique. It generates a data path that is structurally self-testable. RAG eliminates resource conflicts and loop problems, whereas FAG eliminates merging of consecutive oper ations into one functional unit. The combination of RAG and FAG elimin ates the self adjacent registers. The technique is implemented on diff erent benchmark examples and the comparison results with the existing techniques are presented. It is found that our technique is more cost effective. Copyright (C) 1996 Elsevier Science Ltd