Constant testability for single fault detection in two-dimensional systolic array structures for matrix multiplication

Author(s):  
F. Lombardi ◽  
D. Sciuto ◽  
W. Huang
1992 ◽  
Vol 139 (2) ◽  
pp. 147
Author(s):  
G.A. Orton ◽  
L.E. Peppard ◽  
S.G. Akl

1997 ◽  
Vol 08 (06) ◽  
pp. 1317-1334 ◽  
Author(s):  
Thomas Lippert ◽  
Klaus Schilling ◽  
Sven Trentmann ◽  
Federico Toschi ◽  
Raffaele Tripiccione

We present a parallel FFT algorithm for SIMD systems following the "Transpose Algorithm" approach. The method is based on the assignment of the data field onto a one-dimensional ring of systolic cells. The systolic array can be universally mapped onto any parallel system. In particular for systems with next-neighbor connectivity our method has the potential to improve the efficiency of matrix transposition by use of hyper-systolic communication. We have realized a scalable parallel FFT on the APE100/Quadrics massively parallel computer, where our implementation is part of a two-dimensional hydrodynamics code for turbulence studies.


IEEE Access ◽  
2016 ◽  
Vol 4 ◽  
pp. 5818-5825 ◽  
Author(s):  
Da-Wei Ding ◽  
Xiao-Jian Li ◽  
Yingying Ren ◽  
Fang Qiu

2019 ◽  
Vol 29 (5) ◽  
pp. 321-333
Author(s):  
Kirill A. Popkov

Abstract The following results are proved: any nonconstant Boolean function may be implemented by an irredundant circuit of gates in the basis {x& y, x, x ⊕ y ⊕ z} admitting a single fault detection test of length at most 2 with respect to arbitrary stuck-at faults at outputs of gates, there exists a six-place Boolean function ψ such that any nonconstant Boolean function may be implemented by an irredundant circuit of gates in the basis {ψ} admitting a single diagnostic test of length at most 3 with respect to arbitrary stuck-at faults at outputs of gates.


Sign in / Sign up

Export Citation Format

Share Document