A parallel quantum histogram architecture

G. M. Megson, J. O. Cadenas, R. S. Sherratt, P. Huerta, W. C. Kao

研究成果: 雜誌貢獻期刊論文同行評審

1 引文 斯高帕斯(Scopus)

摘要

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 of these cells requires less area/time complexity compared to similar proposals found in the literature.

原文英語
文章編號6508854
頁(從 - 到)437-441
頁數5
期刊IEEE Transactions on Circuits and Systems II: Express Briefs
60
發行號7
DOIs
出版狀態已發佈 - 2013 四月 30

ASJC Scopus subject areas

  • 電氣與電子工程

指紋

深入研究「A parallel quantum histogram architecture」主題。共同形成了獨特的指紋。

引用此