DESIGN OF AN EFFICIENT REVERSIBLE LOGIC BASED BIDIRECTIONAL BARREL SHIFTER

Embedded digital signal processors and general purpose processors will use barrel shifters to manipulate data. This paper will present the design of the barrel shifter that performs logical shift right, arithmetic shift right, rotate right, logical shift left, arithmetic shift left, and rotate left operations. The main objective of the upcoming designs is to increase the performance without proportional increase in power consumption. In this regard reversible logic has become most popular technology in the field of low power computing, optical computing, quantum computing and other computing technologies. Rotating and data shifting are required in many operations such as logical and arithmetic operations, indexing and address decoding etc. Hence barrel shifters which can shift and rotate multiple bits in a single cycle have become a common choice of design for high speed applications. The design has been done using reversible fredkin and feynman gates. In the design the 2:1 mux can be implemented by fredkin gate which reduce quantum cost, number of ancilla bits and number of garbage outputs. The feynman gate will remove the fanout. By comparing the quantum cost, number of ancilla bits and number of garbage outputs the design is evaluated

DESIGN METHODOLOGY OF BIDIRECTIONAL BARREL SHIFTER BASED ON REVERSIBLE LOGIC

Data shifting is required in many key computer operations from address decoding to computer arithmetic. Full barrel shifters are often on the critical path, which has led most research to be directed toward speed optimizations. With the advent of quantum computer and reversible logic, design and implementation of all devices in this logic has received more attention. Rotating and data shifting are required in many operations such as logical and arithmetic operations, indexing and address decoding etc. Hence barrel shifters which can shift and rotate multiple bits in a single cycle have become a common choice of design for high speed applications. The design has been done using reversible fredkin and feynman gates. In the design the 2:1 mux can be implemented by fredkin gate which reduce quantum cost, number of ancilla bits and number of garbage outputs. The feynman gate will remove the fanout. By comparing the quantum cost, number of ancilla bits and number of garbage outputs the design is evaluated

Explorations for Efficient Reversible Barrel Shifters and Their Mappings in QCA Nanocomputing

This thesis is based on promising computing paradigm of reversible logic which generates unique outputs out of the inputs and. Reversible logic circuits maintain one-to-one mapping inside of the inputs and the outputs. Compared to the traditional irreversible computation, reversible logic circuit has the advantage that it successfully avoids the information loss during computations. Also, reversible logic is useful to design ultra-low-power nanocomputing circuits, circuits for quantum computing, and the nanocircuits that are testable in nature. Reversible computing circuits require the ancilla inputs and the garbage outputs. Ancilla input is the constant input in reversible circuits. Garbage output is the output for maintaining the reversibility of the reversible logic but is not any of the primary inputs nor a useful bit. An efficient reversible circuit will have the minimal number of garbage and ancilla bits. Barrel shifter is one of main computing systems having applications in high speed digital signal processing, oating-point arithmetic, FPGA, and Center Processing Unit (CPU). It can operate the function of shifting or rotation for multiple bits in only one clock cycle. The goal of this thesis is to design barrel shifters based on the reversible computing that are optimized in terms of the number of ancilla and garbage bits. In order to achieve this goal, a new Super Conservative Reversible Logic Gate (SCRL gate) has been used. The SCRL gate has 1 control input depending on the value of which it can swap any two n-1 data inputs. We proved that the SCRL gate is superior to the existing conservative reversible Fredkin gate. This thesis develops 5 design methodologies for reversible barrel shifters using SCRL gates that are primarily optimized with the criteria of the number of ancilla and garbage bits. The five proposed methodologies consist of reversible right rotator, reversible logical right shifter, reversible arithmetic right shifter, reversible universal right shifter and reversible universal bidirectional shifter. The proposed reversible barrel shifter design is compared with the existing works in literature and have shown improvement ranging from 8.5% to 92% by the number of garbage and ancilla bits. The SCRL gate and design methodologies of reversible barrel shifter are mapped in Quantum Dot Cellular Automata (QCA) computing. It is illustrated that the SCRL-based designs of reversible barrel shifters have less QCA cost (cost in terms of number of inverters and majority voters) compared to the Fredkin gate- based designs of reversible barrel shifters

COMPARATIVE ANALYSIS OF 4-BIT AND 8-BIT REVERSIBLE BARREL SHIFTER DESIGNS USING REVKIT

