Filters








53,766 Hits in 8.5 sec

Characterizing the algorithmic complexity of reconfigurable data center architectures

Klaus-Tycho Foerster, Manya Ghobadi, Stefan Schmid
2018 Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems - ANCS '18  
Our results show that classical matching algorithms, as used in prior work, are optimal only when the topology consists of one reconfigurable switch, and the routing policy is enforced to be segregated  ...  In other words, if there is an option of routing flows seamlessly along reconfigurable and non-reconfigurable parts of the network, matching algorithms are not optimal.  ...  We would also like to thank our shepherd Aurojit Panda and the anonymous reviewers for their helpful feedback on our paper.  ... 
doi:10.1145/3230718.3230722 dblp:conf/ancs/FoersterGS18 fatcat:ej2hdmx5djcnnfzowqttr7et6y

Self-reconfiguration planning for a class of modular robots

Arancha Casal, Mark H. Yim, Gerard T. McKee, Paul S. Schenker
1999 Sensor Fusion and Decentralized Control in Robotic Systems II  
Basic reconfiguration operations between the substructures in the set are precomputed, optimized and stored in a lookup table.  ...  The entire reconfiguration then consists of an ordered series of simple, precomputed sub-reconfigurations happening locally among the substructures.  ...  When we consider systems with large numbers of modules, one of the main difficulties of self-reconfiguration resides in the fact that the attainable configurations can be extremely complex.  ... 
doi:10.1117/12.360345 fatcat:7xwo5jkuajcunp7eso7sxiuypq

The Diversification and Enhancement of an IDS Scheme for the Cybersecurity Needs of Modern Supply Chains

Dimitris Deyannis, Eva Papadogiannaki, Grigorios Chrysos, Konstantinos Georgopoulos, Sotiris Ioannidis
2022 Electronics  
Our solution uses a novel framework that implements the Aho–Corasick algorithm on the reconfigurable fabric of a multi-processor system-on-chip (MPSoC), which supports parallel matching for multiple network  ...  Hence, this work presents the implementation of a low-cost reconfigurable intrusion detection system (IDS), on the edge, that can be easily integrated into SC networks, thereby elevating the featured levels  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/electronics11131944 fatcat:iery637h6zdwvja5utspjns6aq

Reconfigurable Antennas

Dimitris E. Anagnostou, Michael T. Chryssomallis, Sotirios Goudos
2021 Electronics  
Antennas that can operate in different complex environments will be part of every modern wireless communication network, such as 5G, Internet-of-Things (IoT), and radar sensing [...]  ...  Since multiband operation is achieved through a matching network, frequency bands can be configured and optimized with a reconfigurable matching network.  ...  Antenna boosters are non-resonant small antenna elements that excite currents on the ground plane of the wireless device and do not rely on shaping complex geometric shapes to obtain multiband behavior  ... 
doi:10.3390/electronics10080897 fatcat:6khnclm5gnbrtgzmfeiarhl3nm

Gene Matching Using JBits [chapter]

Steven A. Guccione, Eric Keller
2002 Lecture Notes in Computer Science  
In this paper we explore the use of run-time reconfiguration using field programmable gate arrays (FPGAs) to provide a compact, high-performance matching solution to accelerate the searching of these genetic  ...  Databases containing billions of data elements are routinely compared and searched for matching and near-matching patterns.  ...  This requires a somewhat more complex algorithm than the search for exact matches. One area where inexact string matching has become important is in the searching of genetic databases.  ... 
doi:10.1007/3-540-46117-5_133 fatcat:poim4ajjyndalbcnc2j34dehqi

Instruction generation for hybrid reconfigurable systems

R. Kastner, A. Kaplan, S. Ogrenci Memik, E. Bozorgzadeh
2002 ACM Transactions on Design Automation of Electronic Systems  
We discuss how to target the algorithm toward the novel problem of instruction generation for hybrid reconfigurable systems.  ...  In particular, we target the Strategically Programmable System, which embeds complex computational units such as ALUs, IP blocks, and so on into a configurable fabric.  ...  We employ a locally optimal heuristic based on maximum matching. A matching of a graph is any set of pairwise disjoint edges. A maximum matching of a graph is the matching with maximum cardinality.  ... 
doi:10.1145/605440.605446 fatcat:yws5hkjtkjap5cog7tkxwe63zi

Robust reconfigurable filter design using analytic variability quantification techniques

Arthur Nieuwoudt, Jamil Kawa, Yehia Massoud
2008 2008 IEEE/ACM International Conference on Computer-Aided Design  
To model the impact of statistical circuit component variations on the predicted manufacturing yield, we implement several different analytic variability quantification techniques based on a double-sided  ...  The results indicate that reconfigurable filters and impedance matching networks designed using the proposed methodology meet the specified performance requirements with a 26% average absolute yield improvement  ...  To understand the impact of circuit component variations on reconfigurable filters, we examine the yield of a 3rd order 2band reconfigurable filter design created using the deterministic design optimization  ... 
doi:10.1109/iccad.2008.4681662 dblp:conf/iccad/NieuwoudtKM08 fatcat:r24agsmvfzgrxeg544tijgsp4e

Maximum edge matching for reconfigurable computing

