Learn More
This paper presents an efficient concurrent failure detection method for pipelined asynchronous circuits. We first validate permanent and transient fault modeling in clockless systems. By augmenting the rails to each data channel and adding extra logic to each circuit module, we make pipelined asynchronous circuits achieve fail-stop with respect to hard or(More)
This paper presents a systematic method for the design of a self-healing asynchronous adder. We propose a graph-based model for the design of a fault-tolerant linear array with external inputs and outputs with a minimum number of spare resources. A K-fault-tolerant asynchronous adder design is presented based on this analysis, together with the necessary(More)
Field programmable gate arrays (FPGA) are widely used for their versatility and programmability in place of custom-designed circuits. Their flexibility comes at a cost of density: supporting programmable logic incurs a significant overhead in configuration logic and interconnect, relative to custom logic. The dominance and criticality of interconnect(More)
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs between implementation complexity and data compression ratios. Our main motivation lies within the field of compressed memory computer systems. Here requirements include extremely fast(More)
This paper presents a systematic method for designing of a self-healing asynchronous array in the presence of errors. By adding spare resources in one of three different ways and forcing the asynchronous circuit to stall in case of failure, the specific self-reconfiguration logic is activated by a deadlock detector and the array circuit can be reconfigured(More)
The Particle Swarm Optimization algorithm is improved and used in the global navigation points planning, to get the global path in the remote control system of the lunar rover. In the improved algorithm, the velocity inertial weight is deleted, but the self and society cognitive coefficients are kept, with the aim to make the algorithm converge quickly in(More)
Summary form only given. Many researchers use a home-based lazy release consistent protocol (HLRC) to provide a simple, effective, and scalable way to build software distributed shared memory (DSM) systems. However, the performance of HLRC is notoriously sensitive to the initial page distribution among home nodes. We propose an adaptive HLRC protocol in(More)
In wireless sensor networks (WSNs), key management is the crucial aspect in its secure mechanism. Recently, many research on key management for WSNs are proposed by some predecessors. However, many schemes require the predeployment knowledge to generate keys, which is unrealistic in large-scale and dynamic sensor networks. A new key management scheme is(More)