Concept

CORDIC

Publications associées (20)

A 16-Channel 60µW Neural Synchrony Processor for Multi-Mode Phase-Locked Neurostimulation

Mahsa Shoaran, Uisub Shin, Cong Ding, Laxmeesha Somappa

Measuring neural oscillatory synchrony facilitates our understanding of complex brain networks and the underlying pathological states. Altering the cross-regional synchrony-as a measure of brain network connectivity-via phase-locked deep brain stimulation ...

IEEE2022

Systems and methods for energy-efficient measurement of neurophysiological oscillations

Mahsa Shoaran, Uisub Shin

A system for measuring synchrony between two or more regions, or within a single region, of a subject's brain. The system can include a signal conditioning module in communication with a phase extraction module. The signal conditioning module can receive a ...

2022

High Performance Computing for gravitational lens modeling: Single vs double precision on GPUs and CPUs

Jean-Paul Richard Kneib, Markus Rexroth

Strong gravitational lensing is a powerful probe of cosmology and the dark matter distribution. Efficient lensing software is already a necessity to fully use its potential and the performance demands will only increase with the upcoming generation of tele ...

ELSEVIER2020

When Is Amplification Necessary for Composition in Randomized Query Complexity?

Mika Tapani Göös

Suppose we have randomized decision trees for an outer function f and an inner function g. The natural approach for obtaining a randomized decision tree for the composed function (f∘ gⁿ)(x¹,…,xⁿ) = f(g(x¹),…,g(xⁿ)) involves amplifying the success probabili ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020

An Inertial Parallel and Asynchronous Forward-Backward Iteration for Distributed Convex Optimization

Colin Neil Jones, Georgios Stathopoulos

Two characteristics that make convex decomposition algorithms attractive are simplicity of operations and generation of parallelizable structures. In principle, these schemes require that all coordinates update at the same time, i.e., they are synchronous ...

SPRINGER/PLENUM PUBLISHERS2019

Design of approximate and precision-scalable circuits for embedded multimedia and neural-network processing

Vincent Frédéric Camus

Density, speed and energy efficiency of integrated circuits have been increasing exponentially for the last four decades following Moore's law. However, power and reliability pose several challenges to the future of technology scaling. Approximate computin ...

EPFL2019

A 10b SAR ADC with Widely Scalable Sampling Rate and AGC Amplifier Front-End

Seyed Armin Tajalli, Yusuf Leblebici, Firat Çelik, Ayça Akkaya

This paper presents a low power successive approximation register (SAR) ADC and its front-end automatic gain control (AGC) amplifier designed in 65nm CMOS technology. Digitally controlled variable gain amplifier (VGA) in AGC loop is used to maximize the dy ...

IEEE2018

CM values of higher Green's functions and regularized Petersson products

Maryna Viazovska

Higher Green functions are real-valued functions of two variables on the upper half-plane, which are bi-invariant under the action of a congruence subgroup, have a logarithmic singularity along the diagonal, and satisfy the equation f = k(1−k) f ; here i ...

Cambridge UP2015

Extracting partial decay rates of helium from complex rotation: autoionizing resonances of the one-dimensional configurations

Pierre Lugan

Partial autoionization rates of doubly excited one-dimensional helium in the collinear Zee and eZe configuration are obtained by means of the complex rotation method. The approach presented here relies on a projection of back-rotated resonance wave functio ...

Iop Publishing Ltd2015

On grids in topological graphs

János Pach

A topological graph G is a graph drawn in the plane with vertices represented by points and edges represented by continuous arcs connecting the vertices. If every edge is drawn as a straight-line segment, then G is called a geometric graph. A k-grid in a t ...

Elsevier Science Bv2014

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search