Abstract: This paper presents threshold element-based symmetric function generators (SFG) and techniques for their functional extension. Any symmetric function of k input variables is realized by SFGs with (k + 1) configuration bits. When less than k input variables are applied to the SFGs, certain logic functions beyond symmetric functions can be achieved by configurations of interconnection resources. Logic functions achieved by the extended SFGs are compared with those by SRAMbased look-up tables. It is demonstrated that the SFGs have flexibility in achievable function classes and utilize configuration bits economically.
0 Replies
Loading