HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Tchernev, E. B. Articles by Phatak, D. S. Search for Related Content PubMed Articles by Tchernev, E. B. Articles by Phatak, D. S.

Perfect Fault Tolerance of the n–k–n Network

etcher1{at}umbc.edu, Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, U.S.A.

Rory G. Mulvaney

rory1{at}umbc.edu, Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, U.S.A.

Dhananjay S. Phatak

phatak{at}umbc.edu, Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, U.S.A.

It was shown in Phatak, Choi, and Koren (1993) that the neural network implementation of the n–k–n encoder-decoder has a minimal size of k=2, and it was shown how to construct the network. A proof was given in Phatak and Koren (1995) that in order to achieve perfect fault tolerance by replicating the hidden layer, the required number of replications is at least three. In this note, exact lower bounds are derived for the number of replications as a function of n, for the n–2–n network and for the n–log₂n–n network.