Search results for "Circuits"
showing 10 items of 358 documents
Online Non-linear Topology Identification from Graph-connected Time Series
2021
Estimating the unknown causal dependencies among graph-connected time series plays an important role in many applications, such as sensor network analysis, signal processing over cyber-physical systems, and finance engineering. Inference of such causal dependencies, often know as topology identification, is not well studied for non-linear non-stationary systems, and most of the existing methods are batch-based which are not capable of handling streaming sensor signals. In this paper, we propose an online kernel-based algorithm for topology estimation of non-linear vector autoregressive time series by solving a sparse online optimization framework using the composite objective mirror descent…
An interface protection system based on an embedded metrology system platform
2021
Abstract The aim of this work is to present an interface protection system (IPS) for Distributed Generators (DG) and Energy Storage Systems (ESS). The new prototype of IPS guarantees standard protection requirements, in terms of both voltage and frequency measurement accuracies and trip times. Moreover, it has the additional functionalities of implementing a communication link between the Distribution System Operator (DSO) and the DG and ESS Inverter. The new IPS is based on a smart meter platform with an integrated power line communication modem. Moreover, it has also an integrated metrology section. Experimental tests will show how this last feature allows a significant reduction of the m…
Impact of centrality on cooperative processes
2016
The solution of today's complex problems requires the grouping of task forces whose members are usually connected remotely over long physical distances and different time zones. Hence, understanding the effects of imposed communication patterns (i.e., who can communicate with whom) on group performance is important. Here, we use an agent-based model to explore the influence of the betweenness centrality of the nodes on the time the group requires to find the global maxima of NK-fitness landscapes. The agents cooperate by broadcasting messages, informing on their fitness to their neighbors, and use this information to copy the more successful agents in their neighborhood. We find that for ea…
Topology of correlation-based minimal spanning trees in real and model markets
2003
We present here a topological characterization of the minimal spanning tree that can be obtained by considering the price return correlations of stocks traded in a financial market. We compare the minimal spanning tree obtained from a large group of stocks traded at the New York Stock Exchange during a 12-year trading period with the one obtained from surrogated data simulated by using simple market models. We find that the empirical tree has features of a complex network that cannot be reproduced, even as a first approximation, by a random market model and by the one-factor model.
Measurement technique for real-time and low-cost biosensing using photonic bandgap structures
2011
We present a sensing technique based on using photonic bandgap structures where only the output power is monitored, without the need of tunable sources or spectrum analyzers, thus providing a real-time and low-cost system.
Optimization of Reactive Force Field Simulation: Refactor, Parallelization, and Vectorization for Interactions
2022
Molecular dynamics (MD) simulations are playing an increasingly important role in many areas ranging from chemical materials to biological molecules. With the continuing development of MD models, the potentials are getting larger and more complex. In this article, we focus on the reactive force field (ReaxFF) potential from LAMMPS to optimize the computation of interactions. We present our efforts on refactoring for neighbor list building, bond order computation, as well as valence angles and torsion angles computation. After redesigning these kernels, we develop a vectorized implementation for non-bonded interactions, which is nearly $100 \times$ 100 × faster than the management processing…
Digital background calibration algorithm and its FPGA implementation for timing mismatch correction of time-interleaved ADC
2019
Sample time error can degrade the performance of time-interleaved analog to digital converters (TIADCs). A fully digital background algorithm is presented in this paper to estimate and correct the timing mismatch errors between four interleaved channels, together with its hardware implementation. The proposed algorithm provides low computation burden and high performance. It is based on the simplified representation of the coefficients of the Lagrange interpolator. Simulation results show that it can suppress error tones in all of the Nyquist band. Results show that, for a four-channel TIADC with 10-bit resolution, the proposed algorithm improves the signal to noise and distortion ratio (SN…
Magnetic domain-wall racetrack memory for high density and fast data storage
2012
The racetrack memory device is a new concept of Magnetic RAM (MRAM) based on controlling domain wall (DW) motion in ferromagnetic nanowires. It promises ultra-high storage density thanks to the possibility to store multiple narrow DWS per memory cell. By using read and write heads based on magnetic tunnel junctions (MTJ) with perpendicular magnetic anisotropy (PMA) fast data access speed can also be achieved. Thereby the racetrack memory can be used as universal storage to address both embedded and standalone applications. In this paper, we present the device physics, integration circuit and architecture designs of a racetrack memory based on MTJs with PMA. Mixed SPICE simulations at 65 nm …
An Efficient Implementation of Distributed Routing Algorithms for NoCs
2008
The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (logic-based distributed routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most …
Atypical transistor-based chaotic oscillators: Design, realization, and diversity
2017
In this paper, we show that novel autonomous chaotic oscillators based on one or two bipolar junction transistors and a limited number of passive components can be obtained via random search with suitable heuristics. Chaos is a pervasive occurrence in these circuits, particularly after manual adjustment of a variable resistor placed in series with the supply voltage source. Following this approach, 49 unique circuits generating chaotic signals when physically realized were designed, representing the largest collection of circuits of this kind to date. These circuits are atypical as they do not trivially map onto known topologies or variations thereof. They feature diverse spectra and predom…