by Scott Dattalo Given two bits at any bit position of any arbitrary registers, what's the fastest way to find their sum and place that into yet another bit position of an arbitrary register?
I get 6-cycles:
movlw 1<<result_bit_position
bcf result,result_bit_position
btfsc x1,x1_bit_position
xorwf result,f
btfsc x2,x2_bit_position
xorwf result,f
| file: /techref/microchip/math/bit/bitsum.htm, 0KB, , updated: 2000/11/15 12:08, local time: 2009/11/7 17:58,
38.107.191.110:LOG IN
|
| ©2009 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? Please DO link to this page! Digg it! <A HREF="http://piclist.com/techref/microchip/math/bit/bitsum.htm"> PIC Microcontoller Bit Math Method - Sum two bits from different positions and registers</A> |
| Did you find what you needed? |
|
Calculator 7-seg LED chars, port values, resistor color codes and common values, ohms law, wavelength / frequency, RMS and Peak, max value for x bits, etc... |
SX MASTERS: Eric Smith and Richard Ottosen's SERVID is an intellegent RS232 video terminal (4x20 character display) in one chip. See the write up here.. |
.