نتایج جستجو برای: residue number system

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

2001
Makoto Sakaguchi

We propose a pregeometrical formulation of Berkovits’ open RamondNeveu-Schwarz(RNS) superstring field theories. We show that Berkovits’ open RNS superstring field theories arise by expanding around particular solutions of the classical equations of motion for this theory. Our action contains pure ghost operators only and so is formally background independent.

1999
Graham A. Jullien

In the above paper, two algorithms based on look-up tables for mixed-radix conversion are presented. Here, we show that one of the algorithms had been previously published in 1978, and we also take this opportunity to speak of the use of look-up tables for the residue number system with present and future technologies.

1998
H. Henkelmann A. Drolshagen

In this paper we will present an implementation of an RNS-to-Binary Converter based on the mixed radix conversion algorithm by using recently proposed new cell-elements. The proposed architecture can be generated automatically for arbitrary sets of moduli and the method is straight forward. This method is very well suited for standard cell implementations resulting in compact layouts.

2005
Benjamin A. Burrington James T. Liu

We examine the leading Regge string states relevant for semi-classical spinning string solutions. Using elementary RNS techniques, quadratic terms in an effective Lagrangian are constructed which describe massive NSNS strings in a space-time with five-form flux. We then examine the specific case of AdS5×S, finding the dependence of AdS “energy” (E0) on spin in AdS (S), spin on the sphere (J), a...

2001
Laurent Imbert Graham A. Jullien

This article presents a novel fault-tolerant technique which is based on the previously introduced Modulus Replication Residue Number System (MRRNS). Using the MRRNS mapping technique, we are able to compute using modular arithmetic over identical channels. We can make this system fault tolerant by increasing the number of channels, but by using some elementary polynomial properties we are able...

Journal: :IET Computers & Digital Techniques 2007
Ricardo Chaves Leonel Sousa

Residue number systems (RNS) are non-weighted systems that allow to perform addition, subtraction and multiplication operations concurrently and independently on each residue. The triple moduli set f22 1, 2, 2þ 1g and its respective extensions have gained unprecedent importance in RNS, mainly because of the simplicity of the arithmetic units for the individual channels and also of the converter...

2005
Ricardo Schiappa

We study the construction of D–brane boundary states in the pure spinor formalism for the quantisation of the superstring. This is achieved both via a direct analysis of the definition of D–brane boundary states in the pure spinor conformal field theory, as well as via comparison between standard RNS and pure spinor descriptions of the superstring. Regarding the map between RNS and pure spinor ...

Journal: :IEEE Trans. VLSI Syst. 1994
Ming-Bo Lin A. Yavuz Oruç

Conventional fault-tolerant modulo arithmetic processors rely on the properties of a residue number system with L redundant moduli to detect up to L / 2 errors. In this paper, we propose a new scheme that combines r-out-of-s residue codes with Berger codes to concurrently detect any number of module errors without any redundant moduli. In addition, this scheme can tolerate L faults if L redunda...

2003
Hiroshi Kunitomo

By using the hybrid formalism, superstrings in four-dimensional NS-NS plane waves are studied in a manifest supersymmetric manner. This description of the superstring is obtained by a field redefinition of the RNS worldsheet fields and defined as a topological N = 4 string theory. The Hilbert space consists of two types of representations describing short and long strings. We study the physical...

Journal: :CoRR 2016
Parham Ghayour

Comparison of two numbers in RNS systems is a challenging task. In this paper, a new algorithm to compare the magnitude of two RNS numbers, using a clustering method has been proposed. In the clustering process, each inputted number is assigned to a cluster. To compare the magnitude of two numbers, first the clusters of these numbers and their differences are obtained. Then by comparing these c...

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

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