in this errata, we reconsider and modify two propositions and their corollaries which were written on epi-retractable and co-epi-retractable modules.

The configuration management of a sensor network composed of tens or up to thousands of nodes is difficult due to the limit of memory space and energy consumption. This paper presents an approach for dynamic reconfiguration of application modules in sensor networks based on Nano-Qplus. The version information from proposed methods is registered into NVSync (Nano-Qplus Version Synchronization), ...

This paper proposes design techniques for the efficient VLSI implementation of bit-serial multiplication over a modulus. These techniques reduce multiplication into simple cyclic shifts, where the number representation of the data is chosen appropriately. This representation will, in general, be highly redundant, implying a relatively poor throughput for the multiplier. It is then shown how, by...

Fermat and Mersenne N T T s are relatively easy to implement, but unsuitable for many DSP applications, due to small block length over wordlength. This paper presents VLSI design techniques appropriate for a wider range of N T T s , including maximum-length N T T s , and presents a systolic architecture exploiting blocklength factorisation to decompose the architecture into sub-modules, themsel...

The paper presents the concepts behind the "Urdhva Tiryagbhyam Sutra" and "Nikhilam Sutra" multiplication techniques. It then shows the architecture for a 16×16 Vedic multiplier module using Urdhva Tiryagbhyam Sutra. The paper then extends multiplication to 16×16 Vedic multiplier using "Nikhilam Sutra" technique. The 16×16 Vedic multiplier module using Urdhva Tiryagbhyam Sutra uses four 8×8 Ved...

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

we investigate the problem of the existence of a frame forright ideals of a c*-algebra a, without the use of the kasparov stabilizationtheorem. we show that this property can not characterize a as a c*-algebraof compact operators.

the main objective of this study is to swing krull intersection theorem in primary decomposition of rings and modules to the primary decomposition of soft rings and soft modules. to fulfill this aim several notions like soft prime ideals, soft maximal ideals, soft primary ideals, and soft radical ideals are introduced for a soft ring over a given unitary commutative ring. consequently, the p...

In this paper an efficient high-speed architecture of Gaussian normal basis multiplier over binary finite field GF(2) is presented. The structure is constructed by using regular modules for computation of exponentiation by powers of 2 and low-cost blocks for multiplication by normal elements of the binary field. Since the exponents are powers of 2, the modules are implemented by some simple cyc...