Implementation of sort-based counters

Ryan Nett; Jay Fletcher; Earl E. Swartzlander Jr.

doi:10.1117/12.827306

3 September 2009 Implementation of sort-based counters

Ryan Nett, Jay Fletcher, Earl E. Swartzlander Jr.

Proceedings Volume 7444, Mathematics for Signal and Information Processing; 74440R (2009) https://doi.org/10.1117/12.827306
Event: SPIE Optical Engineering + Applications, 2009, San Diego, California, United States

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.

Citation Download Citation

Ryan Nett, Jay Fletcher, and Earl E. Swartzlander Jr. "Implementation of sort-based counters", Proc. SPIE 7444, Mathematics for Signal and Information Processing, 74440R (3 September 2009); https://doi.org/10.1117/12.827306

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available