EULER-ADAS: Energy-Efficient & SIMD-Unified Logarithmic-Posit Engine for Precision-Reconfigurable Approximate ADAS Acceleration
Mukul Lokhande, and Ratko Pilipovic, and Omkar Kokane, and Adam Teman, and Santosh Kumar Vishvakarma

TL;DR
EULER-ADAS is a SIMD-enabled logarithmic Posit neural engine designed for low-power, high-reliability ADAS acceleration, offering configurable precision and significant hardware efficiency improvements.
Contribution
It introduces a unified architecture supporting multiple Posit precisions with reduced hardware complexity and power consumption for ADAS neural inference.
Findings
Reduces LUT count by up to 41.4% compared to exact Posit engines.
Achieves up to 10x lower energy-delay product than radix-4 Booth multipliers.
Demonstrates real-time ADAS inference with low latency and power on FPGA and CMOS.
Abstract
Advanced driver-assistance systems (ADAS) require neural compute engines that deliver low-latency inference under strict power and area constraints. Posit arithmetic is attractive for such accelerators because it provides high numerical fidelity at low precision, but its variable-length regime encoding increases encode/decode cost and exposes the datapath to large regime-field fault effects. This paper presents EULER-ADAS, a SIMD-enabled logarithmic bounded-Posit neural compute engine for energyefficient and reliability-aware ADAS acceleration. The proposed datapath combines bounded-regime Posit representation, stageadaptive logarithmic mantissa multiplication with bit truncation, and a SIMD-shared quire accumulation path supporting Posit- (8,0), Posit-(16,1), and Posit-(32,2) execution. The unified architecture enables 4xPosit-8, 2xPosit-16, or 1xPosit-32 operation without duplicating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
