|
In chapter 2 of this paper, we proposed a architecture which
was one-bit fault tolerance bidirectional associative memory(
BAM). We input the retrieval vector to the architecture. If any
stored pattern is idential, then it output it''s associative
stored vec- tor. If the first search can''t find any idential
pattern, then the mask vector generator will invert one bit and
keep on search- ing. In the end of the search, it will generate
a succuessful or fail signal. In chapter 3 of this paper, we
utilize pseudo- parallel searching method to ensure the fault
tolerance of the BAM without much loss of the recall speed. The
architecture for the implementation turns out to be scaleable,
regular, and dense design.
|