A Top-Down Optimization Methodology for Mutually Exclusive Applications

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="827613.fig.0012a" src="https://static.hindawi.com/articles/ijrc/volume-2014/827613/figures/827613.fig.0012a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Pin order: A-B-C (default)</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="827613.fig.0012b" src="https://static.hindawi.com/articles/ijrc/volume-2014/827613/figures/827613.fig.0012b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Pin order: A-C-B</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="827613.fig.0012c" src="https://static.hindawi.com/articles/ijrc/volume-2014/827613/figures/827613.fig.0012c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>Pin order: B-A-C</td></tr></table></td></tr><tr class="fig-image" id="d"><td><img alt="827613.fig.0012d" src="https://static.hindawi.com/articles/ijrc/volume-2014/827613/figures/827613.fig.0012d.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(d) </b>Pin order: B-C-A</td></tr></table></td></tr><tr class="fig-image" id="e"><td><img alt="827613.fig.0012e" src="https://static.hindawi.com/articles/ijrc/volume-2014/827613/figures/827613.fig.0012e.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(e) </b>Pin order: C-A-B</td></tr></table></td></tr><tr class="fig-image" id="f"><td><img alt="827613.fig.0012f" src="https://static.hindawi.com/articles/ijrc/volume-2014/827613/figures/827613.fig.0012f.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(f) </b>Pin order: C-B-A</td></tr></table></td></tr></table>

<table>LUT input pin reordering example.</table>

International Journal of Reconfigurable Computing

fig12

Figure 12

Figure 12: A Top-Down Optimization Methodology for Mutually Exclusive Applications 