Best-Choice Topology: An Optimized Array-based Maximum Finder

Extracting maximum from an unsorted set of binary elements is important in many signal processing applications. Since quite few maximum-finder implementations are found in the recent literature, in this paper we provide an update on the current topic. Generally, maximum-finders are considered array-based, with parallel bit-by-bit comparison of the elements, or more efficient tree-based structures, with the hierarchical maximum extraction. In this paper, we concentrate on array-based topologies only, since our goal is to propose a new maximum-finder design called Best-Choice Topology (BCT), which is an optimized version of the standard Array Topology (AT). The usual bit-by-bit parallel comparison is applied for extracting the maximum and its one-of-N address. Boolean expressions are derived for BCT logical design and the minimum-finder equivalent. Functionality of the proposed architecture and the reference designs is verified with Xilinx ISE Design Suite 14.5. Synthesis is done on Application Specific Integrated Circuit (ASIC) TSMC 65nm technology. The conclusion of the paper is two-fold. First, we confirm the timing efficiency of BCT compared to AT. Next, we show that BCT is more efficient than the recent maximum-finder design called Maximum Magnitude Generator (MaxMG) and it has a great potential to be used for real-time signal processing applications.

@article{Prvan2019,
  title     = {Best-Choice Topology: An Optimized Array-based Maximum Finder},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {10},
  number    = {12},
  year      = {2019},
  publisher = {The Science and Information Organization},
  author    = {Marina Prvan and Julije Ožegovic and Ivan Soco and Duje Coko},
  doi       = {10.14569/IJACSA.2019.0101203},
  url       = {https://doi.org/10.14569/IJACSA.2019.0101203}
}