Based on Kosko's bidirectional associative memories (BAM) strategy, a modified bidirectional decoding strategy (MBDS) is introduced. With the aid of the augmented correlation matrix M = [M\M(y)] (or M = [M(T)\M(x)]), the long term memory (LTM) traces T(y) (or T(x)), and the activating function G(y)(.) (or G(x)(.)), we construct the MBDS such that all given training pairs are guaranteed to be recalled successfully. In this paper, we also illustrate some examples for the comparison between the dummy augmentation method of Wang et al., and our MBDS. It is obvious that the MBDS save much more extra connecting weights than the dummy augmentation method.
