Publication

EU COST Action IC1401-Pushing the Frontiers of Memristive Devices to Systems

Sandro Carrara
2016
Conference Papers

Abstract

European Union COST Actions provide the opportunity for researchers who are geographically dispersed to work together towards an ambitious, multidisciplinary goal, whilst learning from each other and avoiding effort duplication. This paper gives a brief overview of work done by, but not limited to, members of EU COST Action IC1401. The presented work summary is organized around the four workgroups that tackle devices, circuit theory, circuit implementations, bioinspired and sensory systems.

Official source

https://infoscience.epfl.ch/entities/publication/71d19884-a476-498a-b053-507ae0e69cb1

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Sandro Carrara
2016
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/71d19884-a476-498a-b053-507ae0e69cb1

About this result

Related concepts (16)

Switching circuit theory

Switching circuit theory is the mathematical study of the properties of networks of idealized switches. Such networks may be strictly combinational logic, in which their output state is only a function of the present state of their inputs; or may also contain sequential elements, where the present state depends on the present state and past states; in that sense, sequential circuits are said to include "memory" of past states. An important class of sequential circuits are state machines.

Circuit complexity

In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits (see below). Proving lower bounds on size of Boolean circuits computing explicit Boolean functions is a popular approach to separating complexity classes.

Circuit (computer science)

In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes a function. Circuits of this kind provide a generalization of Boolean circuits and a mathematical model for digital logic circuits. Circuits are defined by the gates they contain and the values the gates can produce. For example, the values in a Boolean circuit are boolean values, and the circuit includes conjunction, disjunction, and negation gates.

Related publications (31)

Hearing structure in music: An empirical inquiry into listening as representation and processing

Gabriele Cecchetti

As a universal expression of human creativity, music is capable of conveying great subtlety and complexity. Crucially, this complexity is not encoded in the score or in the sounds, but is rather construed in the mind of the listener in the form of nuanced ...

EPFL2024

Emulating Multimemristive Behavior of Silicon Nanowire-Based Biosensors by Using CMOS-Based Implementations

Sandro Carrara, Junrui Chen, Kapil Bhardwaj

The research presented in this article draws inspiration from previous efforts aimed at replicating the functions of various solid-state memristors using a variety of materials. The memristor circuit emulator serves as a cost-effective tool for circuit des ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Neuronal correlates of goal-directed sensorimotor transformation in sensory, motor and higher-order cortical areas

Anastasiia Oryshchuk

An important function of the brain is to interpret incoming sensory information from the outside world to guide adaptive behavior. Understanding how and where sensory information is transformed into motor commands in a context- and learning-dependent manne ...

EPFL2023