SearcharxivSearch

arXiv subjects

Cheng-Jui Yeh

Publications and source records attributed to Cheng-Jui Yeh.

2 recordsLinked to original sources

CIMulator: A Comprehensive Simulation Platform for Computing-In-Memory Circuit Macros with Low Bit-Width and Real Memory Materials

This paper presents a simulation platform, namely CIMulator, for quantifying the efficacy of various synaptic devices in neuromorphic accelerators for different neural network architectures. Nonvolatile memory devices, such as resistive random-access memory, ferroelectric field-effect transistor, and volatile static random-access memory devices, can be selected as synaptic devices. A multilayer perceptron and convolutional neural networks (CNNs), such as LeNet-5, VGG-16, and a custom CNN named C4W-1, are simulated to evaluate the effects of these synaptic devices on the training and inference outcomes. The dataset used in the simulations are MNIST, CIFAR-10, and a white blood cell dataset. By applying batch normalization and appropriate optimizers in the training phase, neuromorphic systems with very low-bit-width or binary weights could achieve high pattern recognition rates that approach software-based CNN accuracy. We also introduce spiking neural networks with RRAM-based synaptic devices for the recognition of MNIST handwritten digits.

cs.NE

Improvement of generalization of Larman-Rogers-Seidel's theorem

A finite set $X$ in the $d$-dimensional Euclidean space is called an $s$-distance set if the set of distances between any two distinct points of $X$ has size $s$. In 1977, Larman-Rogers-Seidel proved that if the cardinality of an two-distance set is large enough, then there exists an integer $k$ such that the two distances $α$, $β$ $(α< β)$ having the integer condition, namely, $\frac{α^2}{β^2}=\frac{k-1}{k}$. In 2011, Nozaki generalized Larman-Rogers-Seidel's theorem to the case of $s$-distance sets, i.e. if the cardinality of an $s$-distance set $|X|\geqslant 2N$ with distances $α_1,α_2,\cdots,α_s$, where $N=\binom{d+s-1}{s-1}+\binom{d+s-2}{s-2}$, then the numbers $k_i=\prod_{j=1,2,\cdots,s,\text{ }j\neq i}\frac{α_{j}^{2}}{α_{j}^{2}-α_{i}^{2}}$ are integers. In this note, we reduce the lower bound of the requirement of integer condition of $s$-distance sets in $\mathbb{R}^d$. Furthermore, we can show that there are only finitely many $s$-distance sets $X$ in $\mathbb{R}^d$ with $|X|\geqslant 2\binom{d+s-1}{s-1}.$

math.CO