M. Rullmann, R. Merker
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
Reconfiguration of tasks implies considerable overhead on the amount of configuration data and time.  ...  In this paper we give a formal description of the underlaying maximum edge matching problem and show a method to solve it optimally.  ...  Complexity of the Maximum Edge Matching Problem Obviously M Max is a subset of one of the maximum matchings M P in G B .  ... 
doi:10.1109/ipdps.2006.1639436 dblp:conf/ipps/RullmannM06 fatcat:lboqjs4jlvfupphdutiqfirjxq

FPGA Implementation of Reconfigurable Finite State Machine with Input Multiplexing Architecture Using Hungarian Method

Nitish Das, P. Aruna Priya
2018 International Journal of Reconfigurable Computing  
The problem of obtaining the required optimized multiplexer bank is transformed into a weighted bipartite graph matching problem where the objective is to iteratively match the description of FSMs in the  ...  Hence, the optimal synthesis of such systems requires a reconfigurable FSM.  ...  Conflicts of Interest The authors declare that they have no conflicts of interest. International Journal of Reconfigurable Computing  ... 
doi:10.1155/2018/6831901 fatcat:ccnig3lo2jdyviopmbdyatvn5q

Processor Enhancements for Media Streaming Applications

S. Bilavarn, E. Debes, P. Vandergheynst, J. P. Diguet
2005 Journal of VLSI Signal Processing Systems for Signal, Image and Video Technology  
In this paper, we present an impact study of such a scalable data representation optimized for QoS (Matching Pursuit 3D algorithms) on processor architectures to achieve the best performance and power  ...  The development of more processing demanding applications on the Internet (video broadcasting) on one hand and the popularity of recent devices at the user level (digital cameras, wireless videophones,  ...  the optimization of complex loop kernels.  ... 
doi:10.1007/s11265-005-6652-5 fatcat:uhj2i2g3nrc7vaopgwubh6stam

On the complexity of optimal reconfiguration planning for modular reconfigurable robots

Feili Hou, Wei-Min Shen
2010 2010 IEEE International Conference on Robotics and Automation  
This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number of reconfiguration steps  ...  To facilitate future evaluation of reconfiguration algorithms, the paper also provides the lower and the upper bounds for the minimum number of reconfiguration steps for any given reconfiguration problem  ...  Configuration Representation Before defining the optimal reconfiguration planning On the Complexity of Optimal Reconfiguration Planning for Modular Reconfigurable Robots Feili Hou, Wei-Min Shen C problem  ... 
doi:10.1109/robot.2010.5509642 dblp:conf/icra/HouS10 fatcat:bmljxgxjrrhing5r5qff4hf3ru

Automated design of tunable impedance matching networks for reconfigurable wireless applications

Arthur Nieuwoudt, Jamil Kawa, Yehia Massoud
2008 Proceedings of the 45th annual conference on Design automation - DAC '08  
Using the proposed methodology, we successfully generate three different reconfigurable impedance matching networks with performance requirements that would be difficult to realize using manual design  ...  In this paper, we develop a generalized automated design methodology for tunable impedance matching networks in reconfigurable wireless systems.  ...  However, based on the analysis performed in Section 4.1 and in Figure 2 , the solution to a less complex related IMN optimization problem can provide a suitable start point for the complete IMN optimization  ... 
doi:10.1145/1391469.1391596 dblp:conf/dac/NieuwoudtKM08 fatcat:ae5igfddvfadfm3s5fanwlkusy

Analysis of Optimal Reconfiguration of Shipboard Power Systems

Sayak Bose, Siddharth Pal, Balasubramaniam Natarajan, Caterina M. Scoglio, Sanjoy Das, Noel N. Schulz
2012 IEEE Transactions on Power Systems  
In power system reconfiguration, the status (ON/OFF) of switches are optimized such that maximum power is delivered to loads after the occurrence of a fault.  ...  It is shown that for the hybrid SPS reconfiguration problem, low complexity convex approximations are effective in finding optimal solutions.  ...  COMPUTATIONAL COMPLEXITY In this section, first, the complexity of the solutions provided to optimally reconfigure the SPS is analyzed.  ... 
doi:10.1109/tpwrs.2011.2163948 fatcat:rttamyfsxnhsbkz7cwhorgkeu4

Distributed actuator reconfiguration in networked control systems*

André Teixeira,, José Araújo,, Henrik Sandberg,, Karl H. Johansson
2013 IFAC Proceedings Volumes  
The design of the distributed reconfiguration scheme is proposed and evaluated in numerical examples.  ...  In this paper, we address the problem of distributed reconfiguration of first-order networked control systems under actuator faults.  ...  This lemma can be used if model matching is a requirement of the reconfiguration and there is an interest on reducing the amount of communication among actuators.  ... 
doi:10.3182/20130925-2-de-4044.00035 fatcat:no6pjzgterdmlb4outr4jo5fhi

Review on Architectures of Motion Estimation for Video Coding Standards

Prayline Rajabai C, Sivanantham S
2018 International Journal of Engineering & Technology  
Hence it is computationally complex, it critically consumes a massive amount of time to process the video data.  ...  Motion Estimation (ME) is one of the critical blocks in the video codec which requires extensive computation.  ...  are still going on due to the fact of reducing the computational complexity, hardware resources and the power consumption of this block.  ... 
doi:10.14419/ijet.v7i4.10.26629 fatcat:zyr2zn7sc5a3lo6pfyexwy5ycq
« Previous Showing results 1 — 15 out of 53,766 results