3 September 2009 Implementation of sort-based counters
Author Affiliations +
Abstract
Binary sorting is a well-defined problem that has a range of proposed solutions. Svoboda showed how one particular sorting technique can be used to implement a parallel counter. Among other uses, this type of counter can be used to perform binary multiplication. This paper presents several extensions to Svoboda's work using multi-bit sorting groups as the base building blocks for sorting. Additionally, the existing bitonic sorting algorithm is modeled, synthesized, and compared to Svoboda sorting for a range of word sizes.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ryan Nett, Jay Fletcher, Earl E. Swartzlander, "Implementation of sort-based counters", Proc. SPIE 7444, Mathematics for Signal and Information Processing, 74440R (3 September 2009); doi: 10.1117/12.827306; https://doi.org/10.1117/12.827306
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT


Back to Top