Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMulti-Number CVT-XOR Arithmetic Operations in any Base System and its Significant Properties
162
0
0.0
(
0
)
Added by
Jayanta Kumar Das
Publication date
2015
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Carry Value Transformation (CVT) is a model of discrete dynamical system which is one special case of Integral Value Transformations (IVTs). Earlier in [5] it has been proved that sum of two non-negative integers is equal to the sum of their CVT and XOR values in any base system. In the present study, this phenomenon is extended to perform CVT and XOR operations for many non-negative integers in any base system. To achieve that both the definition of CVT and XOR are modified over the set of multiple integers instead of two. Also some important properties of these operations have been studied. With the help of cellular automata the adder circuit designed in [14] on using CVT-XOR recurrence formula is used to design a parallel adder circuit for multiple numbers in binary number system.
rate research
Read More
CVT and XOR are two binary operations together used to calculate the sum of two non-negative integers on using a recursive mechanism. In this present study the convergence behaviors of this recursive mechanism has been captured through a tree like structure named as CVT-XOR Tree. We have analyzed how to identify the parent nodes, leaf nodes and internal nodes in the CVT-XOR Tree. We also provide the parent information, depth information and the number of children of a node in different CVT-XOR Trees on defining three different matrices. Lastly, one observation is made towards very old Mathematical problem of Goldbach Conjecture.
We develop a theory and accompanying mathematical model for quantum communication via any number of intermediate entanglement swapping operations and solve numerically for up to three intermediate entanglement swapping operations. Our model yields two-photon interference visibilities post-selected on photon counts at the intermediate entanglement-swapping stations. Realistic experimental conditions are accommodated through parametric down-conversion rate, photon-counter efficiencies and dark-count rates, and instrument and transmission losses. We calculate achievable quantum communication distances such that two-photon interference visibility exceeds the Bell-inequality threshold.
Higher order corrections in perturbative quantum field theory are required for precise theoretical analysis to investigate new physics beyond the Standard Model. This indicates that we need to evaluate Feynman loop diagram with multi-loop integral which may require multi-precision calculation. We developed a dedicated accelerator system for multi-precision calculation (GRAPE9-MPX). We present performance results of our system for the case of Feynman two-loop box and three-loop selfenergy diagrams with multi-precision.
Residue number system (RNS) enables dimensionality reduction of an arithmetic problem by representing a large number as a set of smaller integers, where the number is decomposed by prime number factorization using the moduli as basic functions. These reduced problem sets can then be processed independently and in parallel, thus improving computational efficiency and speed. Here we show an optical RNS hardware representation based on integrated nanophotonics. The digit-wise shifting in RNS arithmetic is expressed as spatial routing of an optical signal in 2x2 hybrid photonic-plasmonic switches. Here the residue is represented by spatially shifting the input waveguides relative to the routers outputs, where the moduli are represented by the number of waveguides. By cascading the photonic 2x2 switches, we design a photonic RNS adder and a multiplier forming an all-to-all sparse directional network. The advantage of this photonic arithmetic processor is the short (10s ps) computational execution time given by the optical propagation delay through the integrated nanophotonic router. Furthermore, we show how photonic processing in-the-network leverages the natural parallelism of optics such as wavelength-division-multiplexing or optical angular momentum in this RNS processor. A key application for photonic RNS is the functional analysis convolution with widespread usage in numerical linear algebra, computer vision, language- image- and signal processing, and neural networks.
We show in this note that the average number of terms in the optimal double-base number system is in Omega(n / log n). The lower bound matches the upper bound shown earlier by Dimitrov, Imbert, and Mishra (Math. of Comp. 2008).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
