Darjn Esposito

Darjn Esposito

Auto-generated profile, based on publicly available information

Darjn Esposito

Dept. of Electrical Engineering and Information Technology, University of Napoli “Federico II”, Italy

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
12 June 2018 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
DEDarjn Esposito
Darjn Esposito
ASAntonio Strollo
Antonio Strollo
ENEttore Napoli
Ettore Napoli
Davide De CaroDavide De Caro
Davide De Caro
NPNicola Petra
Nicola Petra

11 July 2016 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
DEDarjn Esposito
Darjn Esposito
DCDavide De Caro
Davide De Caro
ASAntonio Giuseppe Maria Strollo
Antonio Giuseppe Maria Strollo
A variable latency adder (VLA) reduces average addition time by using speculation: the exact arithmetic function is replaced by an approximated one, that is faster and gives correct results most of the times. When speculation fails, an error detection and correction circuit gives the correct result in the following clock cycle. Previous papers investigate VLAs based on Kogge-Stone, Han-Carlson or carry select topologies, speculating that carry propagation involves only a few consecutive bits. In several applications using 2's complement representation, however, operands have a Gaussian distribution and a nontrivial portion of carry chains can be as long as the adder size. In this paper we propose five novel VLA architectures, based on Brent-Kung, Ladner-Fisher, Sklansky, Hybrid Han-Carlson, and Carry increment parallel-prefix topologies. Moreover, we present a new efficient error detection and correction technique, that makes proposed VLAs suitable for applications using 2's complement representation. In order to investigate VLAs performances, proposed architectures have been synthesized using the UMC 65 nm library, for operand lengths ranging from 32 to 128 bits. Obtained results show that proposed VLAs outperform previous speculative architectures and standard (non-speculative) adders when high-speed is required.

6 April 2015 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
DEDarjn Esposito
Darjn Esposito
Davide De CaroDavide De Caro
Davide De Caro
ENEttore Napoli
Ettore Napoli
NPNicola Petra
Nicola Petra
ASAntonio Giuseppe Maria Strollo
Antonio Giuseppe Maria Strollo
Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed.

1 June 2017
Verified
Conference Paper
Closed access
DEDarjn Esposito
Darjn Esposito
ASAntonio G. M. Strollo
Antonio G. M. Strollo
MAMassimo Alioto
Massimo Alioto
Sacrificing exact calculations to improve digital circuit performance is at the foundation of approximate computing. In this paper, an approximate multiply-and-accumulate (MAC) unit is introduced. The MAC partial product terms are compressed by using simple OR gates as approximate counters; moreover, to further save energy, selected columns of the partial product terms are not formed. A compensation term is introduced in the proposed MAC, to reduce the overall approximation error. A MAC unit, specialized to perform 2D convolution, is designed following the proposed approach and implemented in TSMC 40nm technology in four different configurations. The proposed circuits achieve power savings more than 60%, compared to standard, exact MAC, with tolerable image quality degradation.

1 May 2017
Verified
Conference Paper
Closed access
DEDarjn Esposito
Darjn Esposito
DCDavide De Caro
Davide De Caro
ENEttore Napoli
Ettore Napoli
NPNicola Petra
Nicola Petra
ASAntonio G. M. Strollo
Antonio G. M. Strollo
Approximate computing improves digital circuit performance by relaxing the requirement of performing exact calculations. In this paper, we investigate the use of approximate adders in the final stage of a carry save multiplier-accumulator (MAC), designed for image filtering application. We propose a design flow based on synthesis tools, starting from HDL description. After a first step in which an exact carry-propagate adder is used, the synthesized netlist is simulated to extract the statistics of the terms summed in the carry-propagate adder. We then design the approximate adder, to meet the required error characteristics given the inputs statistics. The netlist is finally modified by substituting the exact adder with the approximate one, and a final synthesis and optimization is performed. The presented design example in 28nm CMOS shows that a 14% power gain can be obtained, with a limited image quality degradation.

17 August 2018 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
MMMichele De Martino
Michele De Martino
Davide De CaroDavide De Caro
Davide De Caro
DEDarjn Esposito
Darjn Esposito
ENEttore Napoli
Ettore Napoli
NPNicola Petra
Nicola Petra
ASAntonio Strollo
Antonio Strollo
The use of digital pulse-width modulators (DPWMs) as controllers for dc-dc converters is becoming more and more popular, due to the lower sensitivity to process variations, programmability, and easiness to translate complex control algorithm in digital architecture. DPWMs require high resolution to avoid limit cycling. Moreover, especially in high-frequency switching power converters, the reduction of the electromagnetic interference (EMI) is of primary importance. A novel DPWM circuit is proposed in this paper. The circuit uses only standard cells, easing portability to new technological nodes. The DPWM includes a coarse delay stage, based on an enhanced counter-based architecture, which is able to modulate both the frequency and duty cycle. As a result, the proposed DPWM supports spread-spectrum modulation, with arbitrary modulation law, to reduce the EMI. The DPWM also includes a fine delay stage that employs digitally controlled NAND-based delay lines with excellent linearity and resolution. A measurement unit is used to compensate at run time, the process, voltage, and temperature variations. The circuit has been fabricated in low-cost UMC 130-nm CMOS technology and is fit in a 44-pin package. The chip can generate spread-spectrum pulse-width waveforms up to 10 MHz. Measurement of the conducted EMI in buck dc-dc converter is reported in this paper.