Institution
INESC-ID
Nonprofit•Lisbon, Portugal•
About: INESC-ID is a nonprofit organization based out in Lisbon, Portugal. It is known for research contribution in the topics: Field-programmable gate array & Control theory. The organization has 932 authors who have published 2618 publications receiving 37658 citations.
Topics: Field-programmable gate array, Control theory, Adaptive control, Model predictive control, Machine translation
Papers published on a yearly basis
Papers
More filters
••
01 Sep 2010TL;DR: Hardware structures for addition and multiplication operation in RNS for the moduli{2n-3} and {2n+3} are proposed and analyzed and it is suggested that more balanced moduli sets should be developed in order to achieve more efficient RNS.
Abstract: A new moduli set {2n-1, 2n+3, 2n+1, 2n-3} has recently been proposed to represent numbers in Residue Number Systems (RNS), increasing the number of channels. With this, the processing time can be reduced by simultaneously exploiting the carry-free characteristic of the modular arithmetic and improving the parallelism. In this paper, hardware structures for addition and multiplication operation in RNS for the moduli {2n-3} and {2n+3} are proposed and analyzed. In order to evaluate the performance of the proposed units they were implemented on an ASIC technology. The obtained experimental results suggest that the performance of the moduli {2n\pm3} are acceptable but demand more area resource and impose a larger delay than the typically used {2n\pm1} arithmetic units. Addition units require at least 42\% more area for a performance identical to the {2n+1} modulo adder. The multiplication units require up to 37% more area and impose a delay 25% higher. This paper also suggests that more balanced moduli sets should be developed in order to achieve more efficient RNS.
24 citations
•
01 Jan 2021TL;DR: This paper presents an approach that combines several algorithms to detect basic polygons from a set of arbitrary line segments in a plane in polynomial time and space, with complexities of O((N +M)) and O((M +M) respectively, where N is the number of line segments and M is thenumber of intersections between line segments.
Abstract: Detecting polygons defined by a set of line segments in a plane is an important step in the analysis of vectorial drawings. This paper presents an approach that combines several algorithms to detect basic polygons from a set of arbitrary line segments. The resulting algorithm runs in polynomial time and space, with complexities of O((N +M)) and O((N +M)) respectively, where N is the number of line segments and M is the number of intersections between line segments. Our choice of algorithms was made to strike a good compromise between efficiency and ease of implementation. The result is a simple and efficient solution to detect polygons from lines.
24 citations
••
04 Jun 2007TL;DR: In this article, high voltage tolerant level shifters with combinational functionality are proposed based on differential cascode voltage switch logic (DCVSL), which are tolerant to supply voltages higher than the process limit for individual CMOS transistors.
Abstract: In this paper, high voltage (HV) tolerant level-shifters with combinational functionality are proposed based on differential cascode voltage switch logic (DCVSL). These level-shifters are tolerant to supply voltages higher than the process limit for individual CMOS transistors. The proposed HV DCVSL level shifters are particularly useful when it is mandatory to ensure a specific behavior during out of the normal mode periods (power up; power down; reset; etc.). These high voltage tolerant logic circuits were used in the power block of buck converter designed in a standard 3.3 V, 0.13 mum CMOS process, powered by an input voltage range from 2.7 V to 4.2 V.
24 citations
••
23 Apr 2007TL;DR: An execution technique to speed-up the overall execution of successive, data-dependent tasks on a reconfigurable architecture by overlapping their execution subject to data-dependences and decouples the concurrent data-path and control units.
Abstract: Many video and image/signal processing applications can be structured as sequences of data-dependent tasks using a consumer/producer communication paradigm and are therefore amenable to pipelined execution. This paper presents an execution technique to speed-up the overall execution of successive, data-dependent tasks on a reconfigurable architecture. The technique pipelines sequences of data-dependent tasks by overlapping their execution subject to data-dependences. It decouples the concurrent data-path and control units and uses a custom, application data-driven, fine-grained synchronization and buffering scheme. In addition, the execution scheme allows for out-of- order, but data-dependent producer-consumer pairs not allowed by previous data-driven pipelining approaches. The approach has been exploited in the context of a high-level compiler targeting FPGAs. The preliminary experimental results reveal noticeable performance improvements and buffer size reductions for a number of benchmarks over traditional approaches.
23 citations
•
TL;DR: This work was partially supported by national funds through FCT – Fundacao para a Ciencia e Tecnologia, under project PEst-OE/EEI/LA0021/2011, and by DCTI – ISCTEIUL – Lisbon University Institute.
Abstract: This work was partially supported by national funds through FCT – Fundacao para a Ciencia e Tecnologia, under project PEst-OE/EEI/LA0021/2011, and by DCTI – ISCTEIUL – Lisbon University Institute.
23 citations
Authors
Showing all 967 results
Name | H-index | Papers | Citations |
---|---|---|---|
João Carvalho | 126 | 1278 | 77017 |
Jaime G. Carbonell | 72 | 496 | 31267 |
Chris Dyer | 71 | 240 | 32739 |
Joao P. S. Catalao | 68 | 1039 | 19348 |
Muhammad Bilal | 63 | 720 | 14720 |
Alan W. Black | 61 | 413 | 19215 |
João Paulo Teixeira | 60 | 636 | 19663 |
Bhiksha Raj | 51 | 359 | 13064 |
Joao Marques-Silva | 48 | 289 | 9374 |
Paulo Flores | 48 | 321 | 7617 |
Ana Paiva | 47 | 472 | 9626 |
Miadreza Shafie-khah | 47 | 450 | 8086 |
Susana Cardoso | 44 | 400 | 7068 |
Mark J. Bentum | 42 | 226 | 8347 |
Joaquim Jorge | 41 | 290 | 6366 |