Synelixis Solutions Ltd

Chalkída, Greece

Synelixis Solutions Ltd

Chalkída, Greece

Time filter

Source Type

Sarakis L.,Technological Educational Institute of Sterea Ellada | Orphanoudakis T.,Hellenic Open University | Leligou H.C.,Technological Educational Institute of Sterea Ellada | Voliotis S.,Technological Educational Institute of Sterea Ellada | Voulkidis A.,Synelixis Solutions Ltd.
IEEE Wireless Communications | Year: 2016

With vehicle-to-vehicle and vehicle-to-infrastructure communications gaining momentum, immense opportunities for developing a new application gamut open up. These range from applications targeting security/safety and efficient transportation to in-car entertainment enjoying multi-player mixed-reality games. The potential of VANETs has been recognized by standardization bodies and other stakeholders, including car manufacturers, that have established multiple consortia and initiatives to explore the capabilities of VANET technologies. From the communication technology perspective, the high speed at which nodes move in VANETs together with the adverse environmental conditions (rapidly changing surroundings, weather, etc.) present great challenges. These have attracted the interest of researchers who have sought to evaluate the performance of these systems, mostly paying attention to the lower layers of the protocol stack (physical and MAC). In this article, we explore the network architecture and protocol stack for supporting a broad range of infotainment applications in VANETs based on IEEE 802.11p and assess VANETs' capabilities to support networked multimedia. To this end, our evaluation focuses on application-layer performance for video streaming over a prototype system based on NEC's Linkbird-MX devices. © 2016 IEEE.


Nikitakis A.,Technical University of Crete | Papaefstathiou I.,Synelixis Solutions Ltd | Makantasis K.,Institute of Communication and Computer Systems | Doulamis A.,National Technical University of Athens
Proceedings of the 2016 Design, Automation and Test in Europe Conference and Exhibition, DATE 2016 | Year: 2016

Real-time segmentation of moving regions in image sequences is a very important task in numerous surveillance and monitoring applications. A common approach for such tasks is the background subtraction which tries to extract regions of interest from the image background for further processing or action; as a result its accuracy as well as its real-time performance is of great significance. In this work we utilize a novel scheme, designed and optimized for FPGA-based implementations, which models the intensities of each pixel as a mixture of Gaussian components; following a Bayesian approach, our method automatically estimates the number of Gaussian components as well as their parameters. Our novel system is based on an efficient and highly accurate on-line updating mechanism, which permits our system to be automatically adapted to dynamically changing operation conditions, while it avoids over/under fitting. We also present two reference implementations of our Background Subtraction Parallel System (BSPS) in Reconfigurable Hardware achieving both high performance as well as low power consumption; the presented FPGA-based systems significantly outperform a multi-core ARM and two multi-core low power Intel CPUs in terms of energy consumed per processed pixel as well as frames per second. Moreover, our low-cost, low-power devices allow for the implementation, for the first time, of a highly distributed surveillance system which will alleviate the main problems of the existing centralized approaches. © 2016 EDAA.


Papadakis A.,& Synelixis Solutions Ltd | Zahariadis T.,Technological Educational Institute of Chalkida | Nikolaou N.,Synelixis Solutions Ltd
Telecommunication Systems | Year: 2015

Current Internet architecture is being challenged by the overwhelming multiplication of available content and the increasing requirements of the content delivery applications. Content Delivery Networks have been playing a catalytic role in content delivery solutions, replicating (caching) content at the edges of the network. In this paper, we have investigated the potential benefits offered by adaptability in overlay content replication, considering changing conditions such as the popularity and the size of the content objects and a system of collaborating content caches. Pursuing the understanding of the influence of these parameters we have designed and implemented a simulation framework, with enhanced visualization and parameterization capabilities, and performed a series of experiments, under varying conditions. © 2014, Springer Science+Business Media New York.


Papaefstathiou I.,Synelixis Solutions Ltd | Chrysos G.,Technical University of Crete | Sarakis L.,TEI of Sterea Ellada
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

This paper present a recently started multi-national project which will provide an innovative comprehensible, ultra-Fast, security-Aware CPS Simulator (called COSSIM) that will seamlessly simulate both the networking and the processing parts of the Cyber Physical Systems (CPS) significantly faster and more accurate than any existing solution. In order to achieve that COSSIM will develop a novel simulator framework based on a processing simulation subsystem (i.e. a “full-system simulator”) which will be integrated with a novel network simulator. Furthermore, innovative power consumption and security measurement models will be developed and incorporated to the end framework. On top of that, COSSIM will also address another critical aspect of an accurate CPS simulation environment: the performance as measured in required simulation time. COSSIM will create a framework that is orders of magnitude faster, while also being more accurate and reporting more CPS aspects, than existing solutions, by applying hardware acceleration through the use of field programmable gate arrays (FPGAs), which have been proven extremely efficient in relevant tasks. This paper presents the high-level architecture of the end-system as well the most innovative aspects of it that will allow it to be the fastest and most accurate such simulator, while it does not cover the security aspects of this novel system. © Springer International Publishing Switzerland 2015.


Voulkidis A.C.,Synelixis Solutions Ltd. | Cottis P.G.,National Technical University of Athens
IEEE Transactions on Wireless Communications | Year: 2016

A distributed game theoretic framework based on correlated strategies is proposed to maximize the lifetime of dense homogeneous multiservice wireless sensor networks (MS-WSNs), that support multiple services continually and ubiquitously over the WSN deployment. The MS-WSN operation is dealt with as a game played by the multimode nodes. A correlated strategies approach is proposed to lead the MS-WSN close to its theoretical optimal state with respect to the network lifetime. The computationally efficient correlated strategy proposed to implement service selection by the multimode WSN nodes is distributed, based solely on local information exchange. Indicative simulation results concerning the application of the proposed scheme on top of k-hop clustering reveal that the proposed correlated strategies based framework leads the MS-WSN operation close to its theoretical optimal at no significant exchange of overhead messages. © 2016 IEEE.


