On the area-time optimal design of l-selectors

Clark D. Thompson, Hiroto Yasuura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

We prove upper and lower bounds on the area-time complexity of the problem of selecting the l-th smallest of n k-bit integers. When chip area is restricted to Θ(n), our O (k logn)-time circuit is provably area-time optimal to within a factor of O (logn). We present several circuit constructions having area other than Θ(n), but these are typically a factor of O(1) from area-time optimality. The development of tight upper and lower bounds for l-selectors of nonlinear area is thus an open problem.

Original languageEnglish
Title of host publicationConference Record - 19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985
EditorsDonald E. Kirk
PublisherIEEE Computer Society
Pages365-368
Number of pages4
ISBN (Electronic)0818607297
DOIs
Publication statusPublished - Jan 1 1985
Externally publishedYes
Event19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985 - Pacific Grove, United States
Duration: Nov 6 1985Nov 8 1985

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Conference

Conference19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985
CountryUnited States
CityPacific Grove
Period11/6/8511/8/85

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'On the area-time optimal design of l-selectors'. Together they form a unique fingerprint.

  • Cite this

    Thompson, C. D., & Yasuura, H. (1985). On the area-time optimal design of l-selectors. In D. E. Kirk (Ed.), Conference Record - 19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985 (pp. 365-368). [671482] (Conference Record - Asilomar Conference on Signals, Systems and Computers). IEEE Computer Society. https://doi.org/10.1109/ACSSC.1985.671482