Showing papers on "Encoding (memory) published in 1968"

An algorithm for minimizing read only memories for machine control

Abstract: This paper describes an algorithm for minimizing the storage required of a Read Only Memory that is going to be used as the control element for a digital machine. The technique is based upon the fact that not all sub-commands are required in all words so that bits of the memory may be time shared between subcommands. The algorithm provides a means for determining what sub-commands should share a common set of bits. The algorithm is essentially one of exhaustive evaluation but it is one that directs you toward the solution rather than one which randomly tries all possible solutions and chooses the best. In addition certain bounds on the "size" of the solution are derived and these in turn eliminate a large segment of the possible solution set from consideration. Finally, the algorithm is quite iterative and as such lends itself readily to implementation of a digital machine.

An Iteratively Structured General-Purpose Digital Computer

Abstract: A general-purpose synchronous stored-program digital computer is described. The computer is composed solely of many small, identically structured sequential machines, each machine having fewer than 211 states. The one-dimensional iterative array of sequential machines, or cells, which constitutes this computer is similar to the distributed logic associative memory originally proposed by Lee. A significant difference in the machine's structure, however, arises from the fact that instructions are stored within, and are under the control of, other cells, rather than a central processing unit. No specific area of this machine acts solely as a memory, an arithmetic unit, or a control unit, but rather, one or more cells within the iterative array perform all of the above tasks.

Perceiving and encoding two kinds of item-information

Abstract: Perception and encoding of item-information about the occurrence of simple, well-known events (numbers) for retrieval by either same-order recall or serial-order recall was investigated by specifying kind of recall to be used either before or after perception and encoding. Both same-order and serial-order recall were less when kind of recall was specified after presentation, but serial-order recall decreased more than same-order recall. These results indicate that the same numbers may be perceived differently for same-order or serial-order recall: different kinds of item-information may be encoded either in terms of presentation characteristics (serial position for same-order recall) or event characteristics (ordinal position for serial-order recall).