post_parent): $temp_content = $post->post_content; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[1]; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[0]; $temp_content = strip_tags($temp_content); $temp_content = trim($temp_content); $authors = explode(",",$temp_content); ?> post_title));?>"> $value): ?> "> "> "> post_content); while ($parser->parse()) { if (($parser->iNodeName=="a")&&(substr_count($parser->iNodeAttributes['href'],".pdf")>0)): ?>

Software Modeling of Coincident in Time Addition of Twenty Positive Integers in the Redundant Recurrent Numeration System of the Third Order

Fedotova-Piven I.N., Piven O.B.

In an article in the framework of program models examined compare the performance of coincident in time addition of twenty positive integers 32-/16-bit numbers in the redundant recurrent numeration system of the third order 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 twenty integer positive 32-/16-bit binary numbers on a standard algorithm of Wallace.


Full text (pdf)