Optimal Metastability-Containing Sorting via Parallel Prefix Computation

11/01/2019
by   Johannes Bund, et al.
0

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 ≥ 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 14

01/22/2018

Optimal Metastability-Containing Sorting Networks

When setup/hold times of bistable elements are violated, they may become...
02/23/2021

Optimal Sorting Circuits for Short Keys

A long-standing open question in the algorithms and complexity literatur...
07/11/2019

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis

Due to the decoherence of the state-of-the-art physical implementations ...
02/19/2021

Sorting Short Integers

We build boolean circuits of size O(nm^2) and depth O(log(n) + m log(m))...
06/01/2018

Joint Size and Depth Optimization of Sorting Networks

Sorting networks are oblivious sorting algorithms with many interesting ...
10/15/2020

Sorting Short Keys in Circuits of Size o(n log n)

We consider the classical problem of sorting an input array containing n...
11/29/2018

Small Hazard-free Transducers

Recently, an unconditional exponential separation between the hazard-fre...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.