Results 201 to 210 of about 8,051 (256)

Reduced function in Chamaenerion angustifolium after sublethal glyphosate exposure. [PDF]

Sci Rep
Wood LJ, Golt AR, Berg-Khoo L, Hampton B.   +3 more
europepmc   +1 more source

Distribution, lipophilicity and tissue half-life as key factors in sulphonamide clearance from porcine tissues. [PDF]

J Vet Res
Burmańczuk A, Osypiuk M, Polska B, Kunicki D, Kocik M, Grzęda K, Markiewicz W, Yilmaz O, Grabowski T.   +8 more
europepmc   +1 more source

Structure-Based Design of New Series of Sulfonates with Potent and Specific BChE Inhibition and Anti-Inflammatory Effects. [PDF]

Int J Mol Sci
Kurma SH, Adarvez-Feresin C, Parravicini O, Garro A, Stepankova S, Hosek J, Pauk K, Lisicic J, Jampilek J, Enriz RD, Imramovsky A.   +10 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Use of Residue Arithmetic for Computation

IEEE Transactions on Computers, 1974
Residue arithmetic offers the possibility of "carryfree" arithmetic as far as the operations of addition, subtraction, and multiplication are concerned. It is faster to implement these operations using residue arithmetic as compared to implementation using binary arithmetic.
exaly   +2 more sources

Error Correction in Residue Arithmetic

IEEE Transactions on Computers, 1972
It is shown how single-error correction in a residue arithmetic system can be accomplished in an efficient and fast manner. Two redundant moduli are necessary. This construction is extended to multiple errors. Another method of error detection or correction for residue arithmetic is also described. Implementation of these methods is considered.
exaly   +2 more sources

A VLSI Residue Arithmetic Multiplier

IEEE Transactions on Computers, 1982
Recently, residue arithmetic has received increased attention in the open literature. Using table lookup methods and high-speed memory, modular arithmetic has been demonstrated. However, the memory size limitation of ECL, bipolar, and high-speed MOS limits the admissible size of the moduli used in the numbering system.
exaly   +2 more sources

On implementing the CRT in residue arithmetic

International Journal of Computer Mathematics, 1985
Fast and efficient implementation of a residue number to integer converters will be required to design fast residue number systems. This paper addresses the question of hardware implementation and presents several distinctly different supporting archi- tectures. Both designs are analyzed and compared in terms of their speed-complexity tradeoffs.
Fred J Taylor
exaly   +2 more sources

On the complex residue arithmetic system (CRNS)

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
Recently, a number of papers has been published on the subject of performing complex arithmetic in the residue number system. Methods have been proposed which reduce the arithmetic complexity of a complex multiply by more than 50 percent. In this correspondence it is shown that these methods achieve Winograd's lower bound, and how these efficient ...
exaly   +2 more sources

Binary Logic for Residue Arithmetic Using Magnitude Index

IEEE Transactions on Computers, 1970
We consider a residue number system using n pairwise relatively prime moduli m 1 ,⋯,m n to represent any integer X in the range M/ 2≤X>M/2, when M = ∏mi. The moduli m i are chosen to be of the 2-1 type, in order that the residue arithmetic can be implemented by means of binary registers and binary logic.
Thammavarapu R. N. Rao, Avtar K. Trehan
exaly   +3 more sources

Residue Arithmetic in FPGA Matrices

2006 International Conference on Dependability of Computer Systems, 2006
In this work there is presented the methodology of designing residue generators and arithmetic units for modern FPGA matrices. The proposed algorithms take advantage of dedicated logic for high-speed arithmetic present in Xilinx Spartan-2 and Virtex FPGA families.
openaire   +1 more source