Digit-Recurrence Posit Division

📝 Original Info

• Title: Digit-Recurrence Posit Division
• ArXiv ID: 2511.02494
• Date: 2025-11-04
• Authors: 논문에 명시된 저자 정보가 제공되지 않았습니다. 저자 명단을 확인하려면 원문을 참고하시기 바랍니다.

📝 Abstract

Posit arithmetic has emerged as a promising alternative to IEEE 754 floating-point representation, offering enhanced accuracy and dynamic range. However, division operations in posit systems remain challenging due to their inherent hardware complexity. In this work, we present posit division units based on the digit-recurrence algorithm, marking the first implementation of radix-4 digit-recurrence techniques within this context. Our approach incorporates hardware-centric optimizations including redundant arithmetic, on-the-fly quotient conversion, and operand scaling to streamline the division process while mitigating latency, area, and power overheads. Comprehensive synthesis evaluations across multiple posit configurations demonstrate significant performance improvements, including more than 80% energy reduction with small area overhead compared to existing methods, and a substantial decrease in the number of iterations. These results underscore the potential of our adapted algorithm to enhance the efficiency of posit-based arithmetic units.

💡 Deep Analysis

📄 Full Content

Reference