From Scott Dattalo
Scott says:
The other day I stated that there is a faster Multiplication algorithm than the one posted by Martin, which is a variation of the one on James' Web page, which in turn is variation of the one found in three different places of the ECH. (Martin's routine is one cycle shorter, however if you allow the other routines to pass one of the multiplicands in W then they'd be one cycle shorter too.) The algorithm to which I referred is also found in the ECH  at least I thought it was. I was unable to find it. (Perhaps I was dreaming...) But it goes something like this:If the first bit tested in the shiftandadd multiplication algorithm is zero, then there's no need to perform the shiftandadd operation for the first iteration. If the next bit is zero too, you can skip that one as well. The first nonzero bit encountered doesn't need to be added, but it does need to be shifted.
Here's an example of the algorithm. However, I'm not sure if this is the optimum. It has a worst case execution time of 36 cycles excluding the return and call and has a best case excution time of 21 cycles and an average right around 34 cycles. So on average it saves one cycle over the other inline multiplication functions, but it takes 50% more code to do so. Unless I was desparate to save one cycle, I'd probably stick with the other versions.
; ; Multiply x*y and produce a 16bit result. The high byte of the ;result is aliased with x. ; multiply movf x,w ;; or save a cycle by letting the caller init. ;) clrc clrf res_lo btfsc y,0 goto l0 btfsc y,1 goto l1 btfsc y,2 goto l2 btfsc y,3 goto l3 btfsc y,4 goto l4 btfsc y,5 goto l5 btfsc y,6 goto l6 btfsc y,7 goto l7 clrf x ;Dmitry Kiryashov says: otherwise y==0 but x isn't goto l8 ;; or return l0 rrf x,f rrf res_lo,f btfsc y,1 addwf x,w l1 rrf x,f rrf res_lo,f btfsc y,2 addwf x,w l2 rrf x,f rrf res_lo,f btfsc y,3 addwf x,w l3 rrf x,f rrf res_lo,f btfsc y,4 addwf x,w l4 rrf x,f rrf res_lo,f btfsc y,5 addwf x,w l5 rrf x,f rrf res_lo,f btfsc y,6 addwf x,w l6 rrf x,f rrf res_lo,f btfsc y,7 addwf x,w l7 rrf x,f rrf res_lo,f l8 return
Questions:
Luc Laplante Says: "
Code not working...
Line 10 to 17 "addwf x,w" have error, "addwf x,f" is better!
"
+
file: /Techref/microchip/math/mul/8x8sd.htm, 3KB, , updated: 2010/12/6 07:53, local time: 2024/10/13 01:20,
©2024 PLEASE DON'T RIP! THIS SITE CLOSES OCT 28, 2024 SO LONG AND THANKS FOR ALL THE FISH!

©2024 These pages are served without commercial sponsorship. (No popup ads, etc...).Bandwidth abuse increases hosting cost forcing sponsorship or shutdown. This server aggressively defends against automated copying for any reason including offline viewing, duplication, etc... Please respect this requirement and DO NOT RIP THIS SITE. Questions? <A HREF="http://piclist.com/techref/microchip/math/mul/8x8sd.htm"> PIC Microcontoller Math Method </A> 
Did you find what you needed? 
PICList 2024 contributors:
o List host: MIT, Site host massmind.org, Top posters @none found  Page Editors: James Newton, David Cary, and YOU! * Roman Black of Black Robotics donates from sales of Linistep stepper controller kits. * Ashley Roll of Digital Nemesis donates from sales of RCL1 RS232 to TTL converters. * Monthly Subscribers: Gregg Rew. ongoing support is MOST appreciated! * Contributors: Richard Seriani, Sr. 
Welcome to piclist.com! 
.