Abstract: A data memory arrangement includes n columns of storage elements each column being addressable only one element at a time and having at least n.sup.2 storage elements so as to provide a succession of square arrays. Each square array comprises square sub-sections. On storage of a complementary array of data the data is multiplexed from each square array to the next within each sub-section and after each cycle of such multiplexing the sub-sections are rotated one step cyclically. Such rearrangement of data gives freedom and speed of simultaneous access to data words occurring in original rows and/or columns without excessive penalty in the complexity of the addressing system.