New Considerations for Spectral Classification of Boolean Switching  Functions

<table>An example illustrating the Type 4 invariance operation, with (a) showing the original function, and (b) showing input 1 replaced with <svg height="13.925" id="M236" style="vertical-align:-3.25793pt" version="1.1" viewbox="0 0 49.612499 13.925" width="49.612499" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,13.925)">
<g transform="translate(72,-60.86)">
<text transform="matrix(1,0,0,-1,-71.95,64.16)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑥</tspan>
</text>
<text transform="matrix(1,0,0,-1,-65.07,61.03)">
<tspan style="font-size: 8.75px; " x="0" y="0">3</tspan>
</text>
<text transform="matrix(1,0,0,-1,-57.42,64.16)">
<tspan style="font-size: 12.50px; " x="0" y="0">⊕</tspan>
<tspan style="font-size: 12.50px; " x="13.303192" y="0">𝑥</tspan>
</text>
<text transform="matrix(1,0,0,-1,-37.24,61.03)">
<tspan style="font-size: 8.75px; " x="0" y="0">1</tspan>
</text>
</g>
</g>
</svg>.</table>

VLSI Design

fig2

Figure 2

Figure 2: New Considerations for Spectral Classification of Boolean Switching  Functions 