On the design of fast, easily testable ALU's

A design methodology for implementing fast, easily testable arithmetic logi c units (ALU's) is presented. Here, we describe a set of fast adder designs , which are testable with a test set that has either theta(N) complexity (L in-testable) or theta(1) complexity (C-testable), where N is the input oper and size of the ALU, The various levels of testability are achieved by expl oiting some inherent properties of carry-lookahead addition. The Lin-testab le and C-testable ALU designs require only one extra input, regardless of t he size of the ALU. The area overhead for a high-speed 64-bit Lin-testable ALU is only 0.5%.