28 research outputs found
Shortening array codes and the perfect 1-factorization conjecture
The existence of a perfect 1-factorization of the complete graph with n nodes, namely, K_n , for arbitrary even number n, is a 40-year-old open problem in graph theory. So far, two infinite families of perfect 1-factorizations have been shown to exist, namely, the factorizations of K_(p+1) and K_2p , where p is an arbitrary prime number (p > 2) . It was shown in previous work that finding a perfect 1-factorization of K_n is related to a problem in coding, specifically, it can be reduced to constructing an MDS (Minimum Distance Separable), lowest density array code. In this paper, a new method for shortening arbitrary array codes is introduced. It is then used to derive the K_(p+1) family of perfect 1-factorization from the K_2p family. Namely, techniques from coding theory are used to prove a new result in graph theory-that the two factorization families are related
Programmable neural logic
Circuits of threshold elements (Boolean input, Boolean output neurons) have been shown to be surprisingly powerful. Useful functions such as XOR, ADD and MULTIPLY can be implemented by such circuits more efficiently than by traditional AND/OR circuits. In view of that, we have designed and built a programmable threshold element. The weights are stored on polysilicon floating gates, providing long-term retention without refresh. The weight value is increased using tunneling and decreased via hot electron injection. A weight is stored on a single transistor allowing the development of dense arrays of threshold elements. A 16-input programmable neuron was fabricated in the standard 2 μm double-poly, analog process available from MOSIS.
We also designed and fabricated the multiple threshold element introduced in [5]. It presents the advantage of reducing the area of the layout from O(n^2) to O(n); (n being the number of variables) for a broad class of Boolean functions, in particular symmetric Boolean functions such as PARITY.
A long term goal of this research is to incorporate programmable single/multiple threshold elements, as building blocks in field programmable gate arrays
Multiple Threshold Neural Logic
We introduce a new Boolean computing element, related to the Boolean version of a
neural element. Instead of the sign function in the Boolean neural element, (also known
as an LT element), it computes an arbitrary (with polynomialy many transitions) Boolean
function of the weighted sum of its inputs. We call the new computing element an LTM
element, which stands for Linear Threshold with Multiple transitions.
The paper consists of the following main contributions related to our study of LTM
circuits: (i) the characterization of the computing power of LTM relative to LT circuits,
(ii) a proof that the area of the VLSI layout, is reduced from O(n to the power of 2) in LT circuits to O(n) in LTM circuits, for n inputs symmetric Boolean functions, and (iii) the creation of efficient
designs of LTM circuits for the addition of a multiple number of integers and the product,
of two integers. In particular, we show how to compute the addition of m integers with a
single layer of LTM elements
On Neural Networks with Minimal Weights
Linear threshold elements are the basic building blocks of artificial
neural networks. A linear threshold element computes a function
that is a sign of a weighted sum of the input variables. The weights
are arbitrary integers: actually, they can be very big integers-
exponential in the number of the input variables. However, in
practice, it is difficult to implement big weights. In the present
literature a distinction is made between the two extreme cases:
linear threshold functions with polynomial-size weights as opposed
to those with exponential-size weights. The main contribution of
this paper is to fill up the gap by further refining that separation.
Namely, we prove that the class of linear threshold functions with
polynomial-size weights can be divided into subclasses according
to the degree of the polynomial. In fact we prove a more general
result-that there exists a minimal weight linear threshold function
for any arbitrary number of inputs and any weight size. To prove
those results we have developed a novel technique for constructing
linear threshold functions with minimal weights
Multiple Threshold Neural Logic
We introduce a new Boolean computing element related to the Linear Threshold element, which is the Boolean version of the neuron. Instead of the sign function, it computes an arbitrary (with polynomialy many transitions) Boolean function of the weighted sum of its inputs. We call the new computing element an LT M element, which stands for Linear Threshold with Multiple transitions.
The paper consists of the following main contributions related to our study of LTM circuits: (i) the creation of efficient designs of LTM circuits for the addition of a multiple number of integers and the product of two integers. In particular, we show how to compute
the addition of m integers with a single layer of LT M elements. (ii) a proof that the area of the VLSI layout is reduced from O(n^2) in LT circuits to O(n) in LTM circuits, for n inputs symmetric Boolean functions, and (iii) the characterization of the computing power of LT M relative to LT circuits
Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
Several physical effects that limit the reliability and performance of multilevel flash memories induce errors that have low magnitudes and are dominantly asymmetric. This paper studies block codes for asymmetric limited-magnitude errors over q-ary channels. We propose code constructions and bounds for such channels when the number of errors is bounded by t and the error magnitudes are bounded by ℓ. The constructions utilize known codes for symmetric errors, over small alphabets, to protect large-alphabet symbols from asymmetric limited-magnitude errors. The encoding and decoding of these codes are performed over the small alphabet whose size depends only on the maximum error magnitude and is independent of the alphabet size of the outer code. Moreover, the size of the codes is shown to exceed the sizes of known codes (for related error models), and asymptotic rate-optimality results are proved. Extensions of the construction are proposed to accommodate variations on the error model and to include systematic codes as a benefit to practical implementation
Algebraic Techniques for Constructing Minimal Weight Threshold Functions
A linear threshold element computes a function that is a sign of a weighted sum of the
input variables. The weights are arbitrary integers; actually, they can be very big integers-
exponential in the number of the input variables. While in the present literature a distinction is
made between the two extreme cases of linear threshold functions with polynomial-size weights
as opposed to those with exponential-size weights, the best known lower bounds on the size
of threshold circuits are for depth-2 circuits with small weights. Our main contributions are
devising two distinct methods for constructing threshold functions with minimal weights and
filling up the gap between polynomial and exponential weight growth by further refining the
separation. Namely, we prove that the class of linear threshold functions with polynomial-size
weights can be divided into subclasses according to the degree of the polynomial. In fact, we
prove a more general result-that there exists a minimal weight linear threshold function for
any arbitrary number of inputs and any weight size
Low-density MDS codes and factors of complete graphs
We present a class of array code of size n×l, where l=2n or 2n+1, called B-Code. The distances of the B-Code and its dual are 3 and l-1, respectively. The B-Code and its dual are optimal in the sense that i) they are maximum-distance separable (MDS), ii) they have an optimal encoding property, i.e., the number of the parity bits that are affected by change of a single information bit is minimal, and iii) they have optimal length. Using a new graph description of the codes, we prove an equivalence relation between the construction of the B-Code (or its dual) and a combinatorial problem known as perfect one-factorization of complete graphs, thus obtaining constructions of two families of the B-Code and its dual, one of which is new. Efficient decoding algorithms are also given, both for erasure correcting and for error correcting. The existence of perfect one-factorizations for every complete graph with an even number of nodes is a 35 years long conjecture in graph theory. The construction of B-Codes of arbitrary odd length will provide an affirmative answer to the conjecture
Trading Weight Size for Circuit Depth: A Circuit for Comparison
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract included in .pdf
document.
We present an explicit construction of a circuit for the COMPARISON function in [...],
the class of polynomial-size linear threshold circuits of depth two with polynomially growing
weights. Goldmann and Karpinski proved that [...] in [4]. Hofmeister presented a
simplified version of the same result in [6]. We have further simplified the results of these two
papers by limiting ourselves to the simulation of COMPARISON. Our construction has size
[...], a significant improvement on the general bound of [...] in [6]