І.М. Fedotova-Piven'

Annotations languages:

In an article in the framework of program model examined compare the performance of coincident in time addition of 50 positive 16-bit binary numbers in the linear redundant recurrent numeration system of the third order with alphabet {0, 1} created by the linear recurrence relation Bn=Bn-1+3Bn-3+2Bn-4, with starting values 1 1 1 1 2 4 8 and addition by turns of 50 integer positive 16-bit binary numbers on a standard algorithm of Wallace. Work of program model shows that coincident in time addition of 50 16-bit positive 16-bit binary numbers in the specified recurrent system of numeration performed 8.6 times faster and requires 7.3 times less memory to store intermediate results of calculations than the sequential addition for the classical algorithm Wallace.

Fedotova-Pyven, Y.N. (2015), "Sovmeshchennoe vo vremeny summyrovanye 50-ty tselыkh polozhytelnыkh chysel v rekurrentnoi systeme schyslenyia" [The coincident in time addition of fifty positive integers in the recurrent numeration system],