Modeling of Narasimha and Peterson DCT algorithm on radix-2 and higher radix de Bruijn graph connected multiprocessors

Discrete cosine transform (DCT) is one of the most popular and efficient transforms for image compression. It is widely accepted as the best substitute for Karhunen Loeve transform (KLT) among the realizable fast transforms. A number of fast transforms have been proposed in the literature for computing DCT by reducing the number of computations. In this paper, Narasimha and Peterson´s method for computation of DCT has been considered for modeling on de Bruijn graph connected multiprocessor system. The de Bruijn graph system has been considered for implementation since it can be configured as a hypercube network with reduced communication. Mathematical modeling has been performed and a number of performance equations have been developed. A detailed analysis has been carried out to study the effect of radix on the performance of de Bruijn graph connected multiprocessor system.