By Topic

An efficient algorithm for selecting bipartite row or column folding of programmable logic arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bin-Da Liu ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; Kai-Cheng Wei

Different from the previous PLA folding algorithms which perform row and column foldings independently, we propose an algorithm to obtain bipartite row or column folding result on the same graph. The PLA personality matrix is modeled as a graph and the folding problem is modeled as a partitioning problem. Experimental results show that this algorithm can lead to a good guide to select row or column folding for reducing the chip area of the PLA efficiently

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:41 ,  Issue: 7 )