ABSTRACT In the recent years, reversible logic has emerged as a viable approach in power optimization and also has found its importance in low power CMOS, quantum computing, nanotechnology, and optical computing. The main challenge in reversible circuits is to optimize the quantum cost, time delay and the garbage outputs associated with the reversible circuit. 'RevKit' in recent years has become a popular and powerful tool for design visualization, implementation and analysis in reversible computing. In this work, we have implemented the design of reversible 4-bit and 8-bit barrel shifter circuits in RevKit and results are analyzed in terms of quantum cost, delay, garbage outputs, gate count, line count and transistor cost. Further, the simulation results have been documented and tabulated to facilitate a comparative study with conventional designs. Keywords: reversible circuits, barrel shifters, quantum cost, time delay, garbage output, RevKit. INTRODUCTION In irreversible logic computations [1], each bit of information lost generates kTln2 joules of heat energy, where k is Boltzmann's constant and T is the absolute temperature at which the computation is performed. Thus, the amount of energy dissipated in a system bears a direct relationship to the number of bits erased during the computation. The kTln2 energy dissipation can be avoided [2] if a computation is carried out in a reversible manner Rotating and shifting data in a single cycle are required in several applications like efficient computations and arithmetic operations. Barrel shifters, more suitable for this kind of operations, since, it is capable of shifting or rotating the inputs in a single cycle and find great importance in the digital signal processing computation. In reversible system information is not erased. The number of inputs and outputs are equal in reversible gates, which means that the input stage can always be retained from the output stage. Thus, such an implementation of reversible barrel shifter will be highly efficient when compared to any conventional design in terms of time delay, garbage output or the quantum cost associated with such a structure. The majority of the work that currently exists in literature focuses on optimizing the reversible sequential designs in terms of number of reversible gates and garbage outputs using functional verification. A few prior works have used design tools such as RevKi

IDPAL – A Partially-Adiabatic Energy-Efficient Logic Family: Theory and Applications to Secure Computing

Low-power circuits and issues associated with them have gained a significant amount of attention in recent years due to the boom in portable electronic devices. Historically, low-power operation relied heavily on technology scaling and reduced operating voltage, however this trend has been slowing down recently due to the increased power density on chips. This dissertation introduces a new very-low power partially-adiabatic logic family called Input-Decoupled Partially-Adiabatic Logic (IDPAL) with applications in low-power circuits. Experimental results show that IDPAL reduces energy usage by 79% compared to equivalent CMOS implementations and by 25% when compared to the best adiabatic implementation. Experiments ranging from a simple buffer/inverter up to a 32-bit multiplier are explored and result in consistent energy savings, showing that IDPAL could be a viable candidate for a low-power circuit implementation. This work also shows an application of IDPAL to secure low-power circuits against power analysis attacks. It is often assumed that encryption algorithms are perfectly secure against attacks, however, most times attacks using side channels on the hardware implementation of an encryption operation are not investigated. Power analysis attacks are a subset of side channel attacks and can be implemented by measuring the power used by a circuit during an encryption operation in order to obtain secret information from the circuit under attack. Most of the previously proposed solutions for power analysis attacks use a large amount of power and are unsuitable for a low-power application. The almost-equal energy consumption for any given input in an IDPAL circuit suggests that this logic family is a good candidate for securing low-power circuits again power analysis attacks. Experimental results ranging from small circuits to large multipliers are performed and the power-analysis attack resistance of IDPAL is investigated. Results show that IDPAL circuits are not only low-power but also the most secure against power analysis attacks when compared to other adiabatic low-power circuits. Finally, a hybrid adiabatic-CMOS microprocessor design is presented. The proposed microprocessor uses IDPAL for the implementation of circuits with high switching activity (e.g. ALU) and CMOS logic for other circuits (e.g. memory, controller). An adiabatic-CMOS interface for transforming adiabatic signals to square-wave signals is presented and issues associated with a hybrid implementation and their solutions are also discussed

New Approaches and Techniques for Drawing Lines on Raster Devices.

Two basic approaches to drawing lines on raster devices are discussed and improved upon. The first is the recursive bisection algorithm, a method recently proposed by John Rankin, which uses a fractal approach to draw lines. The second is the double-step algorithm, a method proposed by Xiaolin Wu and Jon Rokne, which is based on the traditional Bresenham approach to drawing lines. Although a number of line drawing algorithms exist, the algorithms presented are of interest because the double-step algorithm is one of the fastest line drawing algorithms. Furthermore, since lines are self-similar and fractals have been found to be useful in drawing other self-similar objects such as coastlines, plants, and terrain, the investigation of such an approach appears to be a worthwhile endeavor. In addition, some of the ideas presented can be applied to other line drawing algorithms and related problems such as incremental linear interpolation. Regarding the recursive bisection algorithm, modifications making it faster than the traditional Bresenham method while reducing the logarithmic space requirements to a constant are discussed. A more detailed examination of the error analysis is presented as well. A parallel version of the algorithm is also developed in which only two operations reducible to multiplication/division are required, equaling the lower bound and half the amount needed by the parallel Bresenham algorithm. In addition, the amount of logic needed is small. In the second part, modifications to the double-step line drawing algorithm are presented that allow additional pixels to be determined during some of the loop iterations. It is then shown that the resulting algorithm reduces the number of iterations by up to 33% while keeping the same worst case performance, code complexity, and initialization costs as the double-step algorithm. Lastly, this approach is generalized and applied to one of the fastest incremental linear interpolation algorithms, giving similar results

