Search results for "asynchronous"
showing 10 items of 82 documents
Live demonstration: multiplexing AER asynchronous channels over LVDS Links with Flow-Control and Clock-Correction for Scalable Neuromorphic Systems
2017
Paper presented at the 2017 IEEE International Symposium on Circuits and Systems (ISCAS), held in Baltimore, MD, USA, on 28-31 May 2017.
On Multiple AER Handshaking Channels Over High-Speed Bit-Serial Bidirectional LVDS Links With Flow-Control and Clock-Correction on Commercial FPGAs f…
2017
Address event representation (AER) is a widely employed asynchronous technique for interchanging “neural spikes” between different hardware elements in neuromorphic systems. Each neuron or cell in a chip or a system is assigned an address (or ID), which is typically communicated through a high-speed digital bus, thus time-multiplexing a high number of neural connections. Conventional AER links use parallel physical wires together with a pair of handshaking signals (request and acknowledge). In this paper, we present a fully serial implementation using bidirectional SATA connectors with a pair of low-voltage differential signaling (LVDS) wires for each direction. The proposed implementation …
ACT-MAC: An asynchronous cooperative transmission MAC protocol for WSNs
2014
Duty cycling (DC) has been proven to be an efficient mechanism to reduce energy consumption in wireless sensor networks (WSNs). On the other hand, cooperative transmission (CT) enables longer range transmission to hop over an energy-hole node, resulting in more balanced energy consumption among nodes. In the literature, there exist few CT MAC protocols for DC operated WSNs and these protocols rely on fixed cycle length. In this paper, we propose a novel variable cycle length protocol, namely asynchronous cooperative transmission medium access control (ACT-MAC), which contains both features of reducing the unnecessary idle listening by DC and mitigating the energy-hole by making use of CT. T…
Does Wake-Up Radio Always Consume Lower Energy Than Duty-Cycled Protocols?
2017
Many recent studies anticipate that wake-up radio (WuR) will replace traditional duty-cycled (DC) protocols given its overwhelming performance superiority on energy consumption. Meanwhile, the question on whether WuR performs always better than DC protocols has not been answered explicitly. In this paper, we investigate in-depth the energy consumption performance of WuR by considering various levels of traffic load in a wireless sensor network. By comparing SCM-WuR with both synchronous MAC (S-MAC) and asynchronous MAC (X-MAC), we ascertain that SCM-WuR does consume orders of magnitude lowerenergythanDCprotocolswhentrafficloadislow.Howe ver, our numerical results reveal at the same time that …
Stabilization and controller design of 2D discrete switched systems with state delays under asynchronous switching
2013
Published version of a paper from the journal: Abstract and Applied Analysis. Also available from Hindawi:http://dx.doi.org/10.1155/2013/961870. Open Access This paper is concerned with the problem of robust stabilization for a class of uncertain two-dimensional (2D) discrete switched systems with state delays under asynchronous switching. The asynchronous switching here means that the switching instants of the controller experience delays with respect to those of the system. The parameter uncertainties are assumed to be norm-bounded. A state feedback controller is proposed to guarantee the exponential stability. The dwell time approach is utilized for the stability analysis and controller …
Perceived Sociability and Social Presence in a Collaborative Serious Game
2013
Collaborative serious games have proven to have the potential to support joint knowledge construction, and there is a growing interest in applying such games to promote high-level learning. However, most of the existing studies have focused on the effects of functional, task-specific support while ignoring the social aspects of collaborative learning. This study is one aim to fill in the knowledge gap in order to understand how learners experience educational games as a means of social interaction and collaboration. The findings indicated that the game environment facilitated and supported players’ socio-emotional processes by eliciting students’ social presence and sociability. This has be…
Multi-user interference mitigation under limited feedback requirements for WCDMA systems with base station cooperation
2016
One of the techniques that has been recently identified for dealing with multi-user interference (MUI) in future communications systems is base station (BS) cooperation or joint processing. However, perfect MUI cancellation with this technique demands severe synchronization requirements, perfect and global channel state information (CSI), and an increased backhaul and signaling overhead. In this paper, we consider a more realistic layout with the aim of mitigating the MUI, where only local CSI is available at the BSs. Due to synchronization inaccuracies and errors in the channel estimation, the system becomes partially asynchronous. In the downlink of wideband code division multiple access …
EEG data acquisition system based on asynchronous sigma-delta modulator
2012
This paper describes a multichannel mobile EEG data acquisition system that consists of on-head sensors with built in electroencephalogram (EEG) signal amplifier, asynchronous sigma-delta modulator (ASDM) for analog to digital conversion and 434MHz On-Off keying (OOK) wireless data transmitter. A prototype circuit has been designed and fabricated in a 11×16mm cylinder package. After receiving the signal, appropriate processing is applied in order to reconstruct the brain wave signals.
The Asynchronous Leontief Model
1992
International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…