Simultaneous neighbourhood value access from a single instance storage on multiple memory banks

This paper presents a multiple memory bank approach to allow parallel access to the current and neighbourhood pixel values. The storage requirement of the multiple bank implementation is the same as a single bank implementation by using a graph-based memory bank addressing scheme. This scheme uses the pixel locations to determine bank and location within the bank. Using this scheme, the bank is determined through the use of simple logic on selected bits from the binary representation of that pixel location in Cartesian representation while the location within the bank is determined by a combination of the remaining bits. In short, this paper presents an efficient storage method that allows parallel access to current and neighbourhood pixel values of any scanning order with minimal overhead.