Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nikolaos Andrikos

dblp:39/6614 · also Nikos Andrikos · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Integrated circuit design · 81% Electronic design automation · 12% Processor architecture and microarchitecture · 6%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital circuit design
0.112011
Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers · IEEE Trans. Computers 2011
Integrated circuit design › digital arithmetic circuits › parallel multiplication
partial product reduction
0.112011
Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers · IEEE Trans. Computers 2011
Integrated circuit design › digital arithmetic circuits › integer multiplier
two's complement multiplier
0.112011
Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers · IEEE Trans. Computers 2011
Integrated circuit design
asynchronous circuit design
0.112007
A Fully-Automated Desynchronization Flow for Synchronous Circuits · DAC 2007
Electronic design automation
physical design
0.112007
A Fully-Automated Desynchronization Flow for Synchronous Circuits · DAC 2007
Processor architecture and microarchitecture › microprocessor design › processor core design
embedded cores
0.012011
Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers · IEEE Trans. Computers 2011
Integrated circuit design
low-power circuit design
0.012007
A Fully-Automated Desynchronization Flow for Synchronous Circuits · DAC 2007

Methods — techniques the papers use, named apart from their topics

radix-4 modified booth encoding · 0.1logic synthesis · 0.1standard EDA flow · 0.1gate-level transformation · 0.1
YearPublicationVenuePosition
2018 Development flow of on-line Software Test Libraries for asynchronous processor cores
abstract
Asynchronous design style is quite appealing from various perspectives. In particular, several studies confirmed the reliability of asynchronous circuits in harsh environments, being capable to better tolerate power supply and temperature variations with respect to their synchronous counterparts. However, despite these advantages and many others, their applicability (especially in safety-critical scenarios) is quite limited today. Additionally, commercial EDA tools can be hardly used for asynchronous designs; hence, designers are discouraged of using such approaches for their applications. Notably, devices deployed for safety-critical applications must satisfy stringent requirements in order to guarantee the highest level of functional safety. Commonly, on-line testing mechanisms are necessary to achieve standards compliance. Such mechanisms undergo a validation process to assess their effectiveness, fault injection campaigns being the most commonly used. For doing so, designers exploit commercial EDA tools, intended to certificate standard compliance. In this paper, a methodology for the validation of Software Test Libraries (STLs) targeting on-line testing of asynchronous processor cores is proposed. The methodology is based exclusively on commercial tools, currently used in industry for functional safety analysis.
Andrea Floridia, Ernesto Sánchez 0001, Nikolaos Andrikos
IOLTS3
2013 A fully-automated flow for ITAR-free rad-hard Atmel FPGAs
abstract
In recent years, use of FPGAs has been gaining more momentum for space applications as there are cases where using them can significantly reduce developments costs and time. In order to ensure correct operation in space, they have to be rad-hard, but most of such components are subject to ITAR. Atmel is the only provider for ITAR-free rad-hard FPGAs, but the default development flow provided leaves much to be desired. The contribution of this work is two-fold: First of all, we present a fully automated flow which improves the usability of the default development flow provided by Atmel, while requiring only a bare minimum of configuration for each design. Secondly, we show how to extend this flow in order to integrate external programs which can be used as in-place substitutions of steps of the default flow. Our experiments show that the proposed flow can significantly boost both the productivity of the designers and the QoR of the final implementations.
Nikolaos Andrikos, Massimo Violante, David Merodio Codinachs
IOLTS1
2011 Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
abstract
Two's complement multipliers are important for a wide range of applications. In this paper, we present a technique to reduce by one row the maximum height of the partial product array generated by a radix-4 Modified Booth Encoded multiplier, without any increase in the delay of the partial product generation stage. This reduction may allow for a faster compression of the partial product array and regular layouts. This technique is of particular interest in all multiplier designs, but especially in short bit-width two's complement multipliers for high-performance embedded cores. The proposed method is general and can be extended to higher radix encodings, as well as to any size square and m \times n rectangular multipliers. We evaluated the proposed approach by comparison with some other possible solutions; the results based on a rough theoretical analysis and on logic synthesis showed its efficiency in terms of both area and delay.
Fabrizio Lamberti, Nikolaos Andrikos, Elisardo Antelo, Paolo Montuschi
IEEE Trans. Computers2
2007 A Fully-Automated Desynchronization Flow for Synchronous Circuits
abstract
Variability is one of the fundamental problems faced by nano-scale electronic circuits and is expected to become even worse as process technology scales. Desynchronization is a design methodology, which converts a synchronous gate-level circuit into a more robust asynchronous one. In this paper, we describe the first fully-automated desynchronization design flow, based only on contemporary synchronous EDA tools and a new point tool for performing the desynchronization transformation. The flow was used to implement, down to mask layout level, a simple pipelined processor in a 90nm industrial library. We show that the desynchronization methodology can be easily integrated into contemporary industrial EDA flows. Results, on the design implemented, indicate that desynchronized circuits exhibit increased variability tolerance and better average case performance, for a small area and power overhead.
Nikolaos Andrikos, Luciano Lavagno, Davide Pandini, Christos P. Sotiriou
DAC1