Share Email Print

Proceedings Paper

Implementation of sort-based counters
Author(s): Ryan Nett; Jay Fletcher; Earl E. Swartzlander
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 3 September 2009
PDF: 10 pages
Proc. SPIE 7444, Mathematics for Signal and Information Processing, 74440R (3 September 2009); doi: 10.1117/12.827306
Show Author Affiliations
Ryan Nett, IBM (United States)
Jay Fletcher, AMD (United States)
Earl E. Swartzlander, The Univ. of Texas at Austin (United States)

Published in SPIE Proceedings Vol. 7444:
Mathematics for Signal and Information Processing
Franklin T. Luk; Mark S. Schmalz; Gerhard X. Ritter; Junior Barrera; Jaakko T. Astola, Editor(s)

© SPIE. Terms of Use
Back to Top