What do you think?
Rate this book
Tight Area Bounds and Provably Good At2 Bounds for Sorting Circuits
Excerpt from Tight Area Bounds and Provably Good At2 Bounds for Sorting Circuits
This paper gives tight upper and lower bounds for the minimum area required to sort n k-bit numbers in a digital medium, when the inputs can be replicated up to rsn times. We also give provably good A12 bounds for vlsi sorting circuits that read their inputs once. Our lower bounds result from a coherent theory that captures the intrinsic complexity in both A and at2 measures for sorting circuits. Among other results, we prove.
This paper gives tight upper and lower bounds for the minimum area required to sort n k-bit numbers in a digital medium, when the inputs can be replicated up to rsn times. We also give provably good A12 bounds for vlsi sorting circuits that read their inputs once. Our lower bounds result from a coherent theory that captures the intrinsic complexity in both A and at2 measures for sorting circuits. Among other results, we prove.
31 pages, Paperback
Published August 24, 2018
1 person want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.