An n-input sorting network can be used to implement all n-variable symmetric threshold functions. It is shown that a systolic bubble sorting network can be tested for all single stuck-at faults by carrying out only 2n tests.
References
-
-
1)
-
Ch. Chakrabarti ,
L.-Y. Wang
.
Novel sorting network-based architectures for rank order filters.
IEEE Trans. VLSI Syst.
,
502 -
507
-
2)
-
S.J. Piestrak
.
Design of encoders and self-testing checkers for some systematic unidirectionalerror detecting codes.
Int. J. Microelectron. Syst. Integration
,
4 ,
246 -
260
-
3)
-
Piestrak, S.J.: `Membership test logic for delay-insensitive codes', Proc. Int. Symp. Advanced Research in Asynchronous Circuitsand Systems, 1998, IEEE Press, p. 194–204.
-
4)
-
S.J. Piestrak
.
The minimal test set for multi-output threshold circuits implementedas sorting networks.
IEEE Trans. Comput.
,
700 -
712
-
5)
-
D.E. Knuth
.
(1998)
The art of computer programming, Vol. III: Sorting and searching.
-
6)
-
Batcher, K.E.: `Sorting networks and their applications', Proc. 1968 SJCC, AFIPS, 1968, 32, p. 307–314.
-
7)
-
Van Voorhis, D.C.: `An economical construction for sorting networks', Proc. AFIPS NCC, 1974, p. 921–927.
-
8)
-
S.J. Piestrak
.
Design of residue generators and multioperand adders modulo-3 built ofmulti-output threshold circuits.
IEE Proc. Comput. Digital Tech.
,
129 -
134
-
9)
-
Piestrak, S.J.: `The minimal test set for sorting networks and the use of sorting networksin self-testing checkers for unordered codes', Dig. Pap. 20th Int. Symp. on Fault-Tolerant Computing, 1990, p. 467–474.
-
10)
-
Piestrak, S.J.:‘Design of self-testing checkers for unidirectional error detecting codes’.Scientific Papers of Inst. of Tech. Cybern. of Tech. Univ. of Wroclaw, No. 92, Ser.: Monographs No.24, Oficyna Wyd. Polit. Wrocl., Wroclaw 1995.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20000226
Related content
content/journals/10.1049/el_20000226
pub_keyword,iet_inspecKeyword,pub_concept
6
6