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

Vasilios A. Mardiris

dblp:06/3724 · also Vasailios A. Mardiris · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0003-4818-8666ORCID · reported

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

Systems, architecture and hardware · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 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
Emerging computing paradigms · 40% Electronic design automation · 31% Reconfigurable computing and FPGAs · 28%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › field-coupled nanocomputing
quantum-dot cellular automata
0.312017
Programmable Crossbar Quantum-Dot Cellular Automata Circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Reconfigurable computing and FPGAs › reconfigurable architecture
reconfigurable logic
0.312017
Programmable Crossbar Quantum-Dot Cellular Automata Circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Electronic design automation › design automation tools
design automation for emerging technologies
0.212015
Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata · IEEE Trans. Computers 2015
Emerging computing paradigms › cellular automata
quantum cellular automata
0.212015
Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata · IEEE Trans. Computers 2015
Electronic design automation › logic synthesis
boolean function realization
0.112017
Programmable Crossbar Quantum-Dot Cellular Automata Circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Electronic design automation
logic synthesis
0.112017
Programmable Crossbar Quantum-Dot Cellular Automata Circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017

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

simulation · 0.5crossbar architecture · 0.3
YearPublicationVenuePosition
2017 Programmable Crossbar Quantum-Dot Cellular Automata Circuits
abstract
Quantum-dot fabrication and characterization is a well-established technology, which is used in photonics, quantum optics, and nanoelectronics. Four quantum-dots placed at the corners of a square form a unit cell, which can hold a bit of information and serve as a basis for quantum-dot cellular automata (QCA) nanoelectronic circuits. Although several basic QCA circuits have been designed, fabricated, and tested, proving that quantum-dots can form functional, fast and low-power nanoelectronic circuits, QCA nanoelectronics still remain at its infancy. One of the reasons for this is the lack of design automation tools, which will facilitate the systematic design of large QCA circuits that contemporary applications demand. Here we present novel, programmable QCA circuits, which are based on crossbar architecture. These circuits can be programmed to implement any Boolean function in analogy to CMOS field-programmable gate arrays and open the road that will lead to full design automation of QCA nanoelectronic circuits. Using this architecture we designed and simulated QCA circuits that proved to be area efficient, stable, and reliable.
Vicky Kalogeiton, Dim P. Papadopoulos, Orestis Liolis, Vasilios A. Mardiris, Georgios Ch. Sirakoulis, Ioannis Karafyllidis
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4
2015 Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata
abstract
Cellular automata (CAs) have been widely used to model and simulate physical systems and processes. CAs have also been successfully used as a VLSI architecture that proved to be very efficient at least in terms of silicon-area utilization and clock-speed maximization. Quantum cellular automata (QCAs) as one of the promising emerging technologies for nanoscale and quantum computing circuit implementation, provides very high scale integration, very high switching frequency and extremely low power characteristics. In this paper we present a new automated design architecture and a tool, namely DATICAQ (Design Automation Tool of 1-D CAs using QCAs), that builds a bridge between 1-D CAs as models of physical systems and processes and 1-D QCAs as nanoelectronic architecture. The QCA implementation of CAs not only drives the already developed CAs circuits to the nanoelectronics era but improves their performance significantly. The inputs of the proposed architecture are CA dimensionality, size, local rule, and initial and boundary conditions imposed by the particular problem. DATICAQ produces as output the layout of the QCA implementation of the particular 1-D CA model. Simulations of CA models for zero and periodic boundary conditions and the corresponding QCA circuits showed that the CA models have been successfully implemented.
Vasilios A. Mardiris, Georgios Ch. Sirakoulis, Ioannis Karafyllidis
IEEE Trans. Computers1
2008 A CAD System for Modeling and Simulation of Computer Networks Using Cellular Automata
abstract
The increasing complexity of computer networks calls for the development of new models for their simulation. Cellular automata (CAs) are a well-known and successful model for complex systems. This paper presents a system for modeling and simulation of computer networks based on CAs. More specifically, a 2D NaSch CA computer network model has been developed, and several networks were simulated. Algorithms for connectivity evaluation, system reliability evaluation, and shortest path computation in a computer network have also been implemented. Our system, called Net_CA system, was designed and developed as an interactive tool that offers automated modeling with the assistance of a dynamic and user-friendly graphical environment. The proposed system also produces automatically synthesizable very high speed integrated circuits hardware description language code leading to the parallel hardware implementation of the aformentioned CA algorithms. In terms of circuit design and layout, ease of mask generation, silicon area utilization, and maximization of achievable clock speed, CAs are perhaps the computational structures best suited for a fully parallel very large scale integrated realization. The simulation algorithms developed in the present paper offer high flexibility. Furthermore, connection reliability and other important parameters are inputs to the algorithms, rendering Net_CA a very reliable and fast simulator for wireless networks, ad hoc networks, and generally, for low connection reliability networks.
Vasilios A. Mardiris, Georgios Ch. Sirakoulis, Ch. Mizas, Ioannis Karafyllidis, Adonios Thanailakis
IEEE Trans. Syst. Man Cybern. Part C1
2000 Low power design of a multi-mode transceiver
abstract
Recent advances in electronic technology integration coupled with increasing needs for more services in portable communications favors the development of high performance dual-mode terminals. We present the complete architecture implementation of the GMSK/GFSK modulator/demodulator including the FIR filters design. The main features of the modulator/demodulator and the architectural implementation of FIR filters are described. The interface with ASPIS processor and A/D & D/A converters is also described in detail manner. The whole architecture of the modulator/demodulator was described by VHDL hardware language, synthesised and implemented in Xilinx environment.
Dimitrios Soudris, Minas Perakis, Haris Mizas, Vasilios A. Mardiris, Kosfas Katis, Chrissavgi Dre, A. E. Tzimas, E. G. Metaxakis, Grigorios Kalivas, Nikolaos D. Zervas, Spyros Theoharis, George Theodoridis, Adonios Thanailakis, Constantinos E. Goutis
ISCAS4