User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse





Optimal Metastability-Containing Sorting via Parallel Prefix Computation


Bund,  Johannes
Algorithms and Complexity, MPI for Informatics, Max Planck Society;


Lenzen,  Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

There are no locators available
Fulltext (public)

(Preprint), 707KB

Supplementary Material (public)
There is no public supplementary material available

Bund, J., Lenzen, C., & Medina, M. (2019). Optimal Metastability-Containing Sorting via Parallel Prefix Computation. Retrieved from http://arxiv.org/abs/1911.00267.

Cite as: http://hdl.handle.net/21.11116/0000-0005-1C6B-5
Friedrichs et al. (TC 2018) showed that metastability can be contained when sorting inputs arising from time-to-digital converters, i.e., measurement values can be correctly sorted without resolving metastability using synchronizers first. However, this work left open whether this can be done by small circuits. We show that this is indeed possible, by providing a circuit that sorts Gray code inputs (possibly containing a metastable bit) and has asymptotically optimal depth and size. Our solution utilizes the parallel prefix computation (PPC) framework (JACM 1980). We improve this construction by bounding its fan-out by an arbitrary $f \geq 3$, without affecting depth and increasing circuit size by a small constant factor only. Thus, we obtain the first PPC circuits with asymptotically optimal size, constant fan-out, and optimal depth. To show that applying the PPC framework to the sorting task is feasible, we prove that the latter can, despite potential metastability, be decomposed such that the core operation is associative. We obtain asymptotically optimal metastability-containing sorting networks. We complement these results with simulations, independently verifying the correctness as well as small size and delay of our circuits.