Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: residue arithmetic

Sortuj według:

Ogranicz wyniki do:

Scaling of numbers in residue arithmetic with the flexible selection of scaling factor

Ulman Z., Czyżak M., Smyk R.

Poznan University of Technology Academic Journals. Electrical Engineering

2013

No. 76

175--179

A scaling technique of numbers in residue arithmetic with the flexible selection of the scaling factor is presented. The required scaling factor can be selected from the set of moduli products of the Residue Number System (RNS) base. By permutation of moduli of the number system base it is possible to create many auxiliary Mixed-Radix Systems (MRS). They serve as the intermediate systems in the scaling process. All MRS's are associated with the given RNS with respect to the base, but they have different sets of weights. For the scaling factor value resulting from the requirements of the given signal processing algorithm, the suitable MRS can be chosen that allows to obtain the scaling result in most simple manner.

Residue number system (RNS)

Sharoun A. O.

Poznan University of Technology Academic Journals. Electrical Engineering

2013

No. 76

265--270

In the residue number system, a set of moduli which are independent of each other is given. An integer is represented by the residue of each modulus and the arithmetic operations are based on the residues individually. The arithmetic operations based on residue number system can be performed on various moduli independently to avoid the carry in addition, subtraction and multiplication, which is usually time consuming. However, the comparison and division are more complicated and the fraction number computation is immatured. Due to this, a residue number system is not yet popular in general-purpose computers, though it is extremely useful for digital-signal-processing applications. This thesis deals with the design, simulation and microcontroller implementation of some (residue number system based) building blocks for applications in the field of digital signal processing. The building blocks which have been studied are binary to residue converter, residue to binary converter, residue adder and residue multiplier.

Pipelined division of signed numbers with the use of residue arithmetic for small number range with the programmable gate array

Smyk R., Ulman Z., Czyżak M.

Poznan University of Technology Academic Journals. Electrical Engineering

2013

No. 76

117--126

In this work an architecture of the pipelined signed residue divider for the small number range is presented. Its operation is based on reciprocal calculation and multiplication by the dividend. The divisor in the signed binary form is used to compute the approximated reciprocal in the residue form by the table look-up. In order to limit the look-up table address an algoritm based on segmentation of the divisor into two segments is used. The approximate reciprocal transformed to residue representation with the proper sign is stored in look-up tables. During operation it is multiplied by the dividend in the residue form and subsequently scaled. The pipelined realization of the divider in the FPGA environment is also shown.

Porównanie liczb w resztowym systemie liczbowym z wykorzystaniem parzystości

Plebanek M., Ulman Z., Ożarowski M.

Metody Informatyki Stosowanej

2008

nr 2 (Tom 15)

89-97

W artukule przedstawiono algorytm porównujący dwie liczby, których parzystość jest określana za pomocą ich funkcji rdzenia. Rozważono przypadek, gdy w bazie znajduje się moduł parzysty.

A new algorithm, of the comparison of integers in the Residue Number System, has been presented. Two cases were considered. One, when system base contains only odd moduli, and second, when one of the inoduli is even. Algorithms are based on number parity function. Parity is determined by use of core function.