<?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-03T00:41:31Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/20124" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/20124</identifier><datestamp>2026-02-03T11:30:58Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</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>Efficient floating-point givens rotation unit</dc:title>
   <dc:creator>Hormigo-Aguilar, Javier</dc:creator>
   <dc:creator>Muñoz, Sergio</dc:creator>
   <dc:subject>Informática - Aplicaciones</dc:subject>
   <dc:subject>Procesado de señales</dc:subject>
   <dcterms:abstract>High-throughput QR decomposition is a key operation in many advanced signal processing and communication applications. For some of these applications, using floating-point computation is becoming almost compulsory. However, there are scarce works in hardware implementations of floating-point QR decomposition for embedded systems. In this paper, we propose a very efficient high-throughput floating-point Givens rotation unit for QR decomposition. Moreover, the initial proposed design for conventional number formats is enhanced by using the new Half-Unit Biased format. The provided error&#xd;
analysis shows the effectiveness of our proposals and the trade-off of different implementation parameters. We also present FPGA implementation results and a thorough comparison between both approaches. These implementation results also reveal outstanding improvements compared to other previous similar designs in terms of area, latency, and throughput.</dcterms:abstract>
   <dcterms:dateAccepted>2020-10-23T10:57:01Z</dcterms:dateAccepted>
   <dcterms:available>2020-10-23T10:57:01Z</dcterms:available>
   <dcterms:created>2020-10-23T10:57:01Z</dcterms:created>
   <dcterms:issued>2020-10-23</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/10630/20124</dc:identifier>
   <dc:identifier>10.1007/s00034-020-01580-x</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Circuits, Systems, and Signal Processing;</dc:relation>
   <dc:rights>open access</dc:rights>
   <dc:publisher>Springer</dc:publisher>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>