Nikitakis A.,Technical University of Crete | Papaefstathiou I.,Synelixis Solutions Ltd
Proceedings of the 2016 Design, Automation and Test in Europe Conference and Exhibition, DATE 2016 | Year: 2016

Graph cuts are very popular methods for combinatorial optimization mainly utilized, while also being the most computational intensive part, in several vision schemes such as image segmentation and stereo correspondence; their advantage is that they are very efficient as they provide guarantees about the optimality of the reported solution. Moreover, when those vision schemes are executed in mobile devices there is a strong need, not only for real-time processing, but also for low power/energy consumption. In this paper, we present a novel architecture for the implementation, in reconfigurable hardware, of one of the most widely used graph cuts algorithms, which is also the fastest sequential one, called BK. Our novelty comes from the fact that we use a 2-level hierarchical decomposition method to parallelize it in a very modular way allowing it to be efficiently implemented in FPGAs with different number of logic cells and/or memory resources. We fast-prototyped the architecture, using a High level synthesis workflow, in a state-of-the-art FPGA device; our implementation outperforms an optimized reference software solution by more than 6x, while consuming 35 times less energy;. To the best of our knowledge this is the first parallel implementation of this very widely used algorithm in reconfigurable hardware. © 2016 EDAA.


Nikitakis A.,Technical University of Crete | Paganos T.,Technical University of Crete | Papaefstathiou I.,Synelixis Solutions Ltd
Proceedings -Design, Automation and Test in Europe, DATE | Year: 2014

One of the most important challenges in the field of Computer Vision is the implementation of low-power embedded systems that will execute very accurate, yet real-time, algorithms. In the visual tracking sector one of the most promising approaches is the recently introduced OpenTLD algorithm which uses a random forest classification method. While it is very robust, it cannot be efficiently parallelized in its native form as its memory access pattern has certain characteristics that make it hard to take advantage of the conventional memory hierarchies. In this paper, we present a novel embedded system implementing this algorithm. We accelerate the bottleneck of the algorithm by designing and implementing a high bandwidth distributed memory sub-system which is independent of the various software parameters. We demonstrate the applicability and efficiency of this novel approach by implementing our scheme in a modern FPGA. © 2014 EDAA.


Zahariadis T.,Synelixis Solutions Ltd | Papadakis A.,Synelixis Solutions Ltd | Nikolaou N.,Synelixis Solutions Ltd
2012 35th International Conference on Telecommunications and Signal Processing, TSP 2012 - Proceedings | Year: 2012

Current Internet architecture is challenged by the overwhelming multiplication of available content and the increasing requirements of the content delivery applications. Content Delivery Networks have been playing a catalytic role in content delivery solutions, replicating (caching) content at the edges of the network. In this paper, we investigate the role and the benefits of a more flexible and adaptive form of overlay content replication, considering changing conditions such as the popularity and the size of the content objects. We have designed and simulated a cache evaluator framework which considers the external varying conditions and can provide guidance on the operations of in - network caches. © 2012 IEEE.


Kalenderi M.,Technical University of Crete | Pnevmatikatos D.,Technical University of Crete | Papaefstathiou I.,Synelixis Solutions Ltd. | Manifavas C.,Technological Educational Institute of Crete
Proceedings - 22nd International Conference on Field Programmable Logic and Applications, FPL 2012 | Year: 2012

A5 is the basic cryptographic algorithm used in GSM cell-phones to ensure that the user communication is protected against illicit acts. The A5/1 version was developed in 1987 and has since been under attack. The most recent attack on A5/1 is the "A51 security project", led by Karsten Nohl that consists of the creation of rainbow tables that map the internal state of the algorithm with the keystream. Rainbow tables are efficient structures that allow the tradeoff between run-time (computations performed to crack a conversation) and space (memory to hold pre-computed information). In this paper we describe a very effective parallel architecture for the creation of the A5/1 rainbow tables in reconfigurable hardware. Rainbow table creation is the most expensive portion of cracking a particular encrypted information exchange. Our approach achieves almost 3000x speedup over a single processor, and 2.5x speedup compared to GPUs. This performance is achieved with less than 5 Watt power consumption, achieving an energy efficiency in the order of 150x better that the GPU approach. © 2012 IEEE.


Brokalakis A.,Synelixis Solutions Ltd. | Papaefstathiou I.,Technical University of Crete
IEEE Wireless Communications and Networking Conference, WCNC | Year: 2012

Providing an energy-efficient communication scheme is highly desirable in Wireless Sensor Networks (WSNs), however this is often constrained by the processing and energy limitations of the wireless nodes. In this paper, we propose the use of a Turbo Code scheme to increase the robustness and energy efficiency of the communication between end nodes and base stations in single-hop topologies. Using several real-world energy consumption measurements from a widely used WSN platform, we demonstrate the operational environment in which the end-user can take full advantage of the proposed scheme. We propose, for the first time, the use of a reconfigurable hardware device that executes the encoding scheme; this approach can reduce the overall energy consumption of a node by more than 40%, when compared with a Turbo Code scheme implemented in software, as well as by more than 70% when compared with the traditional WSN transmission schemes that do not support any kind of Forward Error Correction. © 2012 IEEE.

Loading Synelixis Solutions Ltd collaborators
Loading Synelixis Solutions Ltd collaborators