13463425
Ontogenetic Cellular Hardware for Fault Tolerant Systems
7674451
A Reconfigurable Self-Healing Embryonic Cell Architecture
The long-term goal of our work described in this paper is the development of a biologically-inspired cellular fault-tolerant hardware system. The basic structure of the system is a multi-cellular embryonic array that is capable of achieving self-diagnostics, self-repair and fault recovery. The ‘nucleolus’ of the cell is a general purpose function unit comprised of a 2-to-1 multiplexer and a Dtype flip-flop. Input and configuration data to the function unit are provided by the DNA segment memory and I/O router. A diagnostic logic monitors the error free operation of the cell. When an error is detected the diagnostic logic requests the reconfiguration unit to kill the cell, transferring its function to a fault-free neighbouring cell. Once permission is granted, the faulty cell is eliminated and becomes transparent. The functionality of each cell will shift in the array until a spare cell is found. Finally the whole embryonic array recovers. Fault-free operation is then continued.
2824619
Partial-DNA Supported Artificial-Life in an Embryonic Array
39634221
Repair of the Genetic Material in Biologically Inspired Embryonic-Cell-Based Systems
34247457
Reduced Complexity Interpolation Architecture for Soft-Decision Reed&#8211;Solomon Decoding
Reed-Solomon (RS) codes are one of the most widely utilized block error-correcting codes in modern communication and computer systems. Compared to hard-decision decoding, soft-decision decoding offers considerably higher error-correcting capability. The Koetter-Vardy (KV) soft-decision decoding algorithm can achieve substantial coding gain, while maintaining a complexity polynomial with respect to the code word length. In the KV algorithm, the interpolation step dominates the decoding complexity. A reduced complexity interpolation architecture is proposed in this paper by eliminating the polynomial updating corresponding to zero discrepancy coefficients in this step. Using this architecture, an area reduction of 27% can be achieved over prior efforts for the interpolation step of a typical (255, 239) RS code, while the interpolation latency remains the same
43537984
A performance analysis of a discrete-time queueing system with server interruption for modeling wireless ATM multiplexer
In this paper, we study the effect of channel errors on wireless ATM. The salient characteristic of the wireless channel is that it is time varying. This variability is modeled by a Markov chain with two states corresponding to high and low error states, respectively. The channel is modeled as being synchronous with the basic time unit being the slot. The transitions from high to low error states, and vice versa occur at the slot boundaries. It is assumed that no transmission over the channel is possible during the high-error state.The information source feeding into the channel is modeled as the superposition of independent sources. Each source is controlled by a two-state Markov chain which operates in synchronism with, but statistically independent of the channel. In the source Off state, no data is emitted while, in the On state, the source generates a random number of packets in a slot each of which fits into a channel slot.It is assumed that the traffic generated by all the sources will form a single global queue which will be served by the two-state Markov channel. A discrete-time queuing analysis derives the probability generating function (PGF) of the queue length under the assumption of an infinite buffer. From the PGF, we determine mean queue length and mean delay. Finally, numerical results are presented to demonstrate the effect of wireless channel error characteristics on performance.
15017124
Fault modelling and co-simulation in flowFET-based biological array systems
The area of microelectronic fluidic arrays is rapidly developing into many different commercial products, one being biological arrays. As a consequence, efficient and reliable design and testing of these systems becomes of crucial importance. This paper shows some of the latest results obtained with regard to the flowFET fluidic transfer device, its fault-free and fault modelling, and the co-simulation of a microelectronic fluidic array for life sciences.
21113650
A Discrete-Time Queuing Analysis of the Wireless ATM Multiplexing System
In this paper we analyze a wireless channel model which is subject to service interruption either because the channel is not available or the server is serving to the other users. The wireless channel is modeled by a Markov chain with two states corresponding to high and low error states, respectively. It is assumed that the channel is slotted in time and no transmission is possible during the high-error state. The traffic generated by a mobile user is modeled as the superposition of independent two states On-Off Markov sources, which are statistically independent of the server. A source generates packets only during an On state each of which fits to a channel slot. A discrete-time queuing analysis derives the probability generating function (PGF) of the queue length under the assumption of an infinite buffer. From the PGF, mean queue length, mean delay and approximate finite buffer overflow probabilities are calculated.
27831253
Sparse Matrix Representations in a Functional Language
This paper investigates several sparse matrix representation schemes and associated algorithms in Haskell for solving linear systems of equations arising from solving realistic computational fluid dynamics problems using a finite element algorithm. This work complements that of Wainwright and Sexton (1992) in that a Choleski direct solver (with an emphasis on its forward/backward substitution steps) is examined. Experimental evidence comparing time and space efficiency of these matrix representation schemes is reported, together with associated forward/backward substitution implementations. Our results are in general agreement with Wainwright and Sexton's.