Test Pattern Generation Using Recursive Pseudo Exhaustive Method for Wallace Tree Multiplier

Testing of multiplier circuit is a complex issue. As the number of test input increases, test patterns will also increase, which will require more area, consequently more time and power. Pseudo exhaustive test generator scheme generates test sets recursively for any value of `k' which is less than or equal to `n'. This paper proposes a test pattern generator for Wallace Tree Multiplier using recursive Pseudo-Exhaustive method. 16-bit Wallace Tree multiplier is partitioned into three columns using multiplexers. Each column is tested exhaustively covering all possible combinational faults exhaustively for every k-bit group. As testing is performed in parallel; The proposed scheme reduces the time required for testing of the multiplier.