On the area-time optimal design of l-selectors

Clark D. Thompson, Hiroto Yasuura

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

10 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルConference Record - 19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985
編集者Donald E. Kirk
出版社IEEE Computer Society
ページ365-368
ページ数4
ISBN(電子版)0818607297
DOI
出版ステータス出版済み - 1985
外部発表はい
イベント19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985 - Pacific Grove, 米国
継続期間: 11 6 198511 8 1985

出版物シリーズ

名前Conference Record - Asilomar Conference on Signals, Systems and Computers
ISSN(印刷版)1058-6393

会議

会議19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985
国/地域米国
CityPacific Grove
Period11/6/8511/8/85

All Science Journal Classification (ASJC) codes

  • 信号処理
  • コンピュータ ネットワークおよび通信

フィンガープリント

「On the area-time optimal design of l-selectors」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル