نتایج جستجو برای: exclusive orxor gate

تعداد نتایج: 70849  

Journal: :CoRR 2016
Anupam Chattopadhyay Anubhab Baksi

Reversible computation is gaining increasing relevance in the context of several post-CMOS technologies, the most prominent of those being Quantum computing. One of the key theoretical problem pertaining to reversible logic synthesis is the upper bound of the gate count. Compared to the known bounds, the results obtained by optimal synthesis methods are significantly less. In this paper, we con...

2014
Amir Mokhtar Chabi Samira Sayedsalehi Shaahin Angizi Keivan Navi

Quantum-dot cellular automata (QCA) are a transistorless computation approach which encodes binary information via configuration of charges among quantum dots. The fundamental QCA logic primitives are majority and inverter gates which can be utilized to design various QCA circuits. This study presents a novel approach to designing efficient QCA-based circuits based on Boolean expressions achiev...

2012
S. Wairya R. K. Nagaria S. Tiwari

New methodologies for XOR-XNOR circuits are proposed to improve the speed and power as these circuits are basic building blocks of many arithmetic circuits. This paper evaluates and compares the performance of various XOR-XNOR circuits. The performance of the XOR-XNOR circuits based on TSMC 0.18μm process models at all range of the supply voltage starting from 0.6V to 3.3V is evaluated by the c...

Journal: :IACR Cryptology ePrint Archive 2015
Siang Meng Sim Khoongming Khoo Frédérique E. Oggier Thomas Peyrin

In this article, we provide new methods to look for lightweight MDS matrices, and in particular involutory ones. By proving many new properties and equivalence classes for various MDS matrices constructions such as circulant, Hadamard, Cauchy and Hadamard-Cauchy, we exhibit new search algorithms that greatly reduce the search space and make lightweight MDS matrices of rather high dimension poss...

Journal: :EURASIP J. Adv. Sig. Proc. 2005
Sug Hyun Jeong Myung Hoon Sunwoo Seong Keun Oh

This paper proposes application-specific instructions and their bit manipulation unit (BMU), which efficiently support scrambling, convolutional encoding, puncturing, interleaving, and bit stream multiplexing. The proposed DSP employs the BMU supporting parallel shift and XOR (exclusive-OR) operations and bit insertion/extraction operations on multiple data. The proposed architecture has been m...

2014
SUBHASHEE BASU

Quantum dot cellular automata is an emerging nanoelectronic computational architecture which has the potential of faster speed, smaller size and minimum power consumption compared to transistor-based technology. In QCA, binary information are encoded as electronic charge configuration of a cell. Fundamental unit in building of QCA circuit is a QCA cell. A QCA cell is an elementary building bloc...

2007
Niloy Ganguly Biplab K Sikdar Pal Chaudhuri

This paper reports the complete characterization of additive cellular automata (ACA) that employ xor and xnor logic as the next state function. Compared to linear cellular automata (LCA) [3], which employs only xor logic in its next state function, an ACA display much wider varieties of state transition behavior and enhanced computing power. An analytical framework is developed to characterize ...

2010
Shiv Shankar Mishra Adarsh Kumar Agrawal R. K. Nagaria

ABSTRACT : In this paper, we review various design techniques for XOR-XNOR circuits as these circuits are basic building blocks of many arithmetic circuits. The XOR and XNOR circuits can be implemented in different architectures by using different circuit designs. This paper evaluates and compares the performance of various design techniques of XOR-XNOR circuits. The performance of the XOR-XNOR...

Journal: :IACR Cryptology ePrint Archive 2004
Claude Barral Jean-Sébastien Coron David Naccache

The 9/11 tragedy triggered an increased interest in biometric passports. According to several sources [2], the electronic ID market is expected to increase by more than 50% per annum over the three coming years, excluding China. To cost-effectively address this foreseen explosion, a very inexpensive memory card (phonecard-like card) capable of performing fingerprint matching is paramount. This ...

Journal: :J. Inf. Sci. Eng. 2018
Jen-Chun Chang Hsin-Lung Wu

The log-rank conjecture states that the deterministic communication complexity of a Boolean function g (denoted by D(g)) is polynomially related to the logarithm of the rank of the communication matrixMg whereMg is the communication matrix defined byMg(x, y) = g(x, y). An XOR function F : {0, 1} × {0, 1} → {0, 1} with respect to f : {0, 1} → {0, 1} is a function defined by F (x, y) = f(x⊕ y). I...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید