(Solved): 3. Vectors a(1)=[1111] and a(2)=[1111] repre ...

???????

3. Vectors $$a^{(1)}=\left[\begin{array}{llll}1& ?1& 1& 1\end{array}\right]$$ and $$a^{(2)}=\left[\begin{array}{llll}?1& 1& ?1& 1\end{array}\right]$$ represent the bit map shown below. They need to be associated for input vectors at $$\mathrm{HD}=1$$ from the prototypes stored (HD stands for Hemming Distance). Design the following two autoassociators: i- a linear autoassociator in the form of a linear associative memory with added thresholding element (TLU) at the output, if needed, but no feedback ii- a recurrent autoassociative memory with asynchronous updating. Compare the performance of both networks by evaluating responses to eight input ectors at $$\mathrm{HD}=1$$ from $$a^{(1)}$$ and $$a^{(2)}$$. The nodes of the memory designed in part (b) should e updated in ascending order starting at node 1 .