Accessibility navigation

A parallel quantum histogram architecture

Megson, G.M., Cadenas, J.O., Sherratt, R.S. ORCID:, Huerta, P. and Kao, W.C. (2013) A parallel quantum histogram architecture. IEEE Transactions on Circuits and Systems II, Express Briefs, 60 (7). pp. 437-441. ISSN 1549-7747

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1109/TCSII.2013.2258263


A parallel formulation of an algorithm for the histogram computation of n data items using an on-the-fly data decomposition and a novel quantum-like representation (QR) is developed. The QR transformation separates multiple data read operations from multiple bin update operations thereby making it easier to bind data items into their corresponding histogram bins. Under this model the steps required to compute the histogram is n/s + t steps, where s is a speedup factor and t is associated with pipeline latency. Here, we show that an overall speedup factor, s, is available for up to an eightfold acceleration. Our evaluation also shows that each one of these cells requires less area/time complexity compared to similar proposals found in the literature.

Item Type:Article
Divisions:Life Sciences > School of Biological Sciences > Department of Bio-Engineering
ID Code:32296
Uncontrolled Keywords:Histogram, parallel architectures, parallel algorithms, quantum representation.

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation