Bit-serial parallel processing unit for the histogramming operation

Abstract

Using the odd-even network topology, a parallel bit-level pipelined VLSI processing unit is designed for the histogramming operation. In this approach, histogramming is divided into two stages, the counting and marking process and the filtering process. The filtering process is computationally inexpensive compared to the counting and marking phase. The proposed processing unit is composed of one type of bit-serial structure (processing elements) operating in parallel. The architecture and VLSI implementation of the processing unit are considered. The performance of the design is compared with the implementation of the histogramming operation on the massively parallel processor. The comparative analysis shows that the odd-even-network-based approach has significant advantages in terms of both processing speed and performance/cost ratio. The use of a histogramming unit of fixed size to handle a large number of pixels is also discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>