CMOS VLSI Implementation of a Low-Power Logarithmic Converter
IEEE Transactions on Computers
Delay-Optimized Implementation of IEEE Floating-Point Addition
IEEE Transactions on Computers
64-bit floating-point FPGA matrix multiplication
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
Low-power leading-zero counting and anticipation logic for high-speed floating point units
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hybrid LZA: a near optimal implementation of the leading zero anticipator
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Parallel error detection for leading zero anticipation
Journal of Computer Science and Technology
Parametric architecture for function calculation improvement
ARCS'07 Proceedings of the 20th international conference on Architecture of computing systems
Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
Streaming sparse matrix compression/decompression
HiPEAC'05 Proceedings of the First international conference on High Performance Embedded Architectures and Compilers
Ultra-low-power adder stage design for exascale floating point units
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Design Challenges for Many-Core Processors, Special Section on ESTIMedia'13 and Regular Papers
Hi-index | 0.01 |
Abstract: Design of the leading zero anticipator (LZA) or detector (LZD) is pivotal to the normalization of results for addition and fused multiplication-addition in high-performance floating point processors. This paper formalizes the analysis and describes some alternative organizations and implementations from the known art. It shows how choices made in the design are often dependent on the overall design of the addition unit, on how subtraction is handled when the exponents are the same, and on how it detects and corrects for the possible one-bit error of the LZA.