Index to NASA tech briefs, 1971

The entries are listed by category, subject, author, originating source, source number/Tech Brief number, and Tech Brief number/source number. There are 528 entries

Control system implementation on an AFM prototype

Tese de Mestrado Integrado, Engenharia Física, 2022, Universidade de Lisboa, Faculdade de CiênciasThis work deals with the implementation of a fine and coarse tip-sample distance control as well as with the tuning of several other features that will make one AFM prototype more user friendly. The main goal was to design and integrate a PI (Proportional-Integral) Analog Controller with digitally controllable gains. The development of the controller started by identifying and characterizing the system, with emphasis on the Z-axis Scanner’s response, which in turn allowed to build models for all the different components that make up the AFM. The PI Controller’s gains were arranged to be independently tuned via a digital potentiometer in conjunction with an analog multiplexer. The digital potentiometer provides a fine gain adjustment while the analog multiplexer increments the gains by an order of magnitude. These devices receive instructions from a microcontroller. In parallel, several other important enhancements were carried out, which include an implementation of an Auto-Approach functionality that automatically approaches the probe and sample without crashing onto each other. In order to achieve this, it was conducted an experimental study of the instrument’s motorized coarse motion structure. All the new features developed here were integrated in the existing prototype via the Arduino platform. To interface the signals outputted by the AFM circuitry and the microcontroller, as well as providing robust tolerance against faulty use, additional circuitry was included. This allows the reading of important signals within the instrument’s context, such as the deflection signal, amplitude signal and controller output. By taking advantage of the microcontroller’s features, it was designed a voltage source that serves as an adjustable setpoint via the PWM outputs from the Arduino. Finally, it was design and developed a GUI providing the user direct control of the tasks mentioned above and also displaying some quantitative and qualitative data, acquired by the microcontroller, about the state of the AFM

Low delay video coding

Analogue wireless cameras have been employed for decades, however they have not become an universal solution due to their difficulties of set up and use. The main problem is the link robustness which mainly depends on the requirement of a line-of-sight view between transmitter and receiver, a working condition not always possible. Despite the use of tracking antenna system such as the Portable Intelligent Tracking Antenna (PITA [1]), if strong multipath fading occurs (e.g. obstacles between transmitter and receiver) the picture rapidly falls apart. Digital wireless cameras based on Orthogonal Frequency Division Multiplexing (OFDM) modulation schemes give a valid solution for the above problem. OFDM offers strong multipath protection due to the insertion of the guard interval; in particular, the OFDM-based DVB-T standard has proven to offer excellent performance for the broadcasting of multimedia streams with bit rates over 10 Mbps in difficult terrestrial propagation channels, for fixed and portable applications. However, in typical conditions, the latency needed to compress/decompress a digital video signal at Standard Definition (SD) resolution is of the order of 15 frames, which corresponds to ≃ 0.5 sec. This delay introduces a serious problem when wireless and wired cameras have to be interfaced. Cabled cameras do not use compression, because the cable which directly links transmitter and receiver does not impose restrictive bandwidth constraints. Therefore, the only latency that affects a cable cameras link system is the on cable propagation delay, almost not significant, when switching between wired and wireless cameras, the residual latency makes it impossible to achieve the audio-video synchronization, with consequent disagreeable effects. A way to solve this problem is to provide a low delay digital processing scheme based on a video coding algorithm which avoids massive intermediate data storage. The analysis of the last MPEG based coding standards puts in evidence a series of problems which limits the real performance of a low delay MPEG coding system. The first effort of this work is to study the MPEG standard to understand its limit from both the coding delay and implementation complexity points of views. This thesis also investigates an alternative solution based on HERMES codec, a proprietary algorithm which is described implemented and evaluated. HERMES achieves better results than MPEG in terms of latency and implementation complexity, at the price of higher compression ratios, which means high output bit rates. The use of HERMES codec together with an enhanced OFDM system [2] leads to a competitive solution for wireless digital professional video applications