Sciweavers

861 search results - page 33 / 173
» Faster integer multiplication
Sort
View
ICC
1997
IEEE
162views Communications» more  ICC 1997»
14 years 1 months ago
Combined Source-Channel Coding for the Transmission of Still Images over a Code Division Multiple Access (CDMA) Channel
— This letter considers a combined source-channel coding scheme for image transmission over the uplink of a wireless IS-95 code division multiple access (CDMA) channel using disc...
E. V. H. Iun, Amir K. Khandani
ICASSP
2011
IEEE
13 years 22 days ago
A novel fast canonical-signed-digit conversion technique for multiplication
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
Rui Guo, Linda DeBrunner
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
14 years 3 months ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig
CC
1999
Springer
320views System Software» more  CC 1999»
14 years 1 months ago
Floating Point to Fixed Point Conversion of C Code
In processors that do not support floating-point instructions, using fixed-point arithmetic instead of floating-point emulation trades off computation accuracy for execution spe...
Andrea G. M. Cilio, Henk Corporaal
ACSAC
2000
IEEE
14 years 1 months ago
The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
Johann Großschädl