The paper studies the problem of multiple column folding in the design of compact PLAs of m rows and n columns. A set of theoretical results leads to the construction of a heuristic algorithm which builds the folded PLA matrix row by row. The algorithm runs in time O (m2n + mn2), and provides locally optimal solutions.
Suboptimal solution for PLA multiple column folding
PINOTTI, Maria Cristina
1990
Abstract
The paper studies the problem of multiple column folding in the design of compact PLAs of m rows and n columns. A set of theoretical results leads to the construction of a heuristic algorithm which builds the folded PLA matrix row by row. The algorithm runs in time O (m2n + mn2), and provides locally optimal solutions.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
