New implementations for parallel processing applications using reversible systolic networks and the
corresponding nano and field-emission controlled-switching components is introduced. The extensions of
implementations to many-valued field-emission systolic networks using the introduced reversible systolic
architectures are also presented. The developed implementations are performed in the reversible domain to
perform the required parallel computing. The introduced systolic systems utilize recent findings in field
emission and nano applications to implement the function of the basic reversible systolic network using
nano controlled-switching. This includes many-valued systolic computing via carbon nanotubes and carbon
field-emission techniques. The presented realization of reversible circuits can be important for several
reasons including the reduction of power consumption, which is an important specification for the system
design in several future and emerging technologies, and also achieving high performance realizations. The
introduced implementations for non-classical systolic computation are new and interesting for the design
within modern technologies that require optimal design specifications of high speed, minimum power and
minimum size, which includes applications in adiabatic low-power signal processing.
New implementations for concurrent computing applications of 3D networks using corresponding nano and field-emission controlled-switching components are introduced. The developed implementations are performed within 3D lattice-based systems to perform the required concurrent computing. The introduced 3D systems utilize recent findings in field-emission and nano applications to implement the function of the basic 3D lattice networks using nano controlled-switching. This includes ternary lattice computing via carbon nanotubes and carbon field-emission techniques. The presented realization of lattice networks can be important for several reasons including the reduction of power consumption, which is an important specification for the system design in several future and emerging technologies, and in achieving high performance and reliability realizations. The introduced implementations for 3D lattice computations, with 2D lattice networks as a special case, are also important for the design within modern technologies that require optimal design specifications of high speed, high regularity and ease-of-manufacturability, such as in highly-reliable error-correcting signal processing applications.
ENERGY PERFORMANCE OF A COMBINED HORIZONTAL AND VERTICAL COMPRESSION APPROACH...IJCNCJournal
Energy efficiency is an essential issue to be reckoned in wireless sensor networks development. Since the low-powered sensor nodes deplete their energy in transmitting the collected information, several strategies have been proposed to investigate the communication power consumption, in order to reduce the amount of transmitted data without affecting the information reliability. Lossy compression is a promising solution recently adapted to overcome the challenging energy consumption, by exploiting the data correlation and discarding the redundant information. In this paper, we propose a hybrid compression approach based on two dimensions specified as horizontal (HC) and vertical compression (VC), typically implemented in cluster-based routing architecture. The proposed scheme considers two key performance metrics, energy expenditure, and data accuracy to decide the adequate compression approach based on HC-VC or VC-HC configuration according to each WSN application requirement. Simulation results exhibit the performance of both proposed approaches in terms of extending the clustering network lifetime.
Concurrent Ternary Galois-based Computation using Nano-apex Multiplexing Nibs...VLSICS Design
New implementations within concurrent processing using three-dimensional lattice networks via nano carbon-based field emission controlled-switching is introduced in this article. The introduced nano-based three-dimensional networks utilize recent findings in nano-apex field emission to implement the concurrent functionality of lattice networks. The concurrent implementation of ternary Galois functions using nano threedimensional lattice networks is performed by using carbon field-emission switching devices via nano-apex carbon fibers and nanotubes. The presented work in this part of the article presents important basic background and fundamentals with regards to lattice computing and carbon field-emission that will be utilized within the follow-up works in the second and third parts of the article. The introduced nano-based three-dimensional lattice implementations form new and important directions within three-dimensional design in nanotechnologies that require optimal specifications of high regularity, predictable timing, high testability, fault localization, self-repair, minimum size, and minimum power consumption.
This document proposes using a novel dynamic fuzzy c-means (dFCM) clustering technique combined with an artificial neural network (ANN) approach to reconfigure power distribution networks and minimize active power loss. The dFCM clustering is used to preprocess the input data for the ANN by transforming the input space into kernels, reducing the size of the ANN needed. The proposed framework combines dFCM clustering and ANN and is tested on two power networks, showing benefits like very short processing time, high accuracy, and a simple ANN structure with few neurons compared to other traditional reconfiguration methods.
This document introduces a new evaluation scheme and optimization algorithms for universal mobile telecommunications system (UMTS) radio networks that goes beyond traditional snapshot models. The key aspects are:
1) It generalizes interference coupling matrices from user snapshots to average load and introduces an analytical scaling scheme to emulate load control, allowing for fast approximate analysis of network capacity without time-consuming simulations.
2) It presents two novel radio network optimization algorithms - an efficient local search procedure and a mixed integer program that aims to optimize the coupling matrix by designing it.
3) Computational experiments show that optimizing antenna tilts with the new approaches outperforms traditional snapshot models for realistic planning scenarios.
BER Performance of MPSK and MQAM in 2x2 Almouti MIMO Systemsijistjournal
This document summarizes the results of simulations comparing the bit error rate (BER) performance of different modulation schemes in a 2x2 MIMO system using Almouti space-time coding. The key findings are:
1) Higher order modulation schemes like QPSK, 16-QAM, and 64-QAM require more energy (i.e. higher Eb/No ratio) than lower order schemes like BPSK to achieve the same BER performance.
2) 16-QAM requires less energy than 16-PSK to achieve the same BER, since QAM signal points are distributed without being confined to a circle like PSK.
3) Simulated BER performance matches theoretical curves closely for Q
This document proposes a modeling approach for multi-scale data decomposition and dynamical data modeling based on free energy and distortion energy. It involves estimating clustering dynamical parameters from data using statistical inference and decomposing signals into a hierarchy of scales via multi-spectral decomposition. This allows for the multi-scale decomposition of complex systems via dynamical cascades. The approach defines a non-linear map for scale-space clustering and models signal distortion analogous to physical systems. Motion through the scale space is described using wave information propagation principles.
New implementations for concurrent computing applications of 3D networks using corresponding nano and field-emission controlled-switching components are introduced. The developed implementations are performed within 3D lattice-based systems to perform the required concurrent computing. The introduced 3D systems utilize recent findings in field-emission and nano applications to implement the function of the basic 3D lattice networks using nano controlled-switching. This includes ternary lattice computing via carbon nanotubes and carbon field-emission techniques. The presented realization of lattice networks can be important for several reasons including the reduction of power consumption, which is an important specification for the system design in several future and emerging technologies, and in achieving high performance and reliability realizations. The introduced implementations for 3D lattice computations, with 2D lattice networks as a special case, are also important for the design within modern technologies that require optimal design specifications of high speed, high regularity and ease-of-manufacturability, such as in highly-reliable error-correcting signal processing applications.
ENERGY PERFORMANCE OF A COMBINED HORIZONTAL AND VERTICAL COMPRESSION APPROACH...IJCNCJournal
Energy efficiency is an essential issue to be reckoned in wireless sensor networks development. Since the low-powered sensor nodes deplete their energy in transmitting the collected information, several strategies have been proposed to investigate the communication power consumption, in order to reduce the amount of transmitted data without affecting the information reliability. Lossy compression is a promising solution recently adapted to overcome the challenging energy consumption, by exploiting the data correlation and discarding the redundant information. In this paper, we propose a hybrid compression approach based on two dimensions specified as horizontal (HC) and vertical compression (VC), typically implemented in cluster-based routing architecture. The proposed scheme considers two key performance metrics, energy expenditure, and data accuracy to decide the adequate compression approach based on HC-VC or VC-HC configuration according to each WSN application requirement. Simulation results exhibit the performance of both proposed approaches in terms of extending the clustering network lifetime.
Concurrent Ternary Galois-based Computation using Nano-apex Multiplexing Nibs...VLSICS Design
New implementations within concurrent processing using three-dimensional lattice networks via nano carbon-based field emission controlled-switching is introduced in this article. The introduced nano-based three-dimensional networks utilize recent findings in nano-apex field emission to implement the concurrent functionality of lattice networks. The concurrent implementation of ternary Galois functions using nano threedimensional lattice networks is performed by using carbon field-emission switching devices via nano-apex carbon fibers and nanotubes. The presented work in this part of the article presents important basic background and fundamentals with regards to lattice computing and carbon field-emission that will be utilized within the follow-up works in the second and third parts of the article. The introduced nano-based three-dimensional lattice implementations form new and important directions within three-dimensional design in nanotechnologies that require optimal specifications of high regularity, predictable timing, high testability, fault localization, self-repair, minimum size, and minimum power consumption.
This document proposes using a novel dynamic fuzzy c-means (dFCM) clustering technique combined with an artificial neural network (ANN) approach to reconfigure power distribution networks and minimize active power loss. The dFCM clustering is used to preprocess the input data for the ANN by transforming the input space into kernels, reducing the size of the ANN needed. The proposed framework combines dFCM clustering and ANN and is tested on two power networks, showing benefits like very short processing time, high accuracy, and a simple ANN structure with few neurons compared to other traditional reconfiguration methods.
This document introduces a new evaluation scheme and optimization algorithms for universal mobile telecommunications system (UMTS) radio networks that goes beyond traditional snapshot models. The key aspects are:
1) It generalizes interference coupling matrices from user snapshots to average load and introduces an analytical scaling scheme to emulate load control, allowing for fast approximate analysis of network capacity without time-consuming simulations.
2) It presents two novel radio network optimization algorithms - an efficient local search procedure and a mixed integer program that aims to optimize the coupling matrix by designing it.
3) Computational experiments show that optimizing antenna tilts with the new approaches outperforms traditional snapshot models for realistic planning scenarios.
BER Performance of MPSK and MQAM in 2x2 Almouti MIMO Systemsijistjournal
This document summarizes the results of simulations comparing the bit error rate (BER) performance of different modulation schemes in a 2x2 MIMO system using Almouti space-time coding. The key findings are:
1) Higher order modulation schemes like QPSK, 16-QAM, and 64-QAM require more energy (i.e. higher Eb/No ratio) than lower order schemes like BPSK to achieve the same BER performance.
2) 16-QAM requires less energy than 16-PSK to achieve the same BER, since QAM signal points are distributed without being confined to a circle like PSK.
3) Simulated BER performance matches theoretical curves closely for Q
This document proposes a modeling approach for multi-scale data decomposition and dynamical data modeling based on free energy and distortion energy. It involves estimating clustering dynamical parameters from data using statistical inference and decomposing signals into a hierarchy of scales via multi-spectral decomposition. This allows for the multi-scale decomposition of complex systems via dynamical cascades. The approach defines a non-linear map for scale-space clustering and models signal distortion analogous to physical systems. Motion through the scale space is described using wave information propagation principles.
A novel methodology for time-domain characterization of a full anechoic chamb...IJECEIAES
In this paper we present a novel methodology for time-domain characterization of a full anechoic chamber using the finite integral method. This approach is considered fast, accurate and not intensive for computer resources. The validation of this approach is carried out on CST-microwave studio for a full anechoic chamber intended for antennas measurement applications and electromagnetic exposure evaluation for cellular network. Low, medium and high gain sources are used in this study. The simulations are realized on a personal computer of medium performances (i7 CPU and 16 GB of RAM). The stability and the convergence of our approach are obtained thanks to local mesh and auto-regressive linear filtering techniques. The minimization of the simulation time is based on use of the Huygens sources in the place of the antennas. The maximum error of the chamber as well as the wave depolarization into the chamber are at one with the previous work and the catalogs of the principles chambers manufacturers for the proposed tests in this paper. The Full simulations time is about 15 hours in average.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A New Approach for Solving Inverse Scattering Problems with Overset Grid Gene...TELKOMNIKA JOURNAL
This paper presents a new approach of Forward-Backward Time-Stepping (FBTS)
utilizing Finite-Difference Time-Domain (FDTD) method with Overset Grid Generation (OGG)
method to solve the inverse scattering problems for electromagnetic (EM) waves. The proposed
FDTD method is combined with OGG method to reduce the geometrically complex problem to a
simple set of grids. The grids can be modified easily without the need to regenerate the grid
system, thus, it provide an efficient approach to integrate with the FBTS technique. Here, the
characteristics of the EM waves are analyzed. For the research mentioned in this paper, the
‘measured’ signals are syntactic data generated by FDTD simulations. While the ‘simulated’
signals are the calculated data. The accuracy of the proposed approach is validated. Good
agreements are obtained between simulation data and measured data. The proposed approach
has the potential to provide useful quantitative information of the unknown object particularly for
shape reconstruction, object detection and others.
We present this work by two steps. In the first one, the new structure proposed of the FP-HEMTs device (Field plate High Electron Mobility Transistor) with a T-gate on an 4H-SIC substrate to optimize these electrical performances, multiple field-plates were used with aluminum oxide to split the single electric field peak into several smaller peaks, and as passivation works to reduce scaling leakage current. In the next, we include a modeling of a simulation in the Tcad-Silvaco Software for realizing the study of the influence of negative voltage applied to gate T-shaped in OFF state time and high power with ambient temperature, the performance differences between the 3FP and the SFP devices are discussed in detail.
Automated Piecewise-Linear Fitting of S-Parameters step-response (PWLFIT) for...Piero Belforte
An innovative full time-domain macromodeling
technique for general, linear multiport systems is described. The
methodology is defined in a digital wave framework and timedomain
simulations are performed via an efficient method called
Segment Fast Convolution (SFC). It is based on a piecewiseconstant
(PWC) model of the impulse response of scattering
parameters, computed starting from a piecewise-linear fitting
of their step response (PWLFIT). Such step response is directly
available from time-domain reflectometer measurements
(TDR/TDT) or equivalent simulations. The model-building phase
is performed in a fast automated framework and an analytic
formulation of computational efficiency of the SFC with respect to
the standard time-domain convolution is given. Two application
examples are used to verify the PWLFIT performance and to
perform a comparison with macromodeling methods defined in
the frequency-domain, such as Vector Fitting (VF).
Index Terms—Digital wave models, time-domain macromodeling,
S-parameters, step response.
This document summarizes a research paper that proposes an energy-efficient topology control algorithm for cooperative ad hoc networks. It begins by introducing cooperative communication (CC) which allows nodes to cooperatively transmit signals to extend transmission range and reduce power. Previous topology control research with CC focused only on connectivity and power, ignoring energy efficiency of paths. The paper studies a new problem of energy-efficient topology control with CC (ETCC) to obtain a topology with minimum total energy consumption while ensuring energy-efficient paths. It proposes selecting optimal relay nodes for CC networks to reduce overall power usage. A greedy algorithm is presented to construct a cooperative energy spanner topology where least energy paths are guaranteed while maintaining a connected network under the CC model.
Torsten Braun from the University of Bern discussed collaborations with the University of Coimbra and Budapest University of Technology and Economics on the topic of energy efficiency in large scale distributed systems. Short term scientific missions were conducted between the universities to measure energy consumption of wireless devices and develop energy saving mechanisms. Joint research resulted in publications and a PhD student jointly supervised between University of Coimbra and University of Bern. Future collaborations are planned including faculty exchanges and EU projects.
Optimum Network Reconfiguration using Grey Wolf OptimizerTELKOMNIKA JOURNAL
Distribution system Reconfiguration is the process of changing the topology of the distribution
network by opening and closing switches to satisfy a specific objective. It is a complex, combinatorial
optimization problem involving a nonlinear objective function and constraints. Grey Wolf Optimizer (GWO)
is a recently developed metaheuristic search algorithm inspired by the leadership hierarchy and hunting
strategy of grey wolves in nature. The objective of this paper is to determine an optimal network
reconfiguration that presents the minimum power losses, considering network constraints, and using GWO
algorithm. The proposed algorithm was tested using some standard networks (33 bus, 69 bus, 84 bus and
118 bus), and the obtained results reveal the efficiency and effectiveness of the proposed approach.
The document discusses energy efficiency measurements of a wireless mesh network used for environmental monitoring. Solar-powered mesh nodes with batteries were deployed in the Rhone Valley and their solar panel voltages, battery loads, and energy consumption were monitored. Measurement results over days and weeks showed that the battery and solar panel combination was sufficient to power the nodes, though some nodes required more energy. The data provides valuable insights for optimizing energy harvesting and consumption in wireless networks.
Iaetsd vlsi architecture for exploiting carry save arithmetic using verilog hdlIaetsd Iaetsd
This document proposes a flexible accelerator architecture that exploits carry-save arithmetic to efficiently implement digital signal processing kernels. The architecture includes flexible computational units that can be configured to perform chained addition, multiplication, and addition operations directly on carry-save formatted data without intermediate conversions. Experimental results show the proposed architecture delivers average gains of 61.91% in area-delay product and 54.43% in energy consumption compared to state-of-the-art flexible data paths.
A STUDY OF ENERGY-AREA TRADEOFFS OF VARIOUS ARCHITECTURAL STYLES FOR ROUTING ...VLSICS Design
This document presents a study exploring various architectural styles for routing inputs in a coarse-grained reconfigurable fabric. It examines integrated constants, inputs coming from the side of the fabric, and combinations with dedicated pass gates. It implements these styles using a 90nm ASIC process and analyzes the area and energy tradeoffs. It finds that an approach combining inputs coming from the side with 50% dedicated pass gates provides the best results, with 31% energy savings and 62% area savings over the baseline architecture.
Energy Efficient Techniques for Data aggregation and collection in WSNIJCSEA Journal
A multidisciplinary research area such as wireless sensor networks (WSN) have been invoked the monitoring of remote physical environment and are used for a wide range of applications ranging from defense personnel to many scientific research, statistical application, disaster area and War Zone. These networks are constraint with energy, memory and computing power enhance efficient techniques are needed for data aggregation, data collection, query processing, decision making and routing in sensor networks. The problem encountered in the recent past was of the more battery power consumption as activity increases, need more efficient data aggregation and collection techniques with right decision making capabilities. Therefore, this paper proposed the efficient and effective architecture and mechanism of energy efficient techniques for data aggregation and collection in WSN using principles like global weight calculation of nodes, data collection for cluster head and data aggregation techniques using data cube aggregation.
This document describes a testbed for image synthesis developed at Cornell University. The testbed was designed to facilitate research on new light reflection models, global illumination algorithms, and rendering of complex scenes. It uses a modular structure with hierarchical levels of functionality. The lowest level contains utility modules, the middle level contains object modules that work across primitive types, and the highest level contains image synthesis modules. The testbed uses a modeler-independent description format to represent environments independently of modeling programs. Renderers can then generate images from this common description.
Sierpinski carpet fractal monopole antenna for ultra-wideband applications IJECEIAES
This summary provides an overview of a document describing a Sierpinski carpet fractal monopole antenna (SCFMA) designed for ultra-wideband applications:
1) The SCFMA is developed up to two iterations to maximize bandwidth by utilizing the space-filling and self-similar properties of the Sierpinski carpet fractal.
2) The monopole patch size is optimized to minimize the overall antenna area.
3) The SCFMA achieves bandwidth ranges of 2.6-4.0 GHz, 2.5-4.3 GHz, and 2.4-4.4 GHz for the base case, first, and second iterations, respectively, on an FR4
The document proposes an adaptive energy detection technique for spectrum sensing in cognitive radio networks. It uses an adaptive parameter ωm rather than raw energy estimates or their linear combination. This parameter is computed using an adaptive algorithm to minimize a cost function. The cost function aims to improve the deflection coefficient of the test statistic by increasing the distance between the mean values under the two hypotheses and reducing the variance. Simulation results show the proposed technique significantly outperforms other algorithms in terms of probability of miss detection for a given probability of false alarm, especially in cooperative scenarios.
The document describes a study investigating the distributed computing implementation of the EGSnrc Monte Carlo system using a computer cluster. A linear accelerator model was simulated using BEAMnrc and dose calculations were performed in water phantoms and patient geometries using DOSXYZnrc. The computational performance was tested for various scenarios using different numbers of computers. The results showed almost linear scaling of performance with the number of computers. Statistical uncertainties were the same for all scenarios, demonstrating the distributed approach provides an efficient method for speeding up Monte Carlo simulations for radiotherapy applications.
Comparitive analysis of doa and beamforming algorithms for smart antenna systemseSAT Journals
Abstract This paper revolves around the implementation of Direction of arrival and Adaptive beam-forming algorithms for Smart Antenna Systems. This paper also investigates the implementation of algorithms on various planner array geometries viz. circular and rectangular. Music algorithm is primarily finds the possible location of desired user and adaptive beam-forming algorithms such as LMS, RLS and CMA algorithms adapts the weights of the array. DOA estimation gives the maximum peak of spectrum with respect to angle of arrival where the desired user is supposed to exist. After DOA estimation weights of array antenna are changed with the changing received signal. This methodology is called as Spectral estimation, which allows the antenna pattern to steer in desired direction estimated by DOA and simultaneously null out the interfering signals. Rate of convergence is the major criterion for comparison for adaptive beam-forming algorithms. Keywords: DOA, MUSIC, LMS, RLS, CMA, SAS.
International Journal of Computational Engineering Research(IJCER)ijceronline
This document summarizes a research paper on designing a high-speed arithmetic architecture for a parallel multiplier-accumulator based on the radix-2 modified Booth algorithm. It presents the design of a modified Booth multiplier using a carry lookahead adder for high accuracy with a fixed width. It also proposes a high-speed MAC architecture that improves performance by eliminating the accumulator and modifying the carry-save adder to add lower bits in advance, reducing the number of inputs to the final adder. The proposed CSA architecture can efficiently implement the operations of the new MAC arithmetic.
This document describes research using an artificial neural network (ANN) to model the behavior of a single chamber solid oxide fuel cell (SOFC) without relying on physical equations. Experimental data from a previous study was used to train and validate the ANN model. The ANN was able to adequately predict the cell voltage based on inputs of current density and temperature. Genetic algorithms were then used to optimize the ANN model and determine the operating conditions that achieve maximum power density of 381.54 A/m2 at 687°C and 0.44V cell voltage. The results demonstrate the capabilities of ANNs and genetic algorithms for modeling and optimizing SOFC performance without detailed physical knowledge.
International Journal of Computer Science & Information Technology (IJCSIT) ijcsit
New implementations for concurrent computing applications of 3D networks using corresponding nano and field-emission controlled-switching components are introduced. The developed implementations are performed within 3D lattice-based systems to perform the required concurrent computing. The introduced 3D systems utilize recent findings in field-emission and nano applications to implement the function of the basic 3D lattice networks using nano controlled-switching. This includes ternary lattice computing via carbon nanotubes and carbon field-emission techniques. The presented realization of lattice networks can be important for several reasons including the reduction of power consumption, which is an important specification for the system design in several future and emerging technologies, and in achieving high performance and reliability realizations. The introduced implementations for 3D lattice computations, with 2D lattice networks as a special case, are also important for the design within modern technologies that require optimal design specifications of high speed, high regularity and ease-of-manufacturability, such as in highly-reliable error-correcting signal processing applications.
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
Novel layout realizations for congestion-free three-dimensional lattice networks using the corresponding
carbon-based field emission controlled switching is introduced in this article. The developed nano-based
implementations are performed in three dimensions to perform the required concurrent computations for
which two-dimensional implementations are a special case. The introduced realizations for congestion-free
concurrent computations utilize the field-emission controlled switching devices that were presented in the
first and second parts of the article for the solution of synthesis congestion and by utilizing field-emission
from carbon nanotubes and nanotips. Since the concept of symmetry indices has been related to regular
logic design, a more general method called Iterative Symmetry Indices Decomposition that produces
regular three-dimensional lattice networks via carbon field-emission multiplexing is presented, where one
obtains multi-stage decompositions whenever volume-specific layout constraints have to be satisfied. The
introduced congestion-free nano-based lattice computations form new and important paths in regular
lattice realizations, where applications include low-power IC design for the control of autonomous robots
and for signal processing implementations.
A Low Power High Bandwidth Four Quadrant Analog Multiplier in 32 NM CNFET Tec...VLSICS Design
Carbon Nanotube Field Effect Transistor (CNFET) is a promising new technology that overcomes several limitations of traditional silicon integrated circuit technology. In recent years, the potential of CNFET for analog circuit applications has been explored. This paper proposes a novel four quadrant analog multiplier design using CNFETs. The simulation based on 32nm CNFET technology shows that the proposed multiplier has very low harmonic distortion (<0.45%), large input range (±400mV), large bandwidth (~50GHz) and low power consumption (~247µW), while operating at a supply voltage of ±0.9V.
A novel methodology for time-domain characterization of a full anechoic chamb...IJECEIAES
In this paper we present a novel methodology for time-domain characterization of a full anechoic chamber using the finite integral method. This approach is considered fast, accurate and not intensive for computer resources. The validation of this approach is carried out on CST-microwave studio for a full anechoic chamber intended for antennas measurement applications and electromagnetic exposure evaluation for cellular network. Low, medium and high gain sources are used in this study. The simulations are realized on a personal computer of medium performances (i7 CPU and 16 GB of RAM). The stability and the convergence of our approach are obtained thanks to local mesh and auto-regressive linear filtering techniques. The minimization of the simulation time is based on use of the Huygens sources in the place of the antennas. The maximum error of the chamber as well as the wave depolarization into the chamber are at one with the previous work and the catalogs of the principles chambers manufacturers for the proposed tests in this paper. The Full simulations time is about 15 hours in average.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A New Approach for Solving Inverse Scattering Problems with Overset Grid Gene...TELKOMNIKA JOURNAL
This paper presents a new approach of Forward-Backward Time-Stepping (FBTS)
utilizing Finite-Difference Time-Domain (FDTD) method with Overset Grid Generation (OGG)
method to solve the inverse scattering problems for electromagnetic (EM) waves. The proposed
FDTD method is combined with OGG method to reduce the geometrically complex problem to a
simple set of grids. The grids can be modified easily without the need to regenerate the grid
system, thus, it provide an efficient approach to integrate with the FBTS technique. Here, the
characteristics of the EM waves are analyzed. For the research mentioned in this paper, the
‘measured’ signals are syntactic data generated by FDTD simulations. While the ‘simulated’
signals are the calculated data. The accuracy of the proposed approach is validated. Good
agreements are obtained between simulation data and measured data. The proposed approach
has the potential to provide useful quantitative information of the unknown object particularly for
shape reconstruction, object detection and others.
We present this work by two steps. In the first one, the new structure proposed of the FP-HEMTs device (Field plate High Electron Mobility Transistor) with a T-gate on an 4H-SIC substrate to optimize these electrical performances, multiple field-plates were used with aluminum oxide to split the single electric field peak into several smaller peaks, and as passivation works to reduce scaling leakage current. In the next, we include a modeling of a simulation in the Tcad-Silvaco Software for realizing the study of the influence of negative voltage applied to gate T-shaped in OFF state time and high power with ambient temperature, the performance differences between the 3FP and the SFP devices are discussed in detail.
Automated Piecewise-Linear Fitting of S-Parameters step-response (PWLFIT) for...Piero Belforte
An innovative full time-domain macromodeling
technique for general, linear multiport systems is described. The
methodology is defined in a digital wave framework and timedomain
simulations are performed via an efficient method called
Segment Fast Convolution (SFC). It is based on a piecewiseconstant
(PWC) model of the impulse response of scattering
parameters, computed starting from a piecewise-linear fitting
of their step response (PWLFIT). Such step response is directly
available from time-domain reflectometer measurements
(TDR/TDT) or equivalent simulations. The model-building phase
is performed in a fast automated framework and an analytic
formulation of computational efficiency of the SFC with respect to
the standard time-domain convolution is given. Two application
examples are used to verify the PWLFIT performance and to
perform a comparison with macromodeling methods defined in
the frequency-domain, such as Vector Fitting (VF).
Index Terms—Digital wave models, time-domain macromodeling,
S-parameters, step response.
This document summarizes a research paper that proposes an energy-efficient topology control algorithm for cooperative ad hoc networks. It begins by introducing cooperative communication (CC) which allows nodes to cooperatively transmit signals to extend transmission range and reduce power. Previous topology control research with CC focused only on connectivity and power, ignoring energy efficiency of paths. The paper studies a new problem of energy-efficient topology control with CC (ETCC) to obtain a topology with minimum total energy consumption while ensuring energy-efficient paths. It proposes selecting optimal relay nodes for CC networks to reduce overall power usage. A greedy algorithm is presented to construct a cooperative energy spanner topology where least energy paths are guaranteed while maintaining a connected network under the CC model.
Torsten Braun from the University of Bern discussed collaborations with the University of Coimbra and Budapest University of Technology and Economics on the topic of energy efficiency in large scale distributed systems. Short term scientific missions were conducted between the universities to measure energy consumption of wireless devices and develop energy saving mechanisms. Joint research resulted in publications and a PhD student jointly supervised between University of Coimbra and University of Bern. Future collaborations are planned including faculty exchanges and EU projects.
Optimum Network Reconfiguration using Grey Wolf OptimizerTELKOMNIKA JOURNAL
Distribution system Reconfiguration is the process of changing the topology of the distribution
network by opening and closing switches to satisfy a specific objective. It is a complex, combinatorial
optimization problem involving a nonlinear objective function and constraints. Grey Wolf Optimizer (GWO)
is a recently developed metaheuristic search algorithm inspired by the leadership hierarchy and hunting
strategy of grey wolves in nature. The objective of this paper is to determine an optimal network
reconfiguration that presents the minimum power losses, considering network constraints, and using GWO
algorithm. The proposed algorithm was tested using some standard networks (33 bus, 69 bus, 84 bus and
118 bus), and the obtained results reveal the efficiency and effectiveness of the proposed approach.
The document discusses energy efficiency measurements of a wireless mesh network used for environmental monitoring. Solar-powered mesh nodes with batteries were deployed in the Rhone Valley and their solar panel voltages, battery loads, and energy consumption were monitored. Measurement results over days and weeks showed that the battery and solar panel combination was sufficient to power the nodes, though some nodes required more energy. The data provides valuable insights for optimizing energy harvesting and consumption in wireless networks.
Iaetsd vlsi architecture for exploiting carry save arithmetic using verilog hdlIaetsd Iaetsd
This document proposes a flexible accelerator architecture that exploits carry-save arithmetic to efficiently implement digital signal processing kernels. The architecture includes flexible computational units that can be configured to perform chained addition, multiplication, and addition operations directly on carry-save formatted data without intermediate conversions. Experimental results show the proposed architecture delivers average gains of 61.91% in area-delay product and 54.43% in energy consumption compared to state-of-the-art flexible data paths.
A STUDY OF ENERGY-AREA TRADEOFFS OF VARIOUS ARCHITECTURAL STYLES FOR ROUTING ...VLSICS Design
This document presents a study exploring various architectural styles for routing inputs in a coarse-grained reconfigurable fabric. It examines integrated constants, inputs coming from the side of the fabric, and combinations with dedicated pass gates. It implements these styles using a 90nm ASIC process and analyzes the area and energy tradeoffs. It finds that an approach combining inputs coming from the side with 50% dedicated pass gates provides the best results, with 31% energy savings and 62% area savings over the baseline architecture.
Energy Efficient Techniques for Data aggregation and collection in WSNIJCSEA Journal
A multidisciplinary research area such as wireless sensor networks (WSN) have been invoked the monitoring of remote physical environment and are used for a wide range of applications ranging from defense personnel to many scientific research, statistical application, disaster area and War Zone. These networks are constraint with energy, memory and computing power enhance efficient techniques are needed for data aggregation, data collection, query processing, decision making and routing in sensor networks. The problem encountered in the recent past was of the more battery power consumption as activity increases, need more efficient data aggregation and collection techniques with right decision making capabilities. Therefore, this paper proposed the efficient and effective architecture and mechanism of energy efficient techniques for data aggregation and collection in WSN using principles like global weight calculation of nodes, data collection for cluster head and data aggregation techniques using data cube aggregation.
This document describes a testbed for image synthesis developed at Cornell University. The testbed was designed to facilitate research on new light reflection models, global illumination algorithms, and rendering of complex scenes. It uses a modular structure with hierarchical levels of functionality. The lowest level contains utility modules, the middle level contains object modules that work across primitive types, and the highest level contains image synthesis modules. The testbed uses a modeler-independent description format to represent environments independently of modeling programs. Renderers can then generate images from this common description.
Sierpinski carpet fractal monopole antenna for ultra-wideband applications IJECEIAES
This summary provides an overview of a document describing a Sierpinski carpet fractal monopole antenna (SCFMA) designed for ultra-wideband applications:
1) The SCFMA is developed up to two iterations to maximize bandwidth by utilizing the space-filling and self-similar properties of the Sierpinski carpet fractal.
2) The monopole patch size is optimized to minimize the overall antenna area.
3) The SCFMA achieves bandwidth ranges of 2.6-4.0 GHz, 2.5-4.3 GHz, and 2.4-4.4 GHz for the base case, first, and second iterations, respectively, on an FR4
The document proposes an adaptive energy detection technique for spectrum sensing in cognitive radio networks. It uses an adaptive parameter ωm rather than raw energy estimates or their linear combination. This parameter is computed using an adaptive algorithm to minimize a cost function. The cost function aims to improve the deflection coefficient of the test statistic by increasing the distance between the mean values under the two hypotheses and reducing the variance. Simulation results show the proposed technique significantly outperforms other algorithms in terms of probability of miss detection for a given probability of false alarm, especially in cooperative scenarios.
The document describes a study investigating the distributed computing implementation of the EGSnrc Monte Carlo system using a computer cluster. A linear accelerator model was simulated using BEAMnrc and dose calculations were performed in water phantoms and patient geometries using DOSXYZnrc. The computational performance was tested for various scenarios using different numbers of computers. The results showed almost linear scaling of performance with the number of computers. Statistical uncertainties were the same for all scenarios, demonstrating the distributed approach provides an efficient method for speeding up Monte Carlo simulations for radiotherapy applications.
Comparitive analysis of doa and beamforming algorithms for smart antenna systemseSAT Journals
Abstract This paper revolves around the implementation of Direction of arrival and Adaptive beam-forming algorithms for Smart Antenna Systems. This paper also investigates the implementation of algorithms on various planner array geometries viz. circular and rectangular. Music algorithm is primarily finds the possible location of desired user and adaptive beam-forming algorithms such as LMS, RLS and CMA algorithms adapts the weights of the array. DOA estimation gives the maximum peak of spectrum with respect to angle of arrival where the desired user is supposed to exist. After DOA estimation weights of array antenna are changed with the changing received signal. This methodology is called as Spectral estimation, which allows the antenna pattern to steer in desired direction estimated by DOA and simultaneously null out the interfering signals. Rate of convergence is the major criterion for comparison for adaptive beam-forming algorithms. Keywords: DOA, MUSIC, LMS, RLS, CMA, SAS.
International Journal of Computational Engineering Research(IJCER)ijceronline
This document summarizes a research paper on designing a high-speed arithmetic architecture for a parallel multiplier-accumulator based on the radix-2 modified Booth algorithm. It presents the design of a modified Booth multiplier using a carry lookahead adder for high accuracy with a fixed width. It also proposes a high-speed MAC architecture that improves performance by eliminating the accumulator and modifying the carry-save adder to add lower bits in advance, reducing the number of inputs to the final adder. The proposed CSA architecture can efficiently implement the operations of the new MAC arithmetic.
This document describes research using an artificial neural network (ANN) to model the behavior of a single chamber solid oxide fuel cell (SOFC) without relying on physical equations. Experimental data from a previous study was used to train and validate the ANN model. The ANN was able to adequately predict the cell voltage based on inputs of current density and temperature. Genetic algorithms were then used to optimize the ANN model and determine the operating conditions that achieve maximum power density of 381.54 A/m2 at 687°C and 0.44V cell voltage. The results demonstrate the capabilities of ANNs and genetic algorithms for modeling and optimizing SOFC performance without detailed physical knowledge.
International Journal of Computer Science & Information Technology (IJCSIT) ijcsit
New implementations for concurrent computing applications of 3D networks using corresponding nano and field-emission controlled-switching components are introduced. The developed implementations are performed within 3D lattice-based systems to perform the required concurrent computing. The introduced 3D systems utilize recent findings in field-emission and nano applications to implement the function of the basic 3D lattice networks using nano controlled-switching. This includes ternary lattice computing via carbon nanotubes and carbon field-emission techniques. The presented realization of lattice networks can be important for several reasons including the reduction of power consumption, which is an important specification for the system design in several future and emerging technologies, and in achieving high performance and reliability realizations. The introduced implementations for 3D lattice computations, with 2D lattice networks as a special case, are also important for the design within modern technologies that require optimal design specifications of high speed, high regularity and ease-of-manufacturability, such as in highly-reliable error-correcting signal processing applications.
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
Novel layout realizations for congestion-free three-dimensional lattice networks using the corresponding
carbon-based field emission controlled switching is introduced in this article. The developed nano-based
implementations are performed in three dimensions to perform the required concurrent computations for
which two-dimensional implementations are a special case. The introduced realizations for congestion-free
concurrent computations utilize the field-emission controlled switching devices that were presented in the
first and second parts of the article for the solution of synthesis congestion and by utilizing field-emission
from carbon nanotubes and nanotips. Since the concept of symmetry indices has been related to regular
logic design, a more general method called Iterative Symmetry Indices Decomposition that produces
regular three-dimensional lattice networks via carbon field-emission multiplexing is presented, where one
obtains multi-stage decompositions whenever volume-specific layout constraints have to be satisfied. The
introduced congestion-free nano-based lattice computations form new and important paths in regular
lattice realizations, where applications include low-power IC design for the control of autonomous robots
and for signal processing implementations.
A Low Power High Bandwidth Four Quadrant Analog Multiplier in 32 NM CNFET Tec...VLSICS Design
Carbon Nanotube Field Effect Transistor (CNFET) is a promising new technology that overcomes several limitations of traditional silicon integrated circuit technology. In recent years, the potential of CNFET for analog circuit applications has been explored. This paper proposes a novel four quadrant analog multiplier design using CNFETs. The simulation based on 32nm CNFET technology shows that the proposed multiplier has very low harmonic distortion (<0.45%), large input range (±400mV), large bandwidth (~50GHz) and low power consumption (~247µW), while operating at a supply voltage of ±0.9V.
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
The document describes a method for implementing ternary Galois functions using three-dimensional lattice networks with carbon nanotube field emission devices. The method, called Iterative Symmetry Indices Decomposition (ISID), decomposes non-symmetric functions into symmetric and error parts to iteratively produce regular three-dimensional lattice networks that fit within layout constraints while maintaining equal interconnect lengths. Carbon nanotubes and nano-apex tips are used as field emission devices for controlled switching in the lattice networks to perform concurrent ternary computations congestion-free.
HIGH SPEED MULTIPLE VALUED LOGIC FULL ADDER USING CARBON NANO TUBE FIELD EFFE...VLSICS Design
High speed Full-Adder (FA) module is a critical element in designing high performance arithmetic circuits. In this paper, we propose a new high speed multiple-valued logic FA module. The proposed FA is constructed by 14 transistors and 3 capacitors, using carbon nano-tube field effect transistor (CNFET) technology. Furthermore, our proposed technique has been examined in different voltages (i.e., 0.65v and 0.9v). The observed results reveal power consumption and power delay product (PDP) improvements compared to existing FA counterparts.
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
This document summarizes a research article that proposes a novel method for implementing ternary Galois logic functions using three-dimensional lattice networks with carbon-based field emission devices. Specifically:
- It introduces a hierarchical design approach that utilizes carbon nanotubes and nano-apex fibers for controlled switching via field emission in three-dimensional lattice networks to realize multi-valued Galois functions concurrently.
- The document reviews fundamentals of ternary Shannon and Davio expansions that are used to formally synthesize the three-dimensional lattice networks. Joining rules are defined to realize non-symmetric functions using variable repetition.
- Carbon field emission devices are proposed to implement the basic controlled switch building block using nano
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
Novel realizations of concurrent computations utilizing three-dimensional lattice networks and their
corresponding carbon-based field emission controlled switching is introduced in this article. The
formalistic ternary nano-based implementation utilizes recent findings in field emission and nano
applications which include carbon-based nanotubes and nanotips for three-valued lattice computing via
field-emission methods. The presented work implements multi-valued Galois functions by utilizing
concurrent nano-based lattice systems, which use two-to-one controlled switching via carbon-based field
emission devices by using nano-apex carbon fibers and carbon nanotubes that were presented in the first
part of the article. The introduced computational extension utilizing many-to-one carbon field-emission
devices will be further utilized in implementing congestion-free architectures within the third part of the
article. The emerging nano-based technologies form important directions in low-power compact-size
regular lattice realizations, in which carbon-based devices switch less-costly and more-reliably using
much less power than silicon-based devices. Applications include low-power design of VLSI circuits for
signal processing and control of autonomous robots.
This document presents a proposed aging-aware reliable multiplier design with an adaptive hold logic (AHL) circuit. The multiplier uses a variable-latency technique and can adjust the AHL circuit to achieve reliable operation under negative bias temperature instability and positive bias temperature instability effects, which degrade transistor speed over time. The AHL circuit can determine if an input pattern requires one or two clock cycles to complete, and can adjust its judging criteria to minimize performance degradation from aging. Experimental results on 16x16 and 32x32 column-bypassing and row-bypassing multipliers show the proposed design achieves significant performance improvements compared to fixed-latency designs.
A modular approach for testable conservative reversible multiplexer circuit f...VIT-AP University
Quantum technology has an attractive application nowadays for its minimizing the energy dissipation, which is a prominent
part of any system-level design. In this article, the significant module of a multiplexer, an extended to n:1 is framed with
prominent application in the control unit of the processor. The proposed multiplexer modules are framed by the algorithm,
which is extended perspective based. Further, quantum cost and gate count are less to ensure the efficient quantum computing
framed. In addition, the QCA computing framework is an attempt to synthesize the optimal primitives in conservative
reversible multiplexer in nano-electronic confine application. The developed lemmas is framed to prove the optimal parameters
in the reversible circuit. Compared with existing state-of-art-works, the proposed modular multiplexer, the gate count,
quantum cost and unit delay are optimal.
Performance evaluation of reversible logic based cntfet demultiplexer 2IAEME Publication
This document discusses the design and analysis of a reversible logic based carbon nanotube field effect transistor (CNTFET) demultiplexer. It presents the realization of 1:2 and 1:4 demultiplexers using reversible logic gates implemented with CNTFETs. Simulation results show the transient response and power consumption of the reversible logic CNTFET demultiplexers, with 0.8 and 1.6 nanowatts for the 1:2 and 1:4 designs respectively. This is compared to conventional CMOS demultiplexer designs, showing an improvement in power reduction achieved with the reversible logic CNTFET approach. Challenges in CNT fabrication that could impact robust circuits are also discussed.
Performance evaluation of reversible logic based cntfet demultiplexer 2IAEME Publication
This document discusses the design and analysis of a reversible logic based carbon nanotube field effect transistor (CNTFET) demultiplexer. It presents the realization of 1:2 and 1:4 demultiplexers using reversible logic gates implemented with CNTFETs. Simulation results show the transient response and power consumption of the reversible logic CNTFET demultiplexers, with 0.8 and 1.6 nanowatts for the 1:2 and 1:4 designs respectively. This is compared to conventional CMOS demultiplexer designs, showing an improvement in power reduction achieved with the reversible logic CNTFET approach. Challenges in fabricating robust CNT-based circuits are also discussed.
This document describes a novel design of ternary logic gates using carbon nanotube field-effect transistors (CNTFETs). The authors propose a CNTFET-based design for ternary logic gates that eliminates the need for large off-chip resistors used in previous designs. Simulation results show the proposed ternary logic gates consume significantly lower power and delay compared to previous resistive-load CNTFET gate implementations. When used in arithmetic circuits like a full adder and multiplier, the proposed ternary gates combined with binary gates can reduce power delay product by over 90%.
This document discusses the design and analysis of a carbon nanotube field effect transistor (CNTFET) based D flip-flop (DFF). The proposed DFF uses a single clock phase and includes a reset function. Simulation results show it consumes significantly less power and has lower delay than a comparable 32nm CMOS DFF. Circuits like a gray counter and linear feedback shift register built using the CNTFET DFF achieve over 96% improvement in power delay product compared to CMOS designs. The document evaluates the performance of the proposed CNTFET DFF and compares it to a CMOS DFF in terms of propagation delay, power consumption, and other metrics. It demonstrates that CNTFET technology has potential
This document discusses the design and analysis of a D flip-flop (DFF) based on carbon nanotube field-effect transistors (CNTFETs). It presents a negative edge triggered DFF designed using pass transistor logic with single clock phase and reset function. Simulation results show the CNTFET DFF consumes significantly lower power and has less delay compared to a 32nm CMOS DFF. Application examples of the CNTFET DFF in a gray counter and linear feedback shift register also achieve over 90% improvement in power-delay product compared to CMOS designs. The document evaluates the performance of the CNTFET DFF and applications, demonstrating its advantages over CMOS technologies for low power, high performance applications
A NOVEL FULL ADDER CELL BASED ON CARBON NANOTUBE FIELD EFFECT TRANSISTORSVLSICS Design
Presenting a novel full adder cell will be increases all the arithmetic logic unit performance. In this paper, We present two new full adder cell designs using carbon nanotube field effect transistors (CNTFETs). In the first design we have 42 transistors and 5 pull-up resistance so that we have achieved an improvement in the output parameters. Simulations were carried out using HSPICE based on the CNTFET model with 0.9V VDD. The denouments results in that we have a considerable improvement in power, Delay and power delay product than the previous works.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Design and Fabrication of the Novel Miniaturized Microstrip Coupler 3dB Using...TELKOMNIKA JOURNAL
In this work, a novel miniaturized compact coupler using the shunt-stubs artificial transimission
lines with high and low impedances is presented. Design of the proposed coupler is accomplished by
modifying the length and impedance of the branch lines in the conventional structure with the planar
resonators in order to achieve branch line coupler with compact size and improvement of the
performances. First part of this work is focusing on the theorical study of the proposed resonators where
the equations are obtained. Secondly, the proposed coupler is designed on FR4 susbtrate, and simulated
by using the EM Solver (ADS from Agilent technologies and CST microwave studio) in order to operate in
the ISM band. The obtained results show good agreement with the simulations and the coupler shows a
good perfo6rmance in the hole bandwidth. The size of the proposed coupler is reduced around 50%
compared to the conventional design. The last part conerns the fabrication and test of the proposed
coupler. The measurement and simulation results are in good agreements.
Energy efficient routing algorithm in wireless sensor networksAlexander Decker
This document presents a new routing algorithm called SMA (solar aware routing with mobile agent concept) for wireless sensor networks that aims to improve energy efficiency. The SMA algorithm has two phases: a set-up phase where the sink node calculates the shortest paths from sensor nodes to solar-powered auxiliary sink nodes; and a steady state phase where mobile agents circulate along the determined paths to gather data from sensor nodes and send it to the sink node via the solar nodes. The document evaluates SMA through simulations and finds it outperforms existing client-server and mobile agent approaches in terms of energy consumption, end-to-end delay, and overall cost.
Designing High-Speed, Low-Power Full Adder Cells Based on Carbon Nanotube Tec...VLSICS Design
This article presents novel high speed and low power full adder cells based on carbon nanotube field effect
transistor (CNFET). Four full adder cells are proposed in this article. First one (named CN9P4G) and
second one (CN9P8GBUFF) utilizes 13 and 17 CNFETs respectively. Third design that we named
CN10PFS uses only 10 transistors and is full swing. Finally, CN8P10G uses 18 transistors and divided into
two modules, causing Sum and Cout signals are produced in a parallel manner. All inputs have been used
straight, without inverting. These designs also used the special feature of CNFET that is controlling the
threshold voltage by adjusting the diameters of CNFETs to achieve the best performance and right voltage
levels. All simulation performed using Synopsys HSPICE software and the proposed designs are compared
to other classical and modern CMOS and CNFET-based full adder cells in terms of delay, power
consumption and power delay product.
DESIGNING HIGH-SPEED, LOW-POWER FULL ADDER CELLS BASED ON CARBON NANOTUBE TEC...VLSICS Design
This article presents novel high speed and low power full adder cells based on carbon nanotube field effect transistor (CNFET). Four full adder cells are proposed in this article. First one named CN9P4G) and second one (CN9P8GBUFF) utilizes 13 and 17 CNFETs respectively. Third design that we named CN10PFS uses only 10 transistors and is full swing. Finally, CN8P10G uses 18 transistors and divided into two modules, causing Sum and Cout signals are produced in a parallel manner. All inputs have been used straight, without inverting. These designs also used the special feature of CNFET that is controlling the threshold voltage by adjusting the diameters of CNFETs to achieve the best performance and right voltage levels. All simulation performed using Synopsys HSPICE software and the proposed designs are compared to other classical and modern CMOS and CNFET-based full adder cells in terms of delay, power consumption and power delay product.
Similar to PARALLEL BIJECTIVE PROCESSING OF REGULAR NANO SYSTOLIC GRIDS VIA CARBON FIELD EMISSION CONTROLLED – SWITCHING (20)
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Building RAG with self-deployed Milvus vector database and Snowpark Container...Zilliz
This talk will give hands-on advice on building RAG applications with an open-source Milvus database deployed as a docker container. We will also introduce the integration of Milvus with Snowpark Container Services.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
PARALLEL BIJECTIVE PROCESSING OF REGULAR NANO SYSTOLIC GRIDS VIA CARBON FIELD EMISSION CONTROLLED – SWITCHING
1. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
DOI:10.5121/ijcsit.2016.8307 77
PARALLEL BIJECTIVE PROCESSING OF REGULAR
NANO SYSTOLIC GRIDS VIA CARBON FIELD
EMISSION CONTROLLED – SWITCHING
A.N. Al-Rabadia,*
, M.S. Mousab
, R.F. Al-Rabadic
, S. Alnawasrehb
,
B. Altrabshehd
, and M.A. Madanatb
(a) Electrical Engineering Department, Philadelphia University, Jordan &
Computer Engineering Department, The University of Jordan, Amman – Jordan
(b) Department of Physics, Mu'tah University, Al-Karak – Jordan
(c) German Association for International Cooperation (GIZ)
(d) Electrical Engineering Department, Philadelphia University, Jordan
ABSTRACT
New implementations for parallel processing applications using reversible systolic networks and the
corresponding nano and field-emission controlled-switching components is introduced. The extensions of
implementations to many-valued field-emission systolic networks using the introduced reversible systolic
architectures are also presented. The developed implementations are performed in the reversible domain to
perform the required parallel computing. The introduced systolic systems utilize recent findings in field
emission and nano applications to implement the function of the basic reversible systolic network using
nano controlled-switching. This includes many-valued systolic computing via carbon nanotubes and carbon
field-emission techniques. The presented realization of reversible circuits can be important for several
reasons including the reduction of power consumption, which is an important specification for the system
design in several future and emerging technologies, and also achieving high performance realizations. The
introduced implementations for non-classical systolic computation are new and interesting for the design
within modern technologies that require optimal design specifications of high speed, minimum power and
minimum size, which includes applications in adiabatic low-power signal processing.
KEYWORDS
Carbon Nanotubes and Nanotips, Controlled Switching, Field Emission, Reversibility, Systolic Grids.
1. INTRODUCTION
In current and emerging future design techniques, reversible computing will have wider
utilization in synthesizing modern computer circuits and systems [1, 20, 34, 36]. This is due to the
fact that reversible logic leads to the design of computer systems that consume much less power
and occupy much less space [1, 3, 9, 20, 29, 32, 34], where it was shown that if all physical sub-
circuits were designed to be reversible then the whole system composed of inter-connecting these
reversible sub-systems will minimize its operational need for power consumption [29]. For this
* Corresponding Author. This research was performed during sabbatical leave in 2015 – 2016 granted from
The University of Jordan and spent at Philadelphia University.
2. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
78
purpose, various important technologies have been investigated to implement reversibility such as
adiabatic CMOS circuits [36], optical computing [4] and quantum computation circuits and
systems [1, 2, 4, 15, 20, 32-34].
Simple and regular interconnections lead to high densities and cheap realizations, and higher
density implies both lower overhead and higher performance for the utilized components [1, 27,
28], where it has been shown that multi-processing plus multi-dimensional pipelining at each
phase of a pipeline can lead to a better computing performance [27, 28]. Systolic systems provide
parallel computation and inexpensive computing power, and provide a model of computation
which captures the important features of parallelism, interconnection sub-systems and pipelining,
which has been utilized in wide range of implementations [2, 27, 28, 38], and provide a good
model of computation for investigating concurrent algorithms for VLSI circuits and systems.
Parallel systolic VLSI processing takes into account issues of control, inter-processor
communications, and I/O processing and interfacing. In systolic systems, multi-dimensional
pipelining overlaps I/O with computing to ensure high throughput with no extra needed control
logic, where communication paths inherently require more energy and space than processing
elements (PEs) and communication between processors is achieved through fixed data paths that
have simple and regular geometries. It has been shown that data flow patterns in systolic
architectures are fundamental in matrix computations [27, 28]. Examples of this include two-way
flow on linearly connected networks which is common to both the solution of linear triangular
systems and matrix-vector multiplication, and three-way flow on hexagonally mesh-connected
networks which is common to both LU-decomposition and matrix multiplication.
Nanotechnology is an important modern scientific field that utilizes analysis and synthesis
techniques from several overlapping science and engineering sectors such as from physics,
chemistry, electronics and biology. Nanowires, nanoparticles, Carbon nanotubes (CNTs) and
Carbon nanofibers are just few examples of such important and widely-used nano systems [4, 5,
8, 11, 14, 16-19, 23, 26, 30, 37, 39]. The CNT is an important emerging technology within
nanotechnology that has wide range of applications in several various fields in technology and
science, where recent examples include TVs based on CNT field-emission that are of much
higher resolution than the available best plasma-based TVs, thinner and consume much less
power, and CNT-based nanocircuits such as CNT-based Field Effect Transistors (FETs) that are
much faster than the available silicon-based FETs and possess high potential for less power
consumption. Recently, carbon nanotubes have attracted much attention not only for their unique
morphologies and relatively small dimensions, but also for their potential applications in several
current and emerging technologies [8, 16-18]. CNT is made from graphite that is shaped in three
forms within nano dimensions: (1) Carbon nanoball (or buckyball) with the shape of a soccer ball,
(2) Carbon nanotube that is shaped as multi-wall CNT (MWCNT) and single-wall CNT
(SWCNT), and (3) Carbon nanocoil. Field electron emission is defined as electron emission
under the influence of the applied electric field from the surface of a cathode which is highly
dependent upon the emitting material work function [10, 21, 23, 25]. In this article, the utilization
of Carbon field emission – based devices that realize a basic building block in modern synthesis
known as the controlled switch [31, 36] is introduced, and the use of the presented Carbon field
emission-based devices in many-valued computations is also shown for the widely-utilized case
of ternary Galois logic. In this new realization, the applied Carbon field emission is obtained
using carbon-based nanotubes [5, 16-19] and carbon-based fiber nano-apex tips [6].
This article introduces reversible parallel processing via field emission-based systolic systems.
Figure 1 illustrates the corresponding layout of the introduced system design method.
3. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
79
System Systolic Implementations
Carbon Field-Emission Circuits
Carbon Field-Emission Devices
Carbon-Based Field Emission Technology
Field-Emission Physics
Galois Field Algebra
Figure 1. The introduced and utilized system implementation hierarchy.
The remainder of this article is organized as follows: Basic background on fundamentals of
reversible computing, systolic arrays and carbon-based nanotubes and nanotips are presented in
Section 2. The utilization of the Carbon field emission – based devices in controlled switching
and their application in parity-preserving circuits is introduced in Section 3. The extension of the
utilization of Carbon field emission – based controlled switching to the important case of many-
valued computations is introduced in Section 4. The implementation of controlled switching that
use Carbon field emission – based devices within reversible systolic architectures is introduced in
Section 5. Conclusions and future work are presented in Section 6.
2. BASIC BACKGROUND
This Section presents basic fundamentals and important background material in the fields of
reversible processing, parallel systolic computing and Carbon-based nanotubes and nanotips. This
will be utilized in Section 5 for the reversible parallel processing within systolic arrays using
controlled-switching via field emission – based nano multiplexing devices.
2.1. Reversible Computing
An (N, N) reversible system has the same number of inputs N and outputs N and is a one-to-one
mapping between vector of inputs and vector of outputs, thus the vector of input states is uniquely
reconstructed from the vector of output states [1, 3, 9, 20, 29, 32, 34]. Thus, an (N, N) reversible
map is a bijective function which is both injective (“one-to-one”) and surjective (“onto”). In
reversible computing, "garbage" outputs and inputs are auxiliary outputs and inputs that are
required only for the objective of reversibility. Figure 2 shows important reversible gates that are
utilized in the synthesis of reversible circuits and systems.
{a, c = a ⊕ b} {a, b, d = c ⊕ a ⋅ b} {fr0, fr1, c}
(a) (b) (c)
Figure 2. Important binary reversible primitives: (a) (2, 2) Feynman, (b) (3, 3) Toffoli,
and (c) (3, 3) Fredkin.
Because Galois field (GF) possesses attractive characteristics for several implementations such as
in communications, VLSI, testing and signal processing [1, 34], the performed developments will
be done utilizing the corresponding GF algebraic systems. The addition and multiplication tables
of radix two GF(2) and radix three GF(3) of Galois fields are defined as shown in Figures 3(a)
and 3(b), respectively.
a a
b c
a a
b b
c d
0
1
0
1
c
f0
f1
c
fr0
fr1
4. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
80
+ 0 1 ∗∗∗∗ 0 1
0 0 1 0 0 0
1 1 0 1 0 1
(a) (b)
Figure 3. Galois field addition and multiplication tables: (a) radix two and (b) radix three.
We define the single-variable function of 1-Reduced Post Literal (1-RPL) [1] as:
≠
=
=
ix
ix
xi
,0
,1 . (1)
For instance, {0
x, 1
x, 2
x} are the zero, first and second polarities of the 1-Reduced Post Literal,
respectively. Also, let us define the ternary shifts of variable x as {x, x', x"} to be the zero, first
and second shifts, respectively, i.e., x = x + 0, x’ = x +1 and x” = x + 2, where x ∈ {0, 1, 2}. The
ternary Shannon expansion over GF(3) for a ternary single-variable function is produced as:
f = 0
x f0 + 1
x f1 + 2
x f2, (2)
where f0 is the cofactor of f with respect to the variable x of value 0, f1 is the cofactor of f with respect to the
variable x of value 1, and f2 is the cofactor of f with respect to the variable x of value 2. It was presented [1]
that the 1-Reduced Post Literals defined in Equation (1) are related in terms of powers to the shifts of
variables as follows:
0
x = 2(x)2
+ 1, (3)
0
x = 2(x')2
+ 2(x'), (4)
0
x = 2(x")2
+ x", (5)
1
x = 2(x)2
+ 2(x), (6)
1
x = 2(x')2
+ x', (7)
1
x = 2(x")2
+ 1, (8)
2
x = 2(x)2
+ x, (9)
2
x = 2(x')2
+ 1, (10)
2
x = 2(x")2
+ 2(x"). (11)
After the substitution of Equations (3) - (11) in Equation (2), and after the minimization of the
terms according to the axioms of the Galois field, one obtains the following Equations:
f = 1⋅ f0 + x ⋅ (2f1+f2) + 2(x)2
(f0+f1+f2), (12)
f = 1⋅ f2 + x' ⋅ (2f0+f1) + 2(x')2
(f0+f1+f2), (13)
f = 1⋅ f1 + x" ⋅ (2f2+f0) + 2(x")2
(f0+f1+f2). (14)
Ternary fundamental single-variable Shannon and Davio expansions are presented in Equations
(2) and (12) - (14), respectively. These equations can be also rewritten in matrix-based forms as:
f = [ 0
x 1
x 2
x]
100
010
001
f
f
f
2
1
0
, (15)
f = [1 x x2
]
222
120
001
f
f
f
2
1
0 , (16)
f = [1 x’ (x’)2
]
222
012
100
f
f
f
2
1
0 , (17)
f = [1 x” (x”)2
]
222
201
010
f
f
f
2
1
0
. (18)
The extension for two or more variables of the many-valued Shannon and Davio decompositions
is achieved utilizing the corresponding Kronecker product of the transform matrix and Kronecker
+ 0 1 2 ∗∗∗∗ 0 1 2
0 0 1 2 0 0 0 0
1 1 2 0 1 0 1 2
2 2 0 1 2 0 2 1
5. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
81
product of the vector of basis functions. To introduce the method for creating reversible many-
valued Shannon and Davio decompositions [1], Definitions (1) – (2) are presented.
Definition 1. The matrix that is obtained from the permutations of many basis functions of the
same type of the corresponding spectral transform is called Generalized Basis Functions Matrix
(GBFM).
Definition 2. From all possible GBFM, the matrices that produce reversible decompositions are
called Reversible Generalized Basis Functions Matrices (RGBFM).
Example 1. For the following ternary Shannon transform over GF(3), [ ]
=
2
1
0
210
100
010
001
f
f
f
cccf
,
the following is one possible GBFM
ccc
ccc
ccc
012
120
210
. Yet, as will be shown, this GBFM is not
reversible since it does not generate a reversible expansion. One possible Reversible Shannon
GBFM (RSGBFM) that leads to a reversible expansion is
ccc
ccc
ccc
102
021
210
. As can be observed here, a
necessary constraint to generate the reversible many-valued Shannon decomposition [1] is that
the elements in any row or column of the utilized RSGBFM are orthogonally permuted compared
to the other elements in the corresponding positions of the other rows or columns.
This reversibility condition can be explained by means of tables as follows: since the Shannon
matrix is orthogonal, then the following (3, 3) ternary Shannon expansion in Equation (19a):
=
==
2
1
0
2
1
0
210
021
102
100
010
001
][
r
r
r
in
f
f
f
f
f
f
ccc
ccc
ccc
fRSGBFMf
rr , (19a)
is reversible subjected to input c is produced in the output, for which an altered form of Equation
(19a) is:
=
=
c
f
f
f
c
f
f
f
ccc
ccc
ccc
f
r
r
r
2
1
0
2
1
0
210
021
102
1000
0100
0010
0001
1000
0
0
0
r
. (19b)
As an example, we are using in this case Shannon set of basis functions {0
c, 1
c, 2
c} that appear in
the third row, but Shannon set of basis functions {0
c, 1
c, 2
c} can appear in any of the rows of the
corresponding RGBFM. The ternary Shannon expansion in Equation (19) is reversible as shown
in Table 1 using the permutation of cofactors.
Table 1. Permutation of cofactors as reversibility proof of the ternary Shannon expansion in Equation (19).
Thus, one may note that due to the uniqueness in the 1-RPL selection, the resulting function
values (i.e., cofactors f0, f1 and f2) are always distinct for different 1-RPL values. The same
method can be performed for any configuration that applies RSGBFM for any radix.
Example 2. The following are all possible permutations of the RGBFM for the Shannon matrix
100
010
001 to produce the corresponding reversible GF(3) Shannon expansions [1] given that input c is
produced in the output.
RPL
Function 0
c 1
c 2
c
Equation (19): f = f1 f2 f0
Equation (19): f = f2 f0 f1
Equation (19): f = f0 f1 f2
6. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
82
=
=
2
1
0
2
1
0
102
021
210
100
010
001
r
r
r
f
f
f
f
f
f
ccc
ccc
ccc
f
r , (20)
=
=
2
1
0
2
1
0
021
102
210
100
010
001
r
r
r
f
f
f
f
f
f
ccc
ccc
ccc
f
r , (21)
=
=
2
1
0
2
1
0
102
210
021
100
010
001
r
r
r
f
f
f
f
f
f
ccc
ccc
ccc
f
r , (22)
=
=
2
1
0
2
1
0
021
210
102
100
010
001
r
r
r
f
f
f
f
f
f
ccc
ccc
ccc
f
r , (23)
=
=
2
1
0
2
1
0
210
102
021
100
010
001
r
r
r
f
f
f
f
f
f
ccc
ccc
ccc
f
r , (24)
=
=
2
1
0
2
1
0
210
021
102
100
010
001
r
r
r
f
f
f
f
f
f
ccc
ccc
ccc
f
r . (25)
For the case of GF(2) two-valued XOR logic, there are two reversible Shannon primitives as
follows:
=
=
1
0
1
0
10
01
r
r
f
f
f
f
cc
cc
f
r
, (26)
=
=
1
0
1
0
10
01
r
r
f
f
f
f
cc
cc
f
r
. (27)
Reversible many-valued Davio expansions have been also created [1]. For example, for the
following reversible ternary Shannon expansion:
=
2
1
0
102
021
210
100
010
001
f
f
f
ccc
ccc
ccc
f
r , (28)
there exist three Davio types for each row of the RSGBFM. Utilizing the derivation of the ternary
Davio expansion (as in Equations (12) – (14)), the following are the D0-type expansions for the
first – third rows of the above RSGBFM
ccc
ccc
ccc
102
021
210
, respectively:
fD0,row0 = [1 c c2
]
222
120
001
f
f
f
2
1
0 , (29)
fD0,row1 = [1 c c2
]
222
012
100
f
f
f
2
1
0 , (30)
fD0,row2 = [1 c c2
]
222
201
010
f
f
f
2
1
0 . (31)
Equation (32) shows the ternary reversible Davio0 decomposition for the corresponding transform
matrix
222
012
100
in Equation (30). Note that we have two other choices of
222
120
001 and
222
201
010
transform matrices in Equations (29) and (31).
7. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
83
)32(
)222()2(
)222()2(
)222()2(
)32(
)222)(1()2)(2(
)222()2(
)222)(21()2)(1(
)32(
222
2
121
1
2111
222
012
100
121
1
2111
0,2
0,1
0,0
210
2
021
210
2
102
210
2
210
210
2
102
210
2
102
210
2
102
210
10
2
2
2
2
2
1
0
2
2
2
0
c
f
f
f
fffcffcf
fffcffcf
fffcffcf
b
fffccffcf
fffcffcf
fffccffcf
a
fff
ff
f
ccc
cc
ccc
f
f
f
ccc
cc
ccc
f
Dr
Dr
Dr
D
=
+++++
+++++
+++++
=
++++++++
+++++
++++++++
=
++
+
+++
+++
=
+++
+++
=
r
In general, there are many reversible gates that are used in the reversible synthesis of logic
circuits and systems, where Figure 4 shows important ternary GF-based reversible gates.
(a) (b) (c)
Figure 4. Ternary GF(3) reversible primitives: (a) (4, 4) Shannon (also known as Fredkin) primitive for
Equation (21), (b) (2, 2) Feynman primitive, and (c) (3, 3) Toffoli primitive.
For example, Table 2 shows the corresponding reversibility proof for the Toffoli primitive shown
in Figure 4(c). Completely reversible digital circuits and systems will significantly minimize
power consumption by implementing three constraints: (a) logical reversibility where the vector
of input states can always be uniquely reconstructed from the vector of output states, (b) physical
reversibility where the physical switch operates bidirectionally (backwards as well as forwards),
and (c) ideal-like switches that have no parasitic resistances.
Table 2. Reversibility of GF(3) (3, 3) Toffoli gate where inputs are in order {a, b, c} and outputs are in
order {a, b, d = c +3 a ∗3 b}.
2.2. Parallel Processing Systolic Arrays
Systolic arrays are special-purpose, cost-effective and high-performance systems that have wide
range of applications in scientific computing. Systolic arrays are single-instruction multiple-data
(SIMD) machines in which each processing element (PE) is only capable of performing a simple
000 000 100 100 200 200
001 001 101 101 201 201
002 002 102 102 202 202
010 010 110 111 210 212
011 011 111 112 211 210
012 012 112 110 212 211
020 020 120 122 220 221
021 021 121 120 221 222
022 022 122 121 222 220
0 1 2 0 1 2 0 1 2
c
fr0 fr1 fr2
f0 f1 f2
c
a
b
a
c
a
b
c
a
b
d
8. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
84
single operation [2, 27, 28]. In systolic computing, computations are synchronized by a global
clock signal, and data flows in a rhythmic fashion from the host through the array where data
items are pumped out from a memory. In systolic arrays, regular data flow is kept up in the
network where every PE regularly pumps data each time performing a short computation.
A systolic system consists of a set of interconnected cells, each capable of performing some
simple operation. Properly designed parallel structures communicate only with their nearest
neighbors since valuable time is usually lost when communicating between modules that are far
apart. Because regular, simple control and communication structures have substantial advantages
in implementations, cells in a systolic system are typically interconnected to form a systolic tree
or a systolic array. In systolic systems, communication with the outside world occurs only at the
“boundary” cells and information flows between cells in a pipelined fashion. The basic operation
of a systolic array is achieved by replacing a single PE with an array of PEs. The gain in
processing speed (millions of operations/second) is achieved as the number of pipeline stages has
been increased n-times which is equal to n-PEs. Other several advantages of systolic arrays
include regular and simple flows of data and control, repetitive use of simple and uniform
processing cells, and the important characteristic of expansionability.
Orthogonally connected, linearly connected and hexagonally connected PEs are different forms of
mesh-connected systolic arrays. For example, one-dimensional linear arrays are suitable for FIR
filter, discrete Fourier transform and convolution; two-dimensional square arrays are suitable for
graph algorithms and dynamic programming; two-dimensional hexagonal arrays are suitable for
DFT and matrix arithmetic; trees are suitable for searching algorithms; and triangular arrays are
suitable for formal language recognition and the inversion of triangular matrix. The globally
structured systolic array can speed-up computations only if the I/O bandwidth is high, where I/O
is still the bottleneck in modern systolic systems.
The following sub-sections present important examples of parallel processing using various
systolic architectures that highly accelerate intensive arithmetic – based computations which are
common in scientific computations.
2.2.1. Hexagonal (band matrix – band matrix multiplication) Kung systolic array
Since several scientific and engineering computations involve band matrices, band matrices find
important and wide implementations in several fields of scientific computing. This is also
important because a dense matrix can be viewed as a band matrix that have the maximum
bandwidth.
Each pulsation in a systolic array consists of the following operations: (1) shift, (2) multiply, and
(3) add. Basic processing cells that are used in the construction of systolic arithmetic arrays are
the add-multiply cells. This kind of cells has three inputs {a, b, c} and three outputs {a = a, b = b,
d = c + a ∗ b}. One may view the processing cell boundaries as having six interface registers that
are attached at I/O ports. All of these registers are clocked for synchronous data transfer between
adjacent cells. The add-multiply operation is required to perform the inner product within matrix-
matrix multiplication, matrix inversion, and dense matrix LU decomposition.
It has been shown that hexagonally-connected processing elements can maximize the
performance of the corresponding matrix multiplication, where pipelined three data streams flow
through the utilized array. Figure 5 shows the multiplication of two band matrices [A] and [B]
using two-dimensional hexagonal systolic array.
9. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
85
Utilizing Figure 5, one can understand the operation of the two-dimensional hexagonal systolic
array by following the corresponding data flow via moving transparencies of the band matrices
over the entire network.
(a)
(b)
Figure 5. Two-dimensional hexagonal systolic array: (a) Kung cell and (b) Kung systolic array.
Utilizing Figure 5, the multiplication of band matrices [A]⋅[B] = [C], and the associated definition
of bandwidths, are given as:
where w1 = 3 + 2 - 1 = 4, w2 = 2 + 3 – 1 = 4, and w3 = w1 + w2 – 1 = 4 + 4 – 1 = 7. Each front data
level in the three data flow streams in Figure 5 is called a wave front. From the lower side of
Figure 5, the initial values of the elements of input [C] array are all zeros, and the resulting values
of the elements of output [C] array at the upper side are obtained as follows:
.,,,,0
,,,
,,,,
,,,
,,,,
,,0,,,,
5555455435535555454544354345453435333535232515
5455445434535454454444344324424444343433243234
3423242224241214435433535343443343234243
433433332332133133332323221321232312131113
32535232432242423233223212313232232222122122
221212111251214241213211313121221121212112111111
bababacbababacbabacbacc
bababacbabababacbababac
babacbacbabacbababac
babababacbababacbabac
bacbabacbababacbababac
babaccbacbabacbabacbabac
++=++=+===
++=+++=++=
+==+=++=
+++=++=+=
=+=++=++=
+===+=+=+=
The distribution of PEs in the shown hexagonal systolic array is obtained as: # PEs in top-left =
w1 = 4, # PEs in top-right = w2 = 4, # PEs in bottom = w3 = 7. The total # PEs = 4 ⋅ 4 = 16.
2.2.2. Band matrix - vector multiplication systolic array
Since a dense matrix can be viewed as a band matrix that have the maximum bandwidth,
transforming vectors using band matrices are important in several implementations. This type of
multiplication is illustrated as follows:
a
d = c + a⋅b
b c a
b
PE
b21
b12
b13
b22 b23
b32
c11
c21 c12
c31 c22 c13
c41 c32 c23 c14
c42 c33 c24
c52 c43 c34 c25
b33
b24
b43
b11
a11a21a31
a12
a22a32a42
a23a33
a34
C
10. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
86
=
5
4
3
2
1
5
4
3
2
1
53
45444342
34333231
232221
1211
......00
0
0
00
000
y
y
y
y
y
x
x
x
x
x
a
aaaa
aaaa
aaa
aa
,
where the bandwidth w is computed as w = 3 + 2 - 1 = 4. Figure 6 illustrates the band matrix-
vector multiplication using one-dimensional systolic array, where the following operations occur:
.
,,,
5454443432424
434333232131332322212122121111
xaxaxaxay
xaxaxaxayxaxaxayxaxay
+++=
+++=++=+=
Using this type of arrays, it has been shown that the computation of n components of y are
performed in (2⋅n + w) time units as compared to O(n⋅w) which is needed on a uni-processor.
yi
(k+1)
= yi
(k)
+ aik⋅xki
(a) (b)
Figure 6. Band matrix – vector multiplication systolic array: (a) cell and (b) systolic architecture.
2.3. Carbon Nanotubes and Nanotips
This sub-section presents important background on Carbon-based nanotubes and nanotips and
their corresponding characteristics. The presented Carbon-based nanotubes and nanotips will be
utilized in building controlled-switching that will be later used for constructing the corresponding
reversible nano systolic networks in Section 5.
2.3.1. Carbon nanotubes characteristics
Carbon nanotube, which is a cylindrical graphite sheet, is geometrically formed in two distinct
shapes that affect CNT characteristics: (a) straight CNT and (b) twisted CNT. Figure 7 shows
different forms of CNTs and an important application in electronic devices using CNT as a
channel in FET transistors.
(a) (b) (c) (d)
Figure 7. Various formations and shapes of CNTs: (a) Carbon nanoball which has the shape of a soccer
ball, (b) single-wall CNT (SWCNT), (c) multi-wall CNT (MWCNT) array image using Scanning Electron
Microscopy (SEM) where these MWCNTs have been grown utilizing Chemical Vapor Deposition (CVD),
and (d) the implementation of CNT as a channel in FET transistors.
The emerging CNT technology has been applied in several new implementations [4, 5, 8, 11, 14,
16-19, 23, 26, 30, 37]. This includes TVs that are based on the field emission of CNTs, CNT-
based FETs that are faster and consume less power than the available silicon FETs, Carbon
a31
a42
a43
a21
a32
a22
a33
a11
a12
a23
a34
yi
xi
11. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
87
nanocoils that are used as nanosprings in nano dynamic systems and as inductors in nanofilters,
CNT-based rings, new composite materials, CNT probes, drug delivery systems, CNT data
storage devices capable of storing 1015
bytes/cm2
, nano lithography, and CNT gears. Table 3
illustrates several of the important CNT characteristics. For example, CNTs are very good field
emitters and facilitate the miniaturization of electronic devices. The dynamic and static
characterizations of field emitters consisting of a single CNT - both multi-walled and single-
walled - were illustrated [24] and the comparison to a field emitter consisting of an etched single
tungsten crystal was also investigated.
Table 3. Carbon nanotube characteristics.
Characteristic Single-Walled CNT Comparing Examples
Size
diameter of 0.6 - 1.8 nm
Electron-based beam
lithography can generate lines
50 nm wide and few nm thick
Density 1.33 – 1.40 g/cm3 Aluminum: 2.7 g/cm3
Strength
≈ 45·109
Pascals
High-strength steel alloys break
at ≈ 2·109
Pascals
Resilience
Can be bent at large angles and re-
straightened without damage
Metals and carbon fibers
fracture at grain boundaries
Current Capacity ≈ 1·109
A/cm2 Copper: ≈ 1·106
A/cm2
Field Emission
Can activate phosphors at
1 – 3 V if electrodes are spaced 1
micron apart
Molybdenum tips need
≈ 50 – 100 V/micrometer
with very short lifetimes
Heat Transmission
≈ 6,000 W/m·K at room
temperature
Almost pure diamond
transmits ≈ 3,320 W/m·K
Thermal Stability
Stable up to 2,800 C in vacuum
and 750 C in air
Metal wires in microchips
melt at ≈ 600 – 1,000 C
Cost ≈ 1,500 $/g Gold: ≈ 40 $/g
Quantum Electron Spin Preservation is very high
Preservation is low in
regular conductors
Power Consumption Very low Higher in metal wires
Performance (Speed) ≥ 1·1012
Hz nanoswitch ≥ 1,000 times as fast as µP
Resistance (Electron
Scattering)
Almost none Comparatively high
Energy Band Gaps
Easily tunable: almost zero like a
metal, as high as a Silicon, and
almost anywhere in between
No other recognized material
can be adjusted so simply
2.3.2. Carbon nanotube - based multiplexing devices
Figure 8 shows the design of a logic inverter. This device functions in the same way as a regular
CMOS-based inverter, where it uses two nanotube-based FETs [18].
In Figure 8, silicon is used as back-gate in the device, silicon dioxide is used as an insulator, gold
is used as conductors (electrodes), and PMMA is utilized as a cover that protects anything
beneath it from being exposed to oxygen since oxygen is used to obtain p-CNTFET from the
corresponding n-CNTFET.
12. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
88
Figure 8. Inverter gate using two nanotube-based FETs.
Figure 9 illustrates solid-state CNT-based multiplexer [5]. In Figure 9, CNT is used as a channel
in the corresponding FET transistor. Variable C is control input, selected inputs are A and B, and
F is the output. The device operates as a controlled-switch by switching between inputs A and B
depending on the specified value of control C [5].
Figure 9. The device structure of solid-state inter-molecular CNT multiplexer.
2.3.3. Carbon nanotubes - based field emitters
Field electron emission is the electron emission under the influence of the applied electric field (3
x 109
V/m) from a cathode surface which is highly dependent upon the material work function.
The general form of Fowler-Nordheim-type formulae [22] can be obtained as follows [21]:
J = λLaφ-1
F2
EXP[ -VF b φ3/2
/ F ] (33)
Equation (33) is used in all cases of field emission processes, where J is the local emission
current density, a and b are the first and the second Fowler – Nordheim constants, νF is the
barrier form correction factor where it accounts for the particular shape of the potential barrier
model, and λL is the local pre-exponential correction factor where it takes into account all of the
other factors that influence the emission. Factors νF and λL depend on the implemented field F.
To achieve the static modeling of CNT field emitters, field emission CNTs shown in Figures
10(b)-10(c) [24] were manufactured by Xintek, Inc. The copper anode is at the right and the CNT
emitter is mounted on a tungsten wire which is attached to the copper cylinder at the left as shown
in Figure 10(a). Carbon nanotube M-4 has a single MWCNT as the emitter, and carbon nanotube
C-3 has a single SWCNT as the emitter. The utilized CNTs were shaped in bundles of 10-30 nm
diameters, but in each carbon nanotube the field emission is performed from the single CNT at
the end of the bundle where the most intense electric field exists.
13. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
89
(a) (b) (c)
Figure 10. Field emission from CNT: (a) field emission CNTs made by Xintek, Inc. and (b) - (c) Scanning
Electron Microscopy (SEM) images of CNT emitters using JEOL Ltd. model JEM 6300.
The I-V DC characteristics were measured for these CNTs, as well as a field emitter tube from
Leybold Didactic GmbH, which has an etched tungsten single crystal as the emitter. The data
from the DC measurements were reduced by the Fowler-Nordheim analysis which is based on the
following simplified form of the Fowler-Nordheim equation:
J = A E2
e (-B/E)
, (34)
where J and E are the magnitudes of the current density and the electric field intensity, A = 1.541
x 10-6
/Φ, and B = 6.831 x 109
Φ3/2
. The work function values are Φ = 4.5 eV for tungsten and was
set to Φ = 4.9 eV for graphene. In order to apply the Fowler-Nordheim equation to the I-V DC
data, the following equation was also utilized which is correct for provided CNT:
I = CV2
e (-D/V)
. (35)
To get the equations for parameters S and R, which are utilized to characterize the used field
emitters, Equations (34) and (35) can be combined to obtain:
S = CD2
/AB2
, (36)
R ≡ V/E = D/B, (37)
where parameter S refers to the effective emitting area which would be the physical area of the
emitter if the current density were uniform over a fixed area and zero elsewhere, and parameter R
refers to the effective radius of curvature of the emitter but also includes the effects of local
intensification of the electric field caused by elongation of the emitter or the reduction of the field
which may be caused by shielding due to adjacent structures. The Fowler-Nordheim plots of the
I-V DC data were performed as shown in Figure 11.
0 .0 0 0 9 5 0 .0 0 1 0 0 0 .0 0 1 0 5 0 .0 0 1 1 0 0 .0 0 1 1 5 0 .0 0 1 2 0
-3 2
-3 1
-3 0
-2 9
-2 8
-2 7
ln(I/V
2
)
1 /V
Figure 11. The Fowler-Nordheim plot for experimented CNT that have a single SWCNT as emitter.
The values of parameter R, which is the effective radius of emitter curvature, were found to vary
within 77-110 nm for the utilized carbon nanotubes with CNT emitters. This suggests that values
of the local electric field at the emitting sites were as high as 14 V/nm in some of these
measurements. Others studying the field emission from various CNTs have provided approximate
values for the electric field by dividing the applied voltage by the distance between the anode and
14. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
90
the emitting tip, noting that this field would be intensified by the shape of the CNT, but not
estimating the local electric field at the emitting sites [35]. The Fowler-Nordheim analysis gave a
value of 91 nm for the effective radius of emitter curvature in the Leybold tube, suggesting that
the local electric field was as high as 5 V/nm in some of the performed measurements [24].
Current densities as high as 109
and 1012
A/m2
may be drawn from a tungsten emitter in steady-
state and pulsed operation, respectively, and the corresponding values of the applied static field
are 4.7 and 8.6 V/nm which may be considered as limiting field strengths for tungsten under these
applied conditions.
The Fowler-Nordheim analysis also showed that the parameter S, which is the effective emitting
area, varied within 81-230 nm2
for the carbon nanotubes with CNT emitters. If the current density
was uniform, this would correspond to circular emitting spots having radii of approximately 5-9
nm. Others have used Lorenz microscopy to observe the emitting sites for MWCNT field
emission. It has been found that one or more sites having radii of several nm, and the
corresponding data was in good agreement with other conducted experiments. The Fowler-
Nordheim analysis also showed that the effective emitting area for the tungsten tip in the Leybold
tube would correspond to a hemisphere with a radius of 290 nm. This result, and the value of 91
nm for the effective radius of emitter curvature in the Leybold tube, were in good agreement with
the radius of 100-200 nm which was indicated by Leybold.
Conducted experiments and simulations had shown that optical heterodyning (i.e., photomixing)
in laser-assisted field emission could be utilized as a new multi-octave bandwidth terahertz or
microwave source [7, 12, 13, 25].
2.3.4. Carbon fiber nanotips - based field emitters
Because of the technological significance of carbon fibers, there has been a rising interest with
regards to investigating the mechanism of field electron emission from these fibers under the
effect of an implemented electric field. Several advantages are obtained by using carbon fibers as
cathodes such as high current stability, long emitter durability, simplicity of emitter
manufacturing, and offering the ability to work in a relatively high pressure environment (10-6
mbar). These utilized cathodes are made either from carbon fibers or from other carbon-based
materials. Carbon fiber emitters can be achieved by electrolytic etching technique, where a 0.1
Molarit of sodium hydroxide solution (250 ml of distal water with 2g of NaOH) is used [6]. This
etching process could be controlled by choosing a suitable etching current. The etching process is
started after dipping the tip in the solution by about 2 mm and using a power supply to increase
the voltage until a certain initial current of about 30 µA is reached. The chosen etching current
produces sharp tips at the liquid surface which are afterwards being ultrasonically cleaned using
an ultrasonic cleaning device and mounted in a standard FEM microscope with a tip screen
distance of 10 mm. The anode is formed as phosphored screen to allow recording of the emission
images.
The FEM was evacuated to ultra high vacuum (UHV) conditions using rotary pump that produce
pressures of about 10-3
mbar and a diffusion pump system in addition to a liquid nitrogen (LN2)
trap that lead to finally reaching a base pressure of about 10-9
mbar. Then, the tips received
sample conditioning which consists of an initial baking of the system for 12 hours at 170 °C, a
follow up baking of the system for 12 hours, thermal relaxation for 12 hours at 170 °C, and
finally cooling the sample by liquid nitrogen while studying emission behavior [6]. This allowed
the recording of the effects of these conditioning processes on carbon fiber tips.
15. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
91
To record the emission behavior, the applied voltage from extra high tension (EHT) to the tip was
slowly increased until the emission current increased to about one microampere, and then the
voltage was slowly reduced until the emission current disappeared. Within this range, a linear
Fowler-Nordheim plot is expected. Figure 12 presents the scanning electron micrograph of a
produced very sharp carbon fiber tip at about 10,000 x magnification.
Figure 12. Scanning electron micrograph of a very sharp carbon fiber tip at 10,000 × magnification.
The apex radii of carbon fiber tips have been measured as the average of the graphically best-
fitting circles. The latter ones are utilized to interpret the experimental data and extract relevant
information such as the apex radii. During the experiments, electronic emission images have been
recorded by a standard digital camera to study the stability of the emission current and spatial
distribution. For practical applications, stability as well as brightness are important factors for
judging the quality of the used electron source. During the sample conditioning treatment, it was
found that there were statistical variations in the electronic emission of the various tip
microemitters under the corresponding UHV conditions. One of the very sharp carbon fiber tips
has been tested during sample conditioning treatment [6] where the apex radius of this tip was
around 57 nm. Figures 13-16 show the emission characteristics that are derived as the I-V
characteristics and the corresponding Fowler-Nordheim plots.
Figure 13. The I-V characteristics (left) and FN plot (right) of very sharp tip after initial baking for 12 hours at 170°C.
Figure 14. The I-V characteristics (left) and FN plot (right) of very sharp tip after follow-up baking for 12 hours at 170°C.
Figure 15. The I-V characteristics (left) and FN plot (right) of very sharp tip after thermal relaxation process for 12 hours.
16. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
92
Figure 16. The I-V characteristics (left) and FN plot (right) of very sharp tip during cooling process.
After initial baking, as was shown in Figure 13, the FN plot shows that emission current was
unstable and a non-linear behavior. The follow up baking, as shown in Figure 14, shows a
disconnected plot because the voltage drops from 66 V to 5.5 V where this drop is due to
hysterical current. As shown in Figures 15 and 16, the emission current stability becomes much
higher after the sample conditioning.
3. CARBON FIELD EMISSION – BASED CONTROLLED SWITCHING
This Section introduces the Carbon field emission – based controlled switches and their extension
to the case of many-valued Galois logic.
3.1. Two-to-One Controlled Switching
Utilizing the previously experimented and observed characterizations and operations of Carbon
field emission that were presented in sub-section 2.3, Figure 17 introduces the Carbon field
emission – based primitive that realizes the 2-to-1 controlled switch. The applied electric field
intensity (E), or equivalently the voltage (V) or work function (Φ), are utilized to implement the
input control signal that is used to control the electric function of the device.
The description of the operation of the Carbon field emission – based device shown in Figure
17(b) is as follows: by the implementation of the high voltage control signal (HV), the voltage
difference between the facing anode and Carbon cathodes is altered. This change will cause the
Carbon cathode with (HV) control signal to be field emitting while Carbon cathode with
complementary ( VH ) control signal to be without field emission. When the voltage difference is
reversed, Carbon cathode with complementary ( VH ) control signal will be field emitting while
Carbon cathode with (HV) control signal will be without field emission. Therefore, the device in
Figure 17(b) realizes the function of 2-to-1 controlled switching G = ac + bc'.
(a) (b) (c)
Figure 17. The implementation of the operation of 2-to-1 controlled switching using Carbon field emission:
(a) 2-to-1 multiplexing, (b) controlled switching via CNT field emission, and (c) 2-to-1 multiplexer block
diagram, where HV is the source with high-voltage and VH is the opposite (i.e., complementary) source.
The distance d needed between the facing anode and cathodes – as shown in the experimental
results - must be around 10 mm. If this distance is not applied, beam distortion will exist that will
affect the collected current at the facing anode screen.
a
b
c
2-1
CS
G
.
.
Control: c
Input1: a
Input2: b
G
HVHV
- -
R1
R2
17. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
93
Since the equations that relate the electric field intensity (E), voltage (V), distance (d), current
density (J), and work (energy) function (Φ), are as follows:
Φ = e⋅V, (38)
V = E⋅d, (39)
d = V / E, (40)
J = I / (a/Ω) = I ⋅ (Ω/a), (41)
where e is the electron charge ≅ 1.602 ⋅ 10-19
C, a is the tip area and Ω is the emission angle, then
the following represents the equation that models current value on the anode screen:
2VV
Bd
e
2Ωd
aA
I
−
=
(42)
Observing Equation (42), one can note the proportionality relation between the current value (I)
and both of the voltage difference (V) and tip area (a), and the inverse relation with the emission
angle (Ω), where A = 1.541 x 10-6
/Φ and B = 6.831 x 109
Φ3/2
. For instance, the values of the
work function are Φ = 4.5 eV for tungsten and Φ = 4.9 eV for CNT, where the usual value used
for electric field intensity E is ≥ 3⋅109
V/m, the distance d between the anode screen and CNT
cathode is ≅ 10 mm, and V ≅ 3⋅107
V.
3.2. Generalization to Many-to-One Controlled Switching
The synthesis of many-to-one (m-to-1) controlled switching via Carbon field emission can be
performed utilizing the basic two-to-one controlled switching from Figure 17(b). For instance, for
the case of three-valued logic, two devices from Figure 17(b) are required to implement the
function of 3-to-1 controlled switching as shown in Figure 18.
Figure 18. The three-to-one controlled switching utilizing Carbon field emission, where devices {D1, D2}
can be implemented using the switching device from Figure 17(b).
For the more general case of m-valued logic, and to realize the function of an m-to-1 controlled
switching, one requires (m-1) of 2-to-1 controlled switches as shown in Figure 19.
Figure 19. The realization of (m-to-1) controlled switching, where devices {D1,..., D(m-1)} can be the Carbon field
emission – based controlled switching from Figure 17(b).
Example 3. Using carbon field emission – based controlled switching, this example shows the
implementation of the important parity-preserving reversible controlled-swap gate. For error
.
.
.
D1
Control Signal #1:
Condition #1 ≡ “0”
Condition #2 ≡ “1”
Control Signal #(m-1):
Condition #1 ≡ “0”
Condition #2 ≡ “1”
…
.
.
.
.
.
.
D2
D3
D(m-1)
Control Signal #1:
Condition #1 ≡ “0”
Condition #2 ≡ “1”
Control Signal #2:
Condition #1 ≡ “0”
Condition #2 ≡ “1”
D1
D2
18. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
94
correction purpose, parity checking is one of the most widely used and oldest techniques that are
utilized for error detection within digital circuits and systems. It can be shown that reversible
logic gates having an equal number of inputs and outputs are sufficient for the parity preservation
if a reversible circuit at each gate is parity-preserving, where parity-preserving reversible gates
refer to reversible gates for which the parity of the output matches that of the input. The selection
from such gates depends on the specifications for the required circuit design process.
Fredkin gate [1, 20, 34] is a basic building block in reversible computing, where several
realizations were performed to implement Fredkin gate such as in optical, electrical and nano
mechanical technologies. As previously stated, parity-preserving reversible gates can be utilized
for the detection of existing faults. Given the fact that reversible gates have the same number of
input and output vectors, a sufficient requirement for parity preservation - in the course of
reversible computation with such gates - is that each gate must be parity-preserving, i.e., have the
same parity for the input and output vector.
For the binary Galois radix, let I = (a; b; c) and O = (P; Q; R) be the input and output vectors of a
(3, 3) reversible gate, respectively. We call a reversible gate to be a Parity-Preserving Reversible
Logic Gate (PPRLG) if the gate satisfies the parity-based equation: a ⊕ b ⊕ c = P ⊕ Q ⊕ R,
where ⊕ is the Boolean XOR, i.e., GF(2) addition.
Figure 20 shows two widely used PPRLGs which are based on the fundamental Fredkin primitive
(also known as the two-valued reversible Shannon primitive). In Figure 20, both of the reversible
gates are parity-preserving because they satisfy the parity equation a ⊕ b ⊕ c = P ⊕ Q ⊕ R.
(a) (b)
Figure 20. Representations for important reversible primitives: (a) reversible GF(2) Shannon1 (i.e.,
Fredkin1) and (b) reversible GF(2) Shannon2 (i.e., Fredkin2). Carbon field emission - based realization
shown in Figure 17(b) is used to realize both of the 2-to1 controlled switches.
For the general case of m-valued logic, an m-valued Galois PPRLG satisfies the equation a +m b
+m … +m c = P +m Q +m … +m R, where m = pk
, p is a prime number, k is a natural number of
value k ≥ 1, and {a, b, …, c} and {P, Q, …, R} are the corresponding input and output vectors of
an m-valued (m + 1, m + 1) reversible gate, respectively. As an example, for the important
specific case of the third radix Galois field, let I = (a; b; c; d) and O = (P; Q; R; L) be the input
and output vectors of a ternary (4, 4) reversible gate, respectively. A ternary PPRLG is a gate that
satisfies the parity-based GF3 equation of a +3 b +3 c +3 d = P +3 Q +3 R +3 L. For instance,
g0 g1 c g1r0 g1r1 c
0 0 0 0 0 0 0 0
1 0 0 1 0 0 1 1
2 0 1 0 0 1 0 2
3 0 1 1 1 0 1 5
4 1 0 0 1 0 0 4
5 1 0 1 0 1 1 3
6 1 1 0 1 1 0 6
7 1 1 1 1 1 1 7
g0 g1 c g2r0 g2r1 c
0 0 0 0 0 0 0 0
1 0 0 1 0 0 1 1
2 0 1 0 1 0 0 4
3 0 1 1 0 1 1 3
4 1 0 0 0 1 0 2
5 1 0 1 1 0 1 5
6 1 1 0 1 1 0 6
7 1 1 1 1 1 1 7
0 1 0 1
g0 g1
cc
g2r0 g2r1
0 1 0 1
g0 g1
c
g1r0 g1r1
19. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
95
Equation (43) characterizes the operation of the 3-valued Fredkin gate (also known as 3-valued
reversible Shannon):
=
=
2
1
0
2
1
0
210
021
102
100
010
001
r
r
r
g
g
g
g
g
g
ccc
ccc
ccc
g
r (43)
where i
c is 1-RPL and c ∈ {0, 1, 2}. An alternative form of Equation (43) is given in Equation
(44) for which it is explicitly shown that input c is produced in the output.
=
=
c
g
g
g
c
g
g
g
ccc
ccc
ccc
g
r
r
r
2
1
0
2
1
0
210
021
102
1000
0100
0010
0001
1000
0
0
0
r (44)
The reversible Shannon expansion in Equation (44) is represented using the 3-to-1 controlled
switching as illustrated in Figure 21, where Table 4 illustrates the corresponding reversibility
proof.
Figure 21. Realization of the reversible expansion in Equation (44) using three multiplexing devices.
Carbon field emission - based realization shown in Figure 18 is used to realize this 3-to-1 controlled switch.
Table 4. Reversibility proof of the (4, 4) primitive from Figure 21 and Equation (44).
4. MANY-VALUED COMPUTING USING CARBON FIELD EMISSION-BASED
DEVICES
The previously developed GF(3) Carbon field emission–based device will be used in this section
for implementing many-valued computing. This section demonstrates the utilization of Carbon-
based controlled switching for the ternary case, but implementations for higher Galois radices
follow the same illustrated method.
Inputs (I) Outputs (O)
g0 g1 g2 c gr0 gr1 gr2 c
g0 g1 g2 0 g1 g2 g0 0
g0 g1 g2 1 g2 g0 g1 1
g0 g1 g2 2 g0 g1 g2 2
0 1 2 0 1 2 0 1 2
c
gr0 gr1 gr2
g0 g1 g2
c
20. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
96
(a) (b)
Figure 22. The Carbon - based implementation of Galois arithmetic operations: (a) controlled switch that
can be implemented using the device from Figure 17(b), and (b) circuit that uses controlled-switching to
implement GF(3) addition and multiplication tables.
Figure 22 shows a controlled switch-based circuit that implements GF(3) addition and
multiplication tables, where Figure 22(a) can be implemented using the 2-to-1 Carbon field
emission – based device from Figure 17(b). For the internal nano interconnects in Figure 22(b),
they can be implemented – as one alternative – using CNTs as shown in Figure 23, where the
symbol = means a metallic CNT that is used as a nanowire.
In Figure 22(b), variables {A, B} ∈ {0, 1, 2} and inputs Ck (k = 0, 1, 2, 3) are 2-valued control
variables ∈ {0, 1}. Note that Figure 22(b) implements GF(3) addition and multiplication
operations by using the appropriate values of Ck that select variable inputs {A, B} and constant
inputs {0, 1, 2}. Table 5 illustrates an example for implementing the corresponding GF(3)
addition and multiplication tables using Figure 22(b).
(a) (b)
Figure 23. The realization of nano interconnects using CNT: (a) image from TEM of a bundle of SWCNTs
catalyzed by Ni/Y mixture, and (b) developing CNT wires on catalysts, where CNT meshes
are illustrated on which the metal catalyst is covered.
The circuit in Figure 22(b) can be used in the system design where GF(3) addition and
multiplication operations are applied. A simple example is presented as follows.
Table 5. An example for the implementation of GF(3) addition and multiplication tables using Figure 22(b),
where + means GF(3) addition, * means GF(3) multiplication, Ck (+) means that control variable Ck
implements the ternary addition operation, and Ck (*) means that control variable Ck implements the
ternary multiplication operation.
A B C G
a b 0 a
a b 1 b
A B C0 (+) C1 (+) C2 (+) C3 (+) C0 (*) C1 (*) C2 (*) C3 (*) + *
0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 1 0
0 2 1 0 0 0 0 0 0 0 2 0
1 0 0 0 0 0 1 0 0 0 1 0
1 1 0 0 0 1 0 0 0 0 2 1
1 2 0 1 0 0 1 0 0 0 0 2
2 0 0 0 0 0 1 0 0 0 2 0
2 1 0 1 0 0 0 0 0 0 0 2
2 2 0 0 1 0 0 0 1 0 1 1
A 0
B 1
C
G
A
B
0
1
2
C0 C1 C2 C3
0
1 0
1 K
0
1
0
1
21. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
97
Example 4. Three-valued function K = I4I1 +3 I2I3I1 +3 I2I3 can be implemented as follows using
the addition and multiplication operations that are realized using Figure 22(b) and Table 5.
Figure 24. A GF(3) circuit to implement the three-valued function K = I4I1 +3 I2I3I1 +3 I2I3, where Table 5
shows the implementation of GF(3) addition and multiplication tables using Figure 22(b), and the symbol =
means a metallic CNT that is used as a nanowire.
Example 5 shows the system-level design of an Arithmetic and Logic Unit (ALU) circuit by
illustrating the implementation of a 2-digit multiplier using the introduced Carbon field emission
- based devices.
Example 5. For a 2-digit m-valued multiplication performed using mod-multiplication, Figure 25
shows maps for the ternary multiplication and carry out functions, and Figure 26 shows the
corresponding 3-valued circuit realization.
(a) (b)
Figure 25. Ternary multiplication for ternary 2-digit multiplier: (a) multiply and (b) carry out.
Figure 26. Logic circuit of a ternary 2-digit multiplier.
The corresponding GF(3) addition and multiplication operations in Figure 26 could be
implemented using Table 5 that specifies input values to Figure 22(b). Further implementation of
the general m-valued N-bit full ALU, which is the main functional unit in the microprocessor data
path, that includes the realization of all arithmetic sub-units (addition, subtraction, multiplication,
division) and all logic sub-units (NOT, AND, OR, XOR), can be performed from the utilization
of the Carbon-based controlled switch device previously introduced by using the same method
which was used in the realization of the 2-digit multiplier shown in Figure 26.
x y 0 1 2
0 0 0 0
1 0 1 2
2 0 2 1
x y 0 1 2
0 0 0 0
1 0 0 0
2 0 0 1
*
*
*
* + K
+
0
*
+
B0 A0
*
+
B1 A0
0
++++ 0
0
Cout S3 S2 S1 S0
*
+
B0 A1
*
+
B1 A1
0
22. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
98
5. REVERSIBLE SYSTOLIC ARRAYS VIA CARBON FIELD - EMISSION
MULTIPLEXING
This section introduces the synthesis of m-valued Galois functions using Carbon field emission –
based reversible nano systolic arrays utilizing any of two methods: (1) reusing the classical add-
multiply PE cells by showing their m-valued Galois logic reversibility and thereafter reusing the
whole systolic structure since the connection of reversible PEs will produce by necessity a
reversible systolic circuit (cf. Figure 28), and (2) direct mapping of classical irreversible systolic
circuits into reversible systolic circuits by interconnecting the reversible counterpart of the
irreversible PEs. Moreover, the implementation of the m-valued logic functions using the
reversible systolic arrays is performed through two methods as shown in Figure 27.
Figure 27. Two methods to realize reversibly m-valued Galois logic by using reversible function
decompositions and reversible systolic arrays.
(a) (b)
(c)
Figure 28. Reversible GF(2) Kung systolic array: (a) reversible (3, 3) Toffoli gate,
(b) reversible (3, 3) Kung cell, and (c) reversible Kung systolic.
a
d = c +2 a ∗2 b
b
c
a
b
PE
a a
b b
c d = c +2 a ∗2 b
b21
b12
b13
b22 b23
b32
c11
c21 c12
c31 c22 c13
c41 c32 c23 c14
c42 c33 c24
c52 c43 c34 c25
b33
b24
b43
b11a11a21a31
a12a22a32a42
a23a33
a34
C
m-valued Reversible
Decompositions
m-valued
Reversible
Systolic Arrays
Galois m-valued
Function
23. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
99
Add-multiply cells are basic PEs used in the construction of arithmetic systolic arrays. Figure
28(a) introduces the binary (two-valued) (3, 3) reversible Toffoli gate that implements reversibly
- in the second radix Galois logic - the classical Kung add-multiply cell shown in Figure 28(b).
Since the interconnection of reversible PEs will produce by necessity a reversible systolic circuit,
Figure 28(c) implements the two-dimensional reversible Kung systolic array over GF(2) by
interconnecting the corresponding GF(2) (3, 3) reversible Toffoli gates.
The systolic implementation using GF(2) matrix-based elements, that can be obtained through the
corresponding GF(2) reversible Shannon function decomposition, is obtained as follows:
+
+
=
⋅
00000
00000
0000
0000
00000
00000
00000
0000
0000
00000
00000
00000
000
000
00000
1
0
0
1
1
1
0
0
1
0
01
10
efef
efef
f
f
ee
ee (45)
where 1
0
0
1
321
1
0
0
22132022
0
33
1
32
1
23
0
22 ,,,,,,, efefcefefcfbfbeaeaeaea +=+======= .
For the systolic implementation of m-valued functions, and as an example, the needed matrix-
based elements for the GF(3) reversible Shannon and Davio decompositions are, respectively:
++
++
++
=
⋅
00000
0000
0000
0000
00000
00000
0000
0000
0000
0000
00000
00
00
00
00000
0
2
2
1
1
0
2
0
1
2
0
1
2
2
1
1
0
0
0
2
1
0
210
021
210
efefef
efefef
efefef
f
f
f
f
eee
eee
eee (46)
Where:
.,,
,,,,,,,,,,,,,
2
1
1
0
0
2
432
0
1
2
0
1
332
2
1
1
0
0
23
043233123013
2
44
1
43
0
42
0
33
2
32
1
31
2
23
1
22
0
21
efefefcefefefcefefefc
fbfbfbfbeaeaeaeaeaeaeaeaea
++=++=++=
=============
++++++++
+++++
++++++++
=
++
+
⋅
+++
+++
00000
00)222)(1()2)(2(00
00)222()2(00
00)222)(21()2)(1(00
00000
00000
0000
0022200
00200
0000
00000
01120
001
002111
00000
210
2
102
210
2
102
210
2
102
2
210
10
2
2
2
2
fffeeffef
fffeffef
fffeeffef
f
fff
ff
f
eee
ee
eee
(47)
Where:
).222)(1()2)(2(),222()2(
),222)(21()2)(1(
,),222(,2,,1
,1,2,,,1,1,1,1
210
2
10243210
2
10233
210
2
10223
24321033102321344
2
4342
2
333231
2
232221
fffeeffefcfffeffefc
fffeeffefc
fbfffbffbfba
eeaeaeaeaaeeaeaa
++++++++=+++++=
++++++++=
=++=+===
++=+====++=+==
The realization of a many-variable function using the methods shown in Equations (45) – (47)
follow the matrix-based expansion using the Kronecker (tensor) product and GF(3) Toffoli PE.
The temporal complexity of the array in Figure 28 is T = 3n + min(w1, w2) and spatial complexity
for the count of auxiliary (garbage) outputs is 212 ww ⋅ .
The generalized case of m-valued logic is performed similarly to Figure 28 except that the
arithmetic operations will be done within the general case of m-valued Galois field and the
controlled-switching implementation will utilize the corresponding multiplexing architecture. For
example, the implementation of the fundamental cell in Figure 28(b) for the case of GF(3) is
performed by the utilization of Table 5 for the implementation of the Galois arithmetic GF(3)
addition and multiplication operations using Figure 22(b) that utilizes the serial interconnects of
several 2-to-1 basic controlled-switching elements, where each of these 2-to-1 controlled
switching elements can be directly implemented using the technique shown previously in Figure
17 utilizing Carbon field emission–based devices.
24. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
100
6. CONCLUSIONS AND FUTURE WORK
In this article, the synthesis and operation of reversible nano systolic architectures for the
implementation of general m-valued Galois functions using Carbon field emission – based nano
devices are introduced.
The implemented systolic architectures utilize nano controlled-switching realizations to
implement in the reversible space the corresponding nano reversible systolic systems using switch
logic for which logic circuits are implemented as combination of switches rather than a
combination of the more costly logic gates as in gate logic. Also, since controlled switching is of
fundamental importance in modern logic design, the presented design methods can have a wide
spectrum of implementations in a large variety of nano-based arithmetic-intensive modern
applications.
Future work will include items such as the fabrication and test of the new Carbon field emission–
based controlled switching devices and their corresponding integrated application in full system-
level nano reversible systolic architectures for real-time arithmetic-intensive implementations.
Also, future work will include the investigation of implementing m-valued logic functions in
three-dimensional Carbon field-emission nano systolic architectures.
REFERENCES
[1] A.N. Al-Rabadi, Reversible Logic Synthesis: From Fundamentals to Quantum Computing, Springer-
Verlag, 2004.
[2] A.N. Al-Rabadi, “Reversible systolic arrays: m-ary bijective single-instruction multiple-data (simd)
architectures and their quantum circuits,” Journal of Circuits, Systems, and Computers, Vol. 17, No.
4, pp. 729-771, 2008.
[3] A.N. Al-Rabadi, “New dimensions in non-classical neural computing, Part I: three-dimensionality,
invertibility, and reversibility,” Int. J. Intelligent Computing and Cybernetics, Emerald, Vol. 2, No.
2, pp. 348-385, 2009.
[4] A.N. Al-Rabadi, “New dimensions in non-classical neural computing, Part II: quantum, nano, and
optical,” Int. J. Intelligent Computing and Cybernetics, Emerald, Vol. 2, No. 3, pp. 513-573, 2009.
[5] A.N. Al-Rabadi, Carbon NanoTube (CNT) Multiplexers, Circuits, and Actuators, Patent US
7,508,039 B2, 2009.
[6] S. Alnawasreh, M.S. Mousa and A.N. Al-Rabadi, "Investigating the effects of sample conditioning
on nano-apex carbon fiber tips for efficient field electron emission," Jordan J. Physics, Vol. 8, No. 1,
pp. 51-57, 2015.
[7] K. Alonso and M.J. Hagmann, “Comparison of three different methods for coupling of microwave
and terahertz signals generated by resonant laser-assisted field emission,” J. Vacuum Science &
Technology B: Microelectronics and Nanometer Structures, Vol. 19, No. 1, pp. 68-71, 2001.
[8] G. Amaratunga, “Watching the nanotube,” IEEE Spectrum, pp. 28-32, 2003.
[9] C. Bennett, “Logical reversibility of computation,” IBM Journal of Research and Development, 17,
pp. 525-532, 1973.
[10] J.M. Bonard, J.P. Salvetat, T. Stöckli, L. Forro, and A. Chatelain, “Field emission from carbon
nanotubes: perspectives for applications and clues to the emission mechanism,” Applied Physics A:
Materials Science & Processing, Vol. 69, No. 3, pp. 245-254, 1999.
[11] J.M. Bonard, K.A. Dean, B.F. Coll, and C. Klinke, “Field emission of individual carbon nanotubes
in the scanning electron microscope,” Physical Review Letters, 89(19):197602-1:4, 2002.
[12] M. Brugat, M.S. Mousa, E.P. Sheshin, and M.J. Hagmann, “Measurement of field emission current
variations caused by an amplitude modulated laser,” Materials Science and Engineering A, 327(1):7-
15, 2002.
25. International Journal of Computer Science & Information Technology (IJCSIT) Vol 8, No 3, June 2016
101
[13] P.J. Burke, “Luttinger liquid theory as a model of the gigahertz electrical properties of carbon
nanotubes,”IEEE Transactions on Nanotechnology, 1(3):129-144, 2002.
[14] H.F. Cheng, Y.S. Hsieh, Y.C. Chen, and I.N. Lin, “Laser irradiation effect on electron field emission
properties of carbon nanotubes,” Diamond and Related Materials, 13(4-8):1004-1007, 2004.
[15] J. Cirac and P. Zoller, “Quantum computations with cold trapped ions,” Phys. Rev. Let., 74, No. 20,
pp. 4091–4094, 1995.
[16] P.G. Collins and P. Avouris, “Nanotubes for electronics,” Scientific American, pp. 62-69, 2000.
[17] P.G. Collins, M.S. Arnold, and P. Avouris, “Engineering carbon nanotubes and nanotube circuits
using electrical breakdown,” Science, Vol. 292, 2001.
[18] V. Derycke, R. Martel, J. Appenzeller, and P. Avouris, “Carbon nanotube inter- and intramolecular
logic gates,” Nano Letters, Vol. 0, No. 0, A – D, 2001.
[19] E. Drexler, Engines of Creation: the Coming Era of Nanotechnology, Anchor Books, 1986.
[20] R. Feynman, Feynman Lectures on Computation, Addison Wesley, 1996.
[21] R.G. Forbes, "Extraction of emission parameters for large-area field emitters, using a technically
complete Fowler–Nordheim-type equation," Nanotechnology, IOP Publishing, 23(9), 2012.
[22] R.H. Fowler and L.W. Nordheim, “Electron emission in intense electric fields,” Proceedings of the
Royal Society A: Mathematical, Physical and Engineering Sciences, 119(781):137-181, 1928.
[23] T. Fujieda, K. Hidaka, M. Hayashibara, T. Kamino, Y. Ose, H. Abe, T. Shimizu, and H. Tokumoto,
“Direct observation of field emission sites in a single multiwalled carbon nanotube by Lorenz
microscopy,” Jap. J. App. Phy., 44(4A): 1661 - 1664, 2005.
[24] M.J. Hagmann and M.S. Mousa, "Time-dependent response of field emission by single carbon
nanotubes," Jordan Journal of Physics, 1(1): 1-7, 2008.
[25] P. Hommelhoff, Y. Sortais, A. Aghajani-Talesh, and M.A. Kasevich, “Field emission tip as a
nanometersource of free electron femtosecond pulses,” Phy. Rev. Letters, 96(7):077401-1:4, 2006.
[26] J. Jiao, E. Einarsson, D.W. Tuggle, L. Love, J. Prado, and G.M. Coia, “High-yield synthesis of
carbon coils on tungsten substrates and their behavior in the presence of an electric field,” J.
Materials Res., Vol. 18, No. 11, pp. 2580-2587, 2003.
[27] H.T. Kung, “Why systolic architectures?,” Computer, Vol. 15, No.1, pp. 37 – 46, 1982.
[28] S.Y. Kung, VLSI Array Processors, Prentice-Hall, 1988.
[29] R. Landauer, “Irreversibility and heat generation in the computational process,” IBM J. Research
and Development, 5, pp. 183-191, 1961.
[30] K. Likharev, “Electronics below 10 nm,” in: Nano and Giga Challenges in Microelectronics, pp. 27-
68, 2003.
[31] M.M. Mano and C.R. Kime, Logic and Computer Design Fundamentals, 4th
ed., Prentice-Hall, 2008.
[32] N. Margolus, “Physics-like models of computation,” Physica, 10D, pp. 81 – 95, 1984.
[33] A. Muthukrishnan and C.R. Stroud, “Multivalued logic gates for quantum computation,” Phy. Rev.
A, V. 62, 2000.
[34] M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, CUP, 2000.
[35] A.N. Obraztsov, I. Pavlovsky, A.P. Volkov, E.D. Obraztsova, A.L. Chuvilin, and V.L. Kuznetsov,
"Aligned carbon nanotube films for cold cathode applications," J. Vacuum Science & Technology B,
18(2): 1059-1063, 2000.
[36] K. Roy and S. Prasad, Low-Power CMOS VLSI Circuit Design, John Wiley & Sons Inc, 2000.
[37] D. Tomanek, R. Enbody, K. Young-Kyun, and M.W. Brehob, “Nanocapsules containing charged
particles, their uses and methods of forming the same,” U.S. Patent US 2002/0027819 A1, 2002.
[38] Z. Yan and D.V. Sarwate, “New systolic architectures for inversion and division in GF(2m
),”IEEE
Trans. Comp., Vol. 52, No. 11, pp. 1514 – 1519, 2003.
[39] T.J. Webster, M.C. Waid, J.L. McKenzie, R.L. Price, and J.U. Ejiofor, “Nano-biotechnology: carbon
nanofibres as improved neural and orthopaedic implants,” Nanotechnology, 15, pp. 48-54, 2004.