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.

Andrea Lodi 0002

dblp:76/2715 · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
0since 2021 · last 2007
0000-0001-9269-633XORCID · corroborated

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

Systems, architecture and hardware · 8 · 6 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1

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
3 papers
Reconfigurable computing and FPGAs · 48% Integrated circuit design · 15% Electronic design automation · 14%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › routing
FPGA routing
0.112005
Combining low-leakage techniques for FPGA routing design · FPGA 2005
Energy-efficient computing
leakage power reduction
0.112005
Combining low-leakage techniques for FPGA routing design · FPGA 2005
Integrated circuit design
low-power circuit design
0.112005
Combining low-leakage techniques for FPGA routing design · FPGA 2005
Reconfigurable computing and FPGAs
dynamic reconfiguration
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004
Reconfigurable computing and FPGAs
FPGA routing architecture
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004
Reconfigurable computing and FPGAs › dynamic reconfiguration
multicontext FPGA
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004
Reconfigurable computing and FPGAs
coarse-grained reconfigurable architecture
0.012003
A pipelined configurable gate array for embedded processors · FPGA 2003
Reconfigurable computing and FPGAs › reconfigurable architecture
reconfigurable processor
0.012003
A pipelined configurable gate array for embedded processors · FPGA 2003
Processor architecture and microarchitecture › instruction-level parallelism › VLIW
VLIW processor
0.012003
A pipelined configurable gate array for embedded processors · FPGA 2003
Integrated circuit design › memory circuit design
SRAM cell design
0.012005
Combining low-leakage techniques for FPGA routing design · FPGA 2005
Electronic design automation
physical design
0.012004
Routing architecture for multi-context FPGAs · FPGA 2004

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

