Implementation of finite lattices in VLSI for fault-state encoding in high-speed networks

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice (partial ordered set with supremum and infimum) is used to describe the necessary operation. It turns out that popular algorithms can be handled this way. Using the properties of lattices efficient plementation options can be found. © 2000 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Döring, A. C., & Lustig, G. (2000). Implementation of finite lattices in VLSI for fault-state encoding in high-speed networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 1266–1275). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_173

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free