Programmable Logic Array Area Optimization PLA Folding Bipartite Folding
Issue Date:
2003
Publisher:
Institute of Information Theories and Applications FOI ITHEA
Abstract:
This paper presents some results of PLA area optimizing by means of its column and row folding. A
more restricted type of PLA simple folding is considered. It is introduced by Egan and Liu and called as
bipartite folding. An efficient approach is presented which allows finding an optimal bipartite folding without
exhaustive computational efforts.
