Unbiased Rounding for HUB Floating-point Addition - 2018


[*fr1]-Unit-Biased (HUB) is an emerging format primarily based on shifting the represented numbers by [*fr1] Unit within the Last Place. This format simplifies 2's complement and round-to-nearest operations by preventing any carry propagation. This saves power consumption, time and space. Taking under consideration that the IEEE floating-purpose customary uses an unbiased rounding because the default mode, this feature is also fascinating for HUB approaches. In this paper, we study the unbiased rounding for HUB floating-point addition in each as standalone operation and inside FMA. We have a tendency to show 2 totally different alternatives to eliminate the bias when rounding the add results, either partially or totally. We have a tendency to additionally gift a slip analysis and also the implementation results of the proposed architectures to assist the designers to determine what their best option are.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Multipatch Unbiased Distance Non-Local Adaptive Means With Wavelet Shrinkage ABSTRACT: Many existing non-local means (NLM) approaches either utilise Euclidean distance to quantify the similarity between patches,
PROJECT TITLE : Multicast Capacity in MANET with Infrastructure Support - 2014 ABSTRACT: We study the multicast capacity under a network model featuring both node's mobility and infrastructure support. Combinations between
PROJECT TITLE : Joint Topology-Transparent Scheduling and QoS Routing in Ad Hoc Networks - 2014 ABSTRACT: This paper considers the problem of joint topologytransparent scheduling (TTS) and quality-of-service (QoS) routing in
PROJECT TITLE : Hop-by-Hop Message Authenticationand Source Privacy in WirelessSensor Networks - 2014 ABSTRACT: Message authentication is one of the most effective ways to thwart unauthorized and corrupted messages from being
PROJECT TITLE :The Generalization Ability of Online Algorithms for Dependent Data - 2013ABSTRACT:We study the generalization performance of online learning algorithms trained on samples coming from a dependent source of data.

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry