<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-07T05:48:31Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/40099" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/40099</identifier><datestamp>2026-02-03T12:16:52Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Floating–Point Fused Multiply–Add under HUB Format.</dc:title>
   <dc:creator>Hormigo-Aguilar, Javier</dc:creator>
   <dc:creator>Villalba-Moreno, Julio</dc:creator>
   <dc:creator>González-Navarro, Sonia</dc:creator>
   <dc:subject>Aritmética computacional</dc:subject>
   <dc:subject>Arquitectura de ordenadores</dc:subject>
   <dcterms:abstract>The Half-Unit-Biased (HUB) format has interesting advantages for implementing floating-point arithmetic which has been proved for the four basic arithmetic operations as well as square root. Nevertheless, although Floating-point Fused Multiply-add (FMA) operation (AxB + C) is one of the most important and complex arithmetic instructions in modern processors, FMA operation for HUB numbers has not been confronted yet. In this paper, we present a design to deal with this operation under HUB format. The key points to turn the conventional FMA architecture into a HUB unit are explained. Comparing the ASIC implementation of a HUB FMA unit with the conventional one, the former reduces the required area and power up to 38% and 35%, respectively, for single-precision. For BFloat16, the HUB FMA increases the speed a 15%, and even then, reduces the area and power by 26% and 12%, respectively.</dcterms:abstract>
   <dcterms:dateAccepted>2025-10-06T11:06:19Z</dcterms:dateAccepted>
   <dcterms:available>2025-10-06T11:06:19Z</dcterms:available>
   <dcterms:created>2025-10-06T11:06:19Z</dcterms:created>
   <dcterms:issued>2020-06-03</dcterms:issued>
   <dc:type>conference output</dc:type>
   <dc:identifier>https://hdl.handle.net/10630/40099</dc:identifier>
   <dc:identifier>10.1109/ARITH48897.2020.00010</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>2020 IEEE 27th Symposium on Computer Arithmetic (ARITH)</dc:relation>
   <dc:relation>Portland, Oregón, USA</dc:relation>
   <dc:relation>Junio 2020</dc:relation>
   <dc:rights>open access</dc:rights>
   <dc:publisher>IEEE</dc:publisher>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>