Fast Non‐Uniform Quantisation via FP12 Demotion and Constant‐Time Predecessor Tables
Electronics Letters · 2026-01 · 62 (1)
DOI: 10.1049/ell2.70587 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronics Letters, online erschienen am 18.04.2026. Verfasst von Oswaldo Cadenas. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We present a practical ‐per‐query method for non‐uniform scalar quantisation in the static‐boundary regime. Real‐valued boundaries are demoted to an FP12 universe () and indexed by a compact van Emde Boas–style predecessor structure, so predecessor retrieval uses a constant number of table lookups independent of the number of bins. A bounded local check against neighbouring original boundaries recovers the exact bin. Experiments show the core predecessor lookup achieves up to speedup over binary search for high‐volume workloads; end‐to‐end time depends on the cost of forming and is dominated by demotion in our reference implementation.
Zitieren
APA
Cadenas, O. (2026). Fast Non‐Uniform Quantisation via FP12 Demotion and Constant‐Time Predecessor Tables. Electronics Letters, 62(1). https://doi.org/10.1049/ell2.70587
Vancouver
Cadenas O. Fast Non‐Uniform Quantisation via FP12 Demotion and Constant‐Time Predecessor Tables. Electronics Letters. 2026;62(1). doi:10.1049/ell2.70587
BibTeX
@article{Cadenas2026,
author = {Cadenas, Oswaldo},
title = {Fast Non‐Uniform Quantisation via FP12 Demotion and Constant‐Time Predecessor Tables},
journal = {Electronics Letters},
year = {2026},
volume = {62},
number = {1},
doi = {10.1049/ell2.70587}
}
EUVIMED