Javier D. Bruguera

Javier D. Bruguera

Auto-generated profile, based on publicly available information

Javier D. Bruguera

Arm Ltd, Cambridge, U.K.

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2019 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JBJavier D. Bruguera
Javier D. Bruguera

1 July 1993 in Parallel Computing
Verified
Journal Article
Closed access
JBJ.D Bruguera
J.D Bruguera
EAE Antelo
E Antelo
EZE.L Zapata
E.L Zapata

1 June 2018
Verified
Conference Paper
Closed access
JBJavier D. Bruguera
Javier D. Bruguera
The following topics are dealt with: floating point arithmetic; digital arithmetic; IEEE standards; field programmable gate arrays; learning (artificial intelligence); cryptography; parallel processing; table lookup; multiplying circuits; mathematics computing.

25 May 2023 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JBJavier D. Bruguera
Javier D. Bruguera
Digit-recurrence algorithms are widely used in actual microprocessors to compute floating-point division and square root. These iterative algorithms present a good trade-off in terms of performance, area and power. Traditionally, commercial processors have iterative division and square root units where the iteration logic is used over several cycles. The main drawbacks of these iterative units are long latency and low throughput due to the reuse of part of the logic over several cycles, and its hardware complexity with separated logic for division and square root. We present a radix-64 floating-point division and square root algorithm with a common iteration for division and square root and where, to have an affordable implementation, each radix-64 iteration is made of two simpler radix-8 iterations. The radix-64 algorithm allows to get low-latency operations, and the common division and square root radix-64 iteration results in some area reduction. The algorithm is mapped into two different microarchitectures: a low-latency and low area iterative unit, and a low-latency and high-throughput pipelined unit. In both units speculation between consecutive radix-8 iterations is used to reduce the timing.

1 May 1990 in Parallel Computing
Verified
Journal Article
Closed access
FRFrancisco F. Rivera
Francisco F. Rivera
RDR Doallo
R Doallo
JBJ.D Bruguera
J.D Bruguera
EZE.L Zapata
E.L Zapata
RPR Peskin
R Peskin

19 November 2002
Verified
Conference Paper
Closed access
EAE. Antelo
E. Antelo
JBJ.D. Bruguera
J.D. Bruguera
JVJulio Villalba-Moreno
Julio Villalba-Moreno
EZE.L. Zapata
E.L. Zapata