Computer Science

A content-addressable-memory compares an input search word against all rows of stored words in an array in a highly parallel manner. While supplying a very powerful functionality for many applications in pattern matching and search, it suffers from large area, cost and power consumption, limiting its use. Past improvements have been realized by using memristors to replace the static-random-access-memory cell in conventional designs, but employ similar schemes based only on binary or ternary states for storage and search. We propose a new analog content-addressable-memory concept and circuit to overcome these limitations by utilizing the analog conductance tunability of memristors. Our analog content-addressable-memory stores data within the programmable conductance and can take as input either analog or digital search values. Experimental demonstrations, scaled simulations and analysis show that our analog content-addressable-memory can reduce area and power consumption, which enables the acceleration of existing applications, but also new computing application areas.

Recording reliably extracellular neural activities isan essential prerequisite for the development of bioelectronicsand neuroprosthetic applications. Recently, a fully differential,2-stage, integrating pre-amplifier was proposed for amplifyingand then digitising neural signals. The amplifier featured a finelytuneable offset that was used as a variable threshold detector.Given that the amplifier is integrating, the DC operating pointkeeps changing during integration, rendering traditional analysis(AC/DC) unsuitable. In this work, we analyse the operation ofthis circuit and propose alternative definitions for validating thenecessary key performance metrics, including: gain, bandwidth,offset tuning range and offset sensitivity with respect to thememory states of the employed memristors. The amplificationprocess is analysed largely through investigating the transientbehaviour during the integration phase. This benchmarkingapproach is finally leveraged for providing useful insights anddesign trade-offs of the memristor-based integrating amplifier.

This paper focuses on the derivation of the distribution of diffused particles absorbed by an agent in a bounded environment. In particular, we analogously consider to derive the impulse response of a molecular communication channel in 2-D and 3-D environment. In 2-D, the channel involves a point transmitter that releases molecules to a circular absorbing receiver that absorbs incoming molecules in an environment surrounded by a circular reflecting boundary. Considering this setup, the joint distribution of the molecules on the circular absorbing receiver with respect to time and angle is derived. Using this distribution, the channel characteristics are examined. Furthermore, we also extend this channel model to 3-D using a cylindrical receiver and investigate the channel properties. We also propose how to obtain an analytical solution for the unbounded 2-D channel from our derived solutions, as no analytical derivation for this channel is present in the literature.

As cost and performance benefits associated with Moore's Law scaling slow, researchers are studying alternative architectures (e.g., based on analog and/or spiking circuits) and/or computational models (e.g., convolutional and recurrent neural networks) to perform application-level tasks faster, more energy efficiently, and/or more accurately. We investigate cellular neural network (CeNN)-based co-processors at the application-level for these metrics. While it is well-known that CeNNs can be well-suited for spatio-temporal information processing, few (if any) studies have quantified the energy/delay/accuracy of a CeNN-friendly algorithm and compared the CeNN-based approach to the best von Neumann algorithm at the application level. We present an evaluation framework for such studies. As a case study, a CeNN-friendly target-tracking algorithm was developed and mapped to an array architecture developed in conjunction with the algorithm. We compare the energy, delay, and accuracy of our architecture/algorithm (assuming all overheads) to the most accurate von Neumann algorithm (Struck). Von Neumann CPU data is measured on an Intel i5 chip. The CeNN approach is capable of matching the accuracy of Struck, and can offer approximately 1000x improvements in energy-delay product.

In recent years, progresses in nanotechnology have established the foundations for implementing nanomachines capable of carrying out simple but significant tasks. Under this stimulus, researchers have been proposing various solutions for realizing nanoscale communications, considering both electromagnetic and biological communications. Their aim is to extend the capabilities of nanodevices, so as to enable the execution of more complex tasks by means of mutual coordination, achievable through communications. However, although most of these proposals show how devices can communicate at the nanoscales, they leave in the background specific applications of these new technologies. Thus, this paper shows an overview of the actual and potential applications that can rely on a specific class of such communications techniques, commonly referred to as molecular communications. In particular, we focus on health-related applications. This decision is due to the rapidly increasing interests of research communities and companies to minimally invasive, biocompatible, and targeted health-care solutions. Molecular communication techniques have actually the potentials of becoming the main technology for implementing advanced medical solution. Hence, in this paper we provide a taxonomy of potential applications, illustrate them in some details, along with the existing open challenges for them to be actually deployed, and draw future perspectives.

The class of problems represented by frustrated cluster loops, FCL, is a robust set of problems that spans a wide range of computational difficulty and that are easy to determine what their solutions are. Here, we use frustrated cluster loops to test the relative performance of the D-Wave without post-processing and the D-Wave with multi-qubit correction (MQC) post-processing. MQC post-processing has shown itself exceptionally beneficial in improving the performance of the D-Wave 2000Q when processing difficult FCL problems.

Probabilistic Neural Network (PNN) is a feed-forward artificial neural network developed for solving classification problems. This paper proposes a hardware implementation of an approximated PNN (APNN) algorithm in which the conventional exponential function of the PNN is replaced with gated threshold logic. The weights of the PNN are approximated using a memristive crossbar architecture. In particular, the proposed algorithm performs normalization of the training weights, and quantization into 16 levels which significantly reduces the complexity of the circuit.

There has been an increasing demand for formal methods in the design process of safety-critical synthetic genetic circuits. Probabilistic model checking techniques have demonstrated significant potential in analyzing the intrinsic probabilistic behaviors of complex genetic circuit designs. However, its inability to scale limits its applicability in practice. This chapter addresses the scalability problem by presenting a state-space approximation method to remove unlikely states resulting in a reduced, finite state representation of the infinite-state continuous-time Markov chain that is amenable to probabilistic model checking. The proposed method is evaluated on a design of a genetic toggle switch. Comparisons with another state-of-art tool demonstrates both accuracy and efficiency of the presented method.

Optical and optoelectronic approaches of performing matrix-vector multiplication (MVM) operations have shown the great promise of accelerating machine learning (ML) algorithms with unprecedented performance. The incorporation of nanomaterials into the system can further improve the performance thanks to their extraordinary properties, but the non-uniformity and variation of nanostructures in the macroscopic scale pose severe limitations for large-scale hardware deployment. Here, we report a new optoelectronic architecture consisting of spatial light modulators and photodetector arrays made from graphene to perform MVM. The ultrahigh carrier mobility of graphene, nearly-zero-power-consumption electro-optic control, and extreme parallelism suggest ultrahigh data throughput and ultralow-power consumption. Moreover, we develop a methodology of performing accurate calculations with imperfect components, laying the foundation for scalable systems. Finally, we perform a few representative ML algorithms, including singular value decomposition, support vector machine, and deep neural networks, to show the versatility and generality of our platform.

When solving propositional logic satisfiability (specifically 3SAT) using quantum annealing, we analyze the effect the difficulty of different instances of the problem has on the quality of the answer returned by the quantum annealer. A high-quality response from the annealer in this case is defined by a high percentage of correct solutions among the returned answers. We show that the phase transition regarding the computational complexity of the problem, which is well-known to occur for 3SAT on classical machines (where it causes a detrimental increase in runtime), persists in some form (but possibly to a lesser extent) for quantum annealing.