7|2 counters and multiplication with threshold logic

We propose new threshold logic based, 7|2 counters. In particular we show that 7|2 counters can be implemented with threshold logic gates in three levels of gates with explicit computation of the outputs. Consequently, we improve the delay by showing that 7|2 counters can be designed with two levels of gates and implicit computation of the sum. Further we investigate multiplication schemes using such counters, in combination with Kautz´s (1961) networks for symmetric Boolean functions. Using a 32/spl times/32 direct multiplication scheme based on 7|2 implicit output computation counters and the Kautz´s networks we show that our scheme outperforms in terms of area requirements known proposals for multiplications using threshold logic.