| ??? 05/19/01 18:09 Read: times |
#11726 - RE: an efficient parity generation scheme ? |
Here's a snippet of code for PIC processors (full offtopic here, hehe). Credit due to its author. Work left: translate it into 8051 code, I'm too lazy now... Txip. --- The six instructions below (provided by John Payson) will calculate the "Even" Parity for a Byte. At the end of the routine, bit 0 of "X" will have the "Even" Parity bit of the original number. "Even" Parity means that if all the "1"s in the byte are summed along with Parity Bit, an even number will be produced. swapf X,w xorwf X,f rrf X,w xorwf X,f btfsc X,2 incf X,f --- |
| Topic | Author | Date |
| an efficient parity generation scheme ? | 01/01/70 00:00 | |
| RE: an efficient parity generation scheme ? | 01/01/70 00:00 | |
| RE: an efficient parity generation scheme ? | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| RE: an efficient parity generation schem | 01/01/70 00:00 | |
| Re: mysterious bit named "P" | 01/01/70 00:00 | |
RE: an efficient parity generation scheme ? | 01/01/70 00:00 |



