Browse Prior Art Database

APL Implementation of Algorithm for Personalization of Generalized Logic Array

IP.com Disclosure Number: IPCOM000079082D
Original Publication Date: 1973-May-01
Included in the Prior Art Database: 2005-Feb-26
Document File: 2 page(s) / 13K

Publishing Venue

IBM

Related People

Fleisher, H: AUTHOR [+2]

Abstract

An APL Program is described for designating the rectangular coordinates of connections constituting the "personality" of a generalized logic array. The program utilizes two data sets. One has the form of a truth table comprising a list of all possible MIN-terms for the number of variables (i.e., the number of array arguments), and the other is a function (or output) table associated with the personality which is to be calculated.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 2

APL Implementation of Algorithm for Personalization of Generalized Logic Array

An APL Program is described for designating the rectangular coordinates of connections constituting the "personality" of a generalized logic array. The program utilizes two data sets. One has the form of a truth table comprising a list of all possible MIN-terms for the number of variables (i.e., the number of array arguments), and the other is a function (or output) table associated with the personality which is to be calculated.

Upon initiation of the program, after the typing in of the program operators and the truth and function tables, a sequence of permutation and partitioning operations is performed by the program based on information provided by the user. The program then selects successive columns of the output function table and generates the corresponding array personality by means of the following algorithm:

The MIN-term list that constitutes the function is arranged in column groups (partitions), e.g., A B C D E F G might be permuted and partitioned into, A D, B F G, C, E. For each partition (and each MIN-term), each binary number N is replaced by the binary representation of 2 to the Nth power. E.g., 11, 101, 0, 1 becomes - 3000, 00100000, 01, 10. We then proceed to LINK MIN-terms to form implicants. Two MIN-terms or implicants can be linked if they differ in only one partition. More generally, any two implicants can be ORed together for any one partition and ANDed together for the remaining partitions. The result is a valid implicant provided none of its partitions is all 0's. Under the algorithm, LINKing is permitted only when the new implicant contains at least as many 1's as either of the original implicants.

A group of prime implicants is formed by systema...