super cut-off · 0.1multi-threshold CMOS · 0.1body biasing · 0.1decoder-based multicontext architecture · 0.00.18 μm CMOS · 0.0
YearPublicationVenuePosition
2007 A dynamically adaptive DSP for heterogeneous reconfigurable platforms
abstract
This paper describes a digital signal processor based on a multi-context, dynamically reconfigurable datapath, suitable for inclusion as an IP-block in complex SoC design projects. The IP was realized in CMOS 090 nm technology. The most relevant features offered by the proposed architecture with respect to state of the art are zero overhead for switching between successive configurations, relevant area and energy computational density on computational kernels (average of 2 GOPS/mm2, 0.2GOPS/mW) and relatively small area occupation (18 mm2), making it suitable for acceleration or upgrade of multi-core heterogeneous embedded platforms. The processor is delivered with a software tool chain providing the application developer algorithmic analysis and design space exploration based on ANSI C, with no utilization of hardware-related constructs or description languages
Fabio Campi, Antonio Deledda, Matteo Pizzotti, Luca Ciccarelli, Pier Luigi Rolandi, Claudio Mucci, Andrea Lodi 0002, Arseni Vitkovski, Luca Vanzolini
DATE7
2006 A Multi-Context Pipelined Array for Embedded Systems
abstract
The integration of a reconfigurable device into complex SoCs is a common request aimed at adding software programmable efficient computational blocks to a system. In such environment a traditional approach in FPGA design could not meet the need for an easy-to-use and easy-to-integrate device. This paper presents the PiCoGA-II reconfigurable datapath which has been designed as a multi-context array to provide fast dynamic reconfiguration. Architectural choices to reduce the area overhead of this approach are described. A reconfigurable dedicated control unit provides a clear interface for an easy integration of the device together with a hardware support for a programming Mow starting from a sequential high-level language. The logic cells have been redesigned with respect to the previous version, to improve their computational efficiency and flexibility. The PiCoGA-II has been fabricated in 0.13mum CMOS technology. The implementation of several MPEG-2 kernels shows that the multi-context array has a computational density which is 2times higher than an equivalent single-context one and is 2times higher than a Virtex-II FPGA when all the 4 contexts are utilized
Andrea Lodi 0002, Claudio Mucci, Massimo Bocchi, Andrea Cappelli, Mario de Dominicis, Luca Ciccarelli
FPL1
2005 An Embedded Reconfigurable Datapath for SoC
abstract
In this paper we present the new version of a multi-context reconfigurable datapath called PiCoGA (pipelined configurable gate array). The device provides a clear interface model and can be easily embedded in SoC systems where low power consumption and high computation capability are required. New logic cells and routing architecture have been designed for an efficient implementation of computation-intensive algorithms. The integration of a dedicated control unit for pipeline activity control provides a dataflow computational model which is easy to be integrated in a SoC. The embedded datapath has been designed using a 0.13 /spl mu/m CMOS technology. The implementation of several functions in the datapath achieves an average gate density of 1.3 KGates/mm/sup 2/ for each of the four available contexts.
Andrea Lodi 0002, Luca Ciccarelli, Claudio Mucci, Roberto Giansante, Andrea Cappelli, Mario Toma
FCCM1
2005 Combining low-leakage techniques for FPGA routing design
abstract
Reconfigurable architectures are well suited for wireless applications since they provide high performance computation together with the capability to adapt to changing communication protocols. Moving to 90nm technology and below, FPGAs could suffer from leakage energy consumption due to the large number of inactive transistors. We propose to combine super cut-off, body biasing and multi-threshold techniques to reduce the leakage current of programmable interconnections, which give by far the main contribution to static power dissipation. Super cut-off (gate biasing) technique is well suited for high-speed pass-transistors, while body biasing can be adopted for large buffers. On the other hand high threshold transistors can be used where delays are not critical. We show the design of SRAM cells generating the required high swing signals for gate-biased and body-biased transistors without affecting transistor reliability. Compared to a standard design the adoption of a mixed technique reduces routing leakage by more than one order of magnitude with only a 5% increase in switch delay and a 9% in tile area, while with respect to a full dual-threshold approach, delay is reduced by 23%.
Andrea Lodi 0002, Luca Ciccarelli, Roberto Giansante
FPGA1
2004 A Dataflow Control Unit for C-to-Configurable Pipelines Compilation Flow
abstract
In the field of embedded systems, reconfigurable processors, composed of a standard processor core coupled with a reconfigurable device, are gaining more and more importance. Algorithm developers are facing the issue of mapping applications on configurable hardware, without a specific knowledge of the underlying architecture. In this paper, we present a modular data flow control unit for a reconfigurable datapath, which can be easily programmed starting from the C description of the required functionality.
Andrea Cappelli, Andrea Lodi 0002, Claudio Mucci, Mario Toma, Fabio Campi
FCCM2
2004 Routing architecture for multi-context FPGAs
abstract
Multi-context FPGAs are a convenient solution for run-time reconfiguration, but they suffer from large area occupation. This is mainly due to programmable interconnect configuration memories which need to be replicated as many times as the number of contexts. This limitation can be overcome with a DBM (Decoder Based Multicontext) routing architecture which introduces a decoding stage between configuration memories and routing structures, so that the number of SRAM cells can be highly reduced. Both the switch and connect blocks have been designed, at the architectural and schematic level. A suitable router for DBM structures has also been developed. The results show that the approach adopted requires on average only 5% more tracks whereas the device area occupation is reduced up to 40%. We also show that DBM routing architecture does not affect the critical path delay, due to the reduction of the routing wire length.
Andrea Lodi 0002, Roberto Giansante, Carlo Chiesa, Luca Ciccarelli, Mario Toma, Fabio Campi
FPGA1
2004 Compact Buffered Routing Architecture
Andrea Lodi 0002, Roberto Giansante, Carlo Chiesa, Luca Ciccarelli, Fabio Campi, Mario Toma
FPL1
2003 A pipelined configurable gate array for embedded processors
abstract
In recent years the challenge of high performance, low power retargettable embedded system has been faced with different technological and architectural solutions. In this paper we present a new configurable unit explicitly designed to implement additional reconfigurable pipelined datapaths, suitable for the design of reconfigurable processors. A VLIW reconfigurable processor has been implemented on silicon in a standard 0.18 μ m CMOS technology to prove the effectiveness of the proposed unit. Testing on a signal processing algorithms benchmark showed speedups from 4.3x to 13.5x and energy consumption reduction up to 92%.
Andrea Lodi 0002, Mario Toma, Fabio Campi
FPGA1
2002 Very low complexity prompted speaker verification system based on HMM-modeling
abstract
The complexity of the algorithms used in speaker verification is often not suitable for low power applications or HW platforms having small portions of memory available (smartcard). This paper presents a text-prompted recognition system composed of two blocks performing speaker verification and text confirmation. In both cases we made an effort to use low complexity HMM models of voiceprint and phonemes to be able to adopt strong simplification in probability computation. As far as the normalization process is usually the computationally most intensive process, we propose new efficient normalization techniques for both speaker verification and text confirmation. Low complexity is also achieved adopting smart quantization of features and model parameters. In spite of simplicity we report an Equal Error Rate (EER) of 1.2% for speaker verification and of 0.7% for text confirmation using 3 second speech utterances. Memory requirements are also kept small: less than 450 bytes are needed for speaker voiceprints.
Andrea Lodi 0002, Mario Toma, Roberto Guerrieri
ICASSP1
2002 Word endpoints detection in the presence of non-stationary noise
Mario Toma, Andrea Lodi 0002, Roberto Guerrieri
INTERSPEECH2