M.M. Newborn

Bio: M.M. Newborn is an academic researcher. The author has contributed to research in topics: Moore machine & Finite-state machine. The author has an hindex of 1, co-authored 1 publications receiving 21 citations.

A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines

Abstract: —A "synthesis technique" is presented for "realizing" any arbitrary binary input-binary output "synchronous sequential Moore machine" in the form of a network composed of identical 2-state "component machines." With slight modification the synthesis technique presented can be used to realize any given n-input-p-output synchronous sequential Moore machine in the form of a network composed of identical 2-state component machines.

Programmable cellular logic arrays

Abstract: In recent years, technological advances have provided the designer of computing hardware with the ability to batch-fabricate large numbers of logic components on a single semiconductor slice. Numerous researchers have investigated the synthesis of various kinds of digital logic by using arrays of :ident ical cells. This dissertation considers cellular arrays whose individual cell functions are determined by parameter flip-flops and logic gates in the cell, rather than by a physical customizing operation during manufacture. Potential advantages of this technique include functional variability aften manufacture, more efficient testing, and enhanced failure tolerance. Arrays may be cla_sified according to their generality, i.e., the number and range of the tasks which they are designed to perform. Two significantly different examples of low-generality arrays are presented and analyzed. One, a shift register array, is shown to be more effective than some conventional techniques for creating shift registers in the presence of numerous manufacturing defects.

Iteratively Realized Sequential Circuits

Abstract: Synthesis techniques are presented for realizing an arbitrary synchronous flow table in the form of an array of identical modules interconnected in a regular pattern. Several types of structures and their corresponding modules are considered, and a relationship between these structures and earlier work on combinational circuits is shown.

Combinational and Sequential Cellular Structures

Abstract: Cellular arrays composed of identical cells with uniform interconnections are presented. The basic cell is a switching device with two inputs, two outputs, and two control variables x and T. The cell structure is either purely combinational or with unit delay depending upon the control variable T. The control variable x sets up either a ``crossing mode'' or a ``bending mode'' in the cell. Thus a two-dimensional cellular array without time delays has the connection capabilities of a crossbar switch. Any combinational switching function can be realized by appropriate choice of control variables while the inputs to the edges of the plane are fixed. Alternatively, the control variables can be fixed while the inputs to the edges of the cellular plane are varied from function to function. A cubic array is constructed from a set of identical cellular planes packed one upon the other such that the control variables applied to the first plane will penetrate to all other planes without time delay. It is shown that any k functions of the same variables can be synthesized on such a cubic array. By allowing the control variable T to delay some signals in the array, such a cubic array can be used to realize any synchronous sequential machine with single or multiple inputs and/or feedback functions. Any defective cell in the array can be tested and isolated. The array can be stripped, divided, or interconnected.

Iteratively realized sequential circuits

Abstract: Synthesis techniques are presented for realizing any given synchronous flow table in an array of identical modules interconnected in a regular pattern. Several types of structures and their corresponding modules are considered, and a relationship between these structures and earlier work on combinational circuits is shown.

Uniform modular realization of sequential machines

Abstract: Several researchers have investigated the problem of using a finite set of sequential modules to realize a given synchronous Moore machine.1,2,3 It has been shown that there does not exist either a single module or a finite set of modules that is logically complete for synchronous sequential machine design.3 That is, no finite number of identical copies of one module or finite set of modules can be used to realize with unit delay any arbitrary synchronous sequential machine. However, it has been shown that for every integer n, a finite number of identical copies of one module is sufficient to realize every n-input synchronous machine.2,3 It is the purpose of this paper to investigate this form of machine realization for both synchronous and asynchronous machines.