The decline of N from N-labelled mature pea residues was followed in unplanted soil over 16.5 yr. Eight years after residue incorporation, 24% of the residue N input was still present in the soil and, after 16.5 yr, 16% of the residue N input remained. A double exponential model successfully described the decay of N from N-labelled pea residues. The total residual N declined with average decay ...

Many wireless ad hoc routing protocols have been proposed in the literature. Researchers are comparing and improving these protocols before standard routing protocols are defined. In this paper, we present a framework for wireless ad hoc routing protocols based on the concept of a relay node set (RNS). This framework facilitates the comparison, design, and improvement of wireless ad hoc routing...

A new and efficient number theoretic algorithm for evaluating signs of determinants is proposed. The algorithm uses computations over small finite rings. It is devoted to a variety of computational geometry problems, where the necessity of evaluating signs of determinants of small matrices often arises.

The use of the Residue Number System (RNS) in modern telecommunication and multimedia applications is becoming more and more important because it allows interesting advantages in terms of precision, power consumption and speed. Generally, the output conversion from residue to binary is the crucial point in effective realizations of application specific architectures based on residual arithmetic...

The residue number system (RNS) is a carry-free number system which can support high-speed and parallel arithmetic. Two major issues in efficient design of RNS systems are the moduli set selection and the residue to binary conversion. In this paper, we present two efficient residue to binary converters for the new three-moduli set {2, 2 + 1, 2 – 1}. This moduli set consists of pairwise relative...

Digital signal processing and multimedia applications often profit from the use of a residue number system. Among the most commonly used moduli, in such systems, are those of 221 and 2þ 1 forms and among the most commonly used operations are multiplication and sum-of-squares. These operations are currently performed using distinct design units and/or consecutive machine cycles. Novel architectu...

This paper introduces a new approach for implementing GF(2 m ) multiplication using Polynomial Residue Number Systems (PRNS). Irreducible trinomials are selected as the generating polynomials for the PRNS channels to enable conversion to-and-from PRNS to be implemented using simple XOR networks. A novel approach for modular reduction over GF(2 m ) is also presented for the PRNS architecture to ...

We derive the four dimensional N = 1/2 super Yang-Mills theory from tree-level computations in RNS open string theory with insertions of closed string Ramond-Ramond vertices. We also study instanton configurations in this gauge theory and their ADHM moduli space, using systems of D3 and D(–1) branes in a R-R background.

In this paper, a new reverse converter for the moduli set {2n, 2n–1, 2n–1–1} is presented. We improved a previously introduced conversion algorithm for deriving an efficient hardware design for reverse converter. Hardware architecture of the proposed converter is based on carry-save adders and regular binary adders, without the requirement for modular adders. The presented design is faster than...

In this paper we show how the usage of Residue Number Systems (RNS) can easily be turned into a natural defense against many side-channel attacks (SCA). We introduce a Leak Resistant Arithmetic (LRA), and present its capacities to defeat timing, power (SPA, DPA) and electromagnetic (EMA) attacks. keywords: Side Channel Attacks, Residue Number Systems, RNS Montgomery multiplication