Memristor-based parallel sorting approach using one-dimensional cellular automata

Abstract

A novel memristor-based circuit-level cellular automata (CA)-inspired approach to the solution of the classic sorting problem of n Keys in a linear array is presented. The presented system utilises the structural simplicity of CA combined with the threshold-type switching behaviour of memristors and composite memristive components; the latter is used for both information encoding and computation. The focus is on a threshold-type model for memristors for the implementation of the fundamental CA cell and the overall CA operation is verified via simulations.