Javier Hormigo

Javier Hormigo

Auto-generated profile, based on publicly available information

Javier Hormigo

University of Malaga

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
2 February 2010 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
FJFrancisco Jaime
Francisco Jaime
MSMiguel A Sanchez
Miguel A Sanchez
JHJavier Hormigo
Javier Hormigo
JVJulio Villalba-Moreno
Julio Villalba-Moreno
EZEmilio L. Zapata
Emilio L. Zapata
Coordinate Rotation DIgital Computer (CORDIC) rotator is a well known and widely used algorithm within computers due to its way of carrying out some calculations such as trigonometric functions, among others. A scale factor compensation inherent to the CORDIC algorithm becomes an important drawback when trying to improve its benefits, although some authors have come up with a new scaling-free version, which has been successfully implemented within wireless applications. However, this new CORDIC can still be significantly improved by modifying some of its parts, therefore, this paper shows an enhanced version of the scaling-free CORDIC. These new enhancements have been implemented and tested, obtaining some new architectures which are able to reach a 35% lower latency and a 36% reduction in area and power consumption compared to the original scaling-free architecture.

20 May 2015 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
SMSergio D. Munoz
Sergio D. Munoz
JHJavier Hormigo
Javier Hormigo
This brief presents a hardware design to achieve high-throughput QR decomposition, using the Givens rotation method. It utilizes a new 2-D systolic array architecture with pipelined processing elements, which are based on the COordinate Rotation DIgital Computer (CORDIC) algorithm. CORDIC computes vector rotations through shifts and additions. This approach allows a continuous computation of QR factorizations with simple hardware. A fixed-point field-programmable gate array (FPGA) architecture for 4 × 4 matrices has been optimized by balancing the number of CORDIC iterations with the final error. As a result, compared with other previous proposals for FPGA, our design achieves at least 50% more throughput, as well as much less resource utilization.

17 September 2015 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JHJavier Hormigo
Javier Hormigo
JVJulio Villalba
Julio Villalba
In this paper, a new family of formats to deal with real number for applications requiring round to nearest is proposed. They are based on shifting the set of exactly represented numbers which are used in conventional radix- $\beta$ number systems. This technique allows performing radix complement and round to nearest without carry propagation with negligible time and hardware cost. Furthermore, the proposed formats have the same storage cost and precision as standard ones. Since conversion to conventional formats simply require appending one extra-digit to the operands, standard circuits may be used to perform arithmetic operations with operands under the new format. We also extend the features of the RN-representation system and carry out a thorough comparison between both representation systems. We conclude that the proposed representation system is generally more adequate to implement systems for computation with real number under round-to-nearest.

1 June 1998 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
JHJ. Hormigo
J. Hormigo
Gabriel CristobalGabriel Cristobal
Gabriel Cristobal

8 December 2015 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
JHJavier Hormigo
Javier Hormigo
JVJulio Villalba
Julio Villalba
This paper analyzes the benefits of using half-unit-biased (HUB) formats to implement floating-point (FP) arithmetic under a round-to-nearest mode from a quantitative point of view. Using the HUB formats to represent numbers allows the removal of the rounding logic of arithmetic units, including sticky-bit computation. This is shown for FP adders, multipliers, and converters. Experimental analysis demonstrates that the HUB formats and the corresponding arithmetic units maintain the same accuracy as the conventional ones. On the other hand, the implementation of these units, based on basic architectures, shows that the HUB formats simultaneously improve area, speed, and power consumption. In addition, based on the data obtained from the synthesis, an HUB single-precision adder is ~14% faster but consumes 38% less area and 26% less power than the conventional adder. Similarly, an HUB single-precision multiplier is 17% faster, uses 22% less area, and consumes slightly less power than the conventional multiplier. At the same speed, the adder and the multiplier achieve area and power reductions of up to 50% and 40%, respectively.

1 August 2006 in Microprocessors and Microsystems
Verified
Journal Article
Closed access
JOJoaquin Olivares
Joaquin Olivares
JHJ. Hormigo
J. Hormigo
JVJulio Villalba-Moreno
Julio Villalba-Moreno
IBI. Benavides
I. Benavides
EZE.L. Zapata
E.L. Zapata