11853714

Optimal Metastability-Containing Sorting via Parallel Prefix Computation

PublishedDecember 26, 2023
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
3 claims

Legal claims defining the scope of protection, as filed with the USPTO.

2

2. The circuit of claim 1, wherein the Gray code is a binary reflected Gray code.

3

3. The circuit of claim 1, wherein buffers are used to bound the fanout.

4

4. A transistor-level implementation of the circuit of claim 1.

Patent Metadata

Filing Date

Unknown

Publication Date

December 26, 2023

Inventors

Christoph LENZEN

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “OPTIMAL METASTABILITY-CONTAINING SORTING VIA PARALLEL PREFIX COMPUTATION” (11853714). https://patentable.app/patents/11853714

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.