Sciweavers

43 search results - page 3 / 9
» dft 2007
Sort
View
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
13 years 11 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
13 years 11 months ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
DFT
2007
IEEE
104views VLSI» more  DFT 2007»
13 years 11 months ago
Reduction of Fault Latency in Sequential Circuits by using Decomposition
The paper discusses a novel approach for reduction of fault detection latency in a selfchecking sequential circuit. The Authors propose decomposing the finite state machine (FSM) ...
Ilya Levin, Benjamin Abramov, Vladimir Ostrovsky
DFT
2007
IEEE
95views VLSI» more  DFT 2007»
13 years 11 months ago
Fault Tolerant Source Routing for Network-on-Chip
This paper presents a new routing protocol of network-on-chip(Noc) called ‘Source Routing for Noc’(SRN) for fault tolerant communication of Systems-on-chip(Soc). The proposed ...
Young Bok Kim, Yong-Bin Kim
DFT
2007
IEEE
86views VLSI» more  DFT 2007»
13 years 11 months ago
Production Yield and Self-Configuration in the Future Massively Defective Nanochips
We address two problems in this work, namely, 1) the resilience challenge in the future chips made up of massively defective nanoelements and organized in replicative multicore ar...
Piotr Zajac, Jacques Henri Collet