This paper describes an approximate routing procedure. The procedure is quite general and could be applied to both printed circuit boards and integrated circuit chip wiring procedures where a hierarchical wiring scheme is utilized. This procedure has been incorporated in sperry's automatic gate array chip layout system.

This paper discusses the applications of interchange procedures to solve circuit placement problems. A theoretical analysis to guage the quality of solutions is presented. Two interchange algorithms (Algo I and Algo II) are programmed and tested for moderate size placement problems. Algo II is an improved version of Algo I. On the basis of the limited computational results. Algo II seems to provide significant improvements without increased computation cost.

This paper discusses the problem of assigning manufacturing tolerances in the development of a tolerance chart. A quantitative model is constructed so as to consider both the tolerance capability of the various processes used in the manufacture of a part, as well as the most effective way to combine tolerances in order to establish an overall tolerance. The variations of this model are discussed along with the manual trial and error method. It appears that significant reductions in manufacturing costs can be achieved by applying the automation methods presented in this paper.

A novel technique for address generation is presented in this correspondence. This scheme has two useful features. Addresses are generated with check bits as an integral part of the address in order to provide multi-fault-detection capability. To date, there exists no such scheme with this feature. Secondly, the addresses generated through this scheme are pseudorandom; therefore, they can be used for storage hierarchies using hash coding techniques.

In this correspondence we show the existence of a Reed-Muller like expansion for multivalued functions. We establish that any m-variable, N-valued function [mi]f(xm,xm-1,...x1[/mi]) can be expressed as [mi]Co+ C1x1+ *--+ + CNm_1xmN-1xm-1N-1x1N-1[/mi]. A matrix method for determining the coefficients of these expansions is presented. The problem of finding minimal expression for a given function is discussed. Finally, we present a new technique for realizing multiple output functions.

This correspondence presents a complete solution to the problem of constructing maximalq-nary codes, for any word lengthnand minimum distancedin the regionqd \geq (q - 1)n. Several interesting results regarding the interdependence of these codes are developed, which reveal the unique structure of the code spaces of the regionqd \geq (q - 1)n. Some new maximal codes are obtained for the regionqd < (q - 1)n.