Browse Prior Art Database

Functional Array Tables

IP.com Disclosure Number: IPCOM000061742D
Original Publication Date: 1986-Sep-01
Included in the Prior Art Database: 2005-Mar-09
Document File: 3 page(s) / 40K

Publishing Venue

IBM

Related People

McCauley, KW: AUTHOR [+2]

Abstract

A data structure is used to control the operation of an Array Primitive within a test generator. This provides an alternative to hardcoding the complex function for the Array Primitive in the code and allows greater flexibility in maintaining the code. The data structure consists of an array containing the pointers to linked lists and the linked lists which contain values that control how the Array Primitive is to be functioned. Array Primitive must be controlled for a number of time slices, while transmitting or justifying a logic value. Each entry in a linked list controls how the Array Primitive will work in a slice of time. The values in the entry direct what logic values are to be placed on the inputs, outputs and into memory.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 52% of the total text.

Page 1 of 3

Functional Array Tables

A data structure is used to control the operation of an Array Primitive within a test generator. This provides an alternative to hardcoding the complex function for the Array Primitive in the code and allows greater flexibility in maintaining the code. The data structure consists of an array containing the pointers to linked lists and the linked lists which contain values that control how the Array Primitive is to be functioned. Array Primitive must be controlled for a number of time slices, while transmitting or justifying a logic value. Each entry in a linked list controls how the Array Primitive will work in a slice of time. The values in the entry direct what logic values are to be placed on the inputs, outputs and into memory. An entire linked list controls the Array Primitive for a particular situation for a number of times. An example is how a test value is transmitted through an address line. The code determines which linked list is to be used to transmit (propagate a test value toward the outputs) or justify (backtrace logic values to the inputs) a logic value considering the external stimulus applied to the Array Primitive. The code does this by determining which element, in the array data structure in which each element contains a pointer to a linked list, to use so the present objective on the block can be met. The chosen linked list controls which logic values are placed on the nets and into memory of the Array Primitive. Since the controlling of the nets and memory is done by the linked lists, the code mainly has to deal with determining which element of the data array to pick. Also, the way the Array Primitive operates can be adjusted by changing the sequence of a linked list, or part of an entry. Both of these concepts reduce the complexity of the code, which increases the maintainability of the code. As seen in the diagram, the data array has four dimensions and its elements contain pointers to the linked lists. Each dimension or subscript represents part of the decision process. The process decides on the values of the subscripts to locate an element within the data array. Each element within th...