flat assembler
Message board for the users of flat assembler.
Index
> Main > memory efficient multiply modulo 
Author 

b1528932
Code: 914 * 127 mod 2712 (9xx + 1x + 4) * (1xx + 2x + 7) 9xxxx + 18xxx + 63xx + 1xxx + 2xx + 7x + 4xx + 8x + 28 (x/zero = virtual left shift) 90000 + 18000 + 6300 + 1000 + 200 + 70 + 400 + 80 + 28 mod 2712: 504 1728 876 1000 200 70 400 80 28 sum each two 2232 1876 270 480 28 again 4108 750 28 modulo 1396 750 28 2174 mod 2712 = 2174 In theory it looks fine, but 'normally' with memory buffer i just do one modulo cycle. Here i dont know. I belive its compare and after that modulo. Any ideas how to optimize it? 

23 Feb 2011, 17:48 

< Last Thread  Next Thread > 
Forum Rules:

Copyright © 19992020, Tomasz Grysztar. Also on GitHub, YouTube, Twitter.
Website powered by rwasa.