We prove tight upper and lower bounds on the area of semielective, when-oblivious VLSI circuits for the problem of l-selection. The area required to select the l-th smallest of n k-bit numbers is found to be heavily dependent on the relative sizes of l, k, and n. When l < 2^k, the minimal area is A = 0mega((min{n , l(k - logl)}). When l >= 2^k, A = Omega(2^k (logl - k + 1)).
Title
A Minimum-Area Circuit for l-Selection
Published
1985-06-13
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-85-244
Type
Text
Extent
16 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
