A Cellular Permuter Array
IEEE Transactions on ComputersPublished 1 October 1972
Somnath Bandyopadhyay, Sriparna Basu, A. K. Choudhury
Citations11
SJR quartileQ1
SJR score1.16
SNIP1.61
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new scheme for permuter arrays is discussed in this note whereby the variables are selected sequentially by a number of "selector cells" according to the required output ordering.
Abstract
A permuter network is used to arbitrarily change the ordering of the variables of a switching function. A new scheme for permuter arrays is discussed in this note whereby the variables are selected sequentially by a number of "selector cells" according to the required output ordering. A cellular realization of the selector cell is suggested.
Keywords
Computer Science
Journal of the ACMA Permutation Network
444 Citations1968Abraham Waksman
The construction of a switching network capable of n-permutation of its input terminals to its output terminals is described and an algorithm is given for the setting of the binary cells in the network according to any specified permutation.
IEEE Transactions on ComputersCellular Interconnection Arrays
93 Citations1968William H. Kautz, Karl Levitt +1 more
Various network forms are described, differing in the number of cells needed, in the shape of the array, and in the length and regularity of intercell connections, which are some ways of setting up the array to achieve a desired permutation.
IEEE Transactions on Electronic ComputersCutpoint Cellular Logic
91 Citations1964Robert C. Minnick
This paper is concerned with the choice of the logical properties for each cutpoint cell, so that an array of these cells is capable of efficient and general combinational and sequential logic.
IEEE Transactions on Electronic ComputersMulti-threshold threshold elements
81 Citations1966Donald R. Haring
It is proved that if the given function requires a k-threshold threshold element, then at least [k/2+I] conventional threshold elements in a two-level network or [1+log 2 k] such elements inA multilevel network are required.
Journal of the ACMA Sorting Problem
78 Citations1962R. C. Bose, R. J. Nelson
Two aims of this paper are to find the least number of comparisons needed for sorting n items within the original locations (within the "source file"), 2 and to provide an algorithm employing the leastNumber of comparisons for obtaining a sorted file.
IEEE Transactions on ComputersUnate Cellular Logic
34 Citations1969Amar Mukhopadhyay
This paper is an attempt to develop "minimization algorithms for cellular arrays" for arbitrary switching functions that minimize a set of design parameters like size of the arrays and complexity of the individual cells.
IEEE Transactions on Electronic ComputersCanonical Form and Synthesis of Cellular Cascades
31 Citations1965Harold S. Stone, A. J. Korenjak
The number of realizable functions is greatly increased when the input restriction is relaxed, and it is shown that the fraction of n-variable functions that are realizable becomes vanishingly small as n grows large.
Defense Technical Information Center (DTIC)CELLULAR ARRAYS FOR LOGIC AND STORAGE.
8 Citations1966Robert C. Minnick, Robert Short +3 more
The objective of the research has been to develop techniques for the efficient realization of general logical functions in microcellular arrays--i.e., cellular arrays in which the cells contain a small number of gates.