引用：
下面地址：
http://www-graphics.stanford.edu/~seander/bithacks.html#ParityNaive
介绍在程序开发中，需要对位进行特别操作的 精悍算法和技巧！
、对此共享给大家！
Bit Twiddling Hacks
Contents
- About the operation counting methodology
- Compute the sign of an integer
- Detect if two integers have opposite signs
- Sign extending from a constant bit-width
- Sign extending from a variable bit-width
- Sign extending from a variable bit-width in 3 operations
- Counting bits set, naive way
- Counting bits set by lookup table
- Counting bits set, Brian Kernighan's way
- Counting bits set in 12, 24, or 32-bit words using 64-bit instructions
- Counting bits set, in parallel
- Count bits set (rank) from the most-significant bit upto a given position
- Select the bit position (from the most-significant bit) with the given count (rank)
- Compute parity of a word the naive way
- Compute parity by lookup table
- Compute parity of a byte using 64-bit multiply and modulus division
- Compute parity of word with a multiply
- Compute parity in parallel
- Swapping values with subtraction and addition
- Swapping values with XOR
- Swapping individual bits with XOR
- Reverse bits the obvious way
- Reverse bits in word by lookup table
- Reverse the bits in a byte with 3 operations (64-bit multiply and modulus division)
- Reverse the bits in a byte with 4 operations (64-bit multiply, no division)
- Reverse the bits in a byte with 7 operations (no 64-bit, only 32)
- Reverse an N-bit quantity in parallel with 5 * lg(N) operations
- Computing modulus division by 1 << s without a division operation (obvious)
- Computing modulus division by (1 << s) - 1 without a division operation
- Computing modulus division by (1 << s) - 1 in parallel without a division operation
- Find the log base 2 of an integer with the MSB N set in O(N) operations (the obvious way)
- Find the integer log base 2 of an integer with an 64-bit IEEE float
- Find the log base 2 of an integer with a lookup table
- Find the log base 2 of an N-bit integer in O(lg(N)) operations
- Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup
- Count the consecutive zero bits (trailing) on the right linearly
- Count the consecutive zero bits (trailing) on the right in parallel
- Count the consecutive zero bits (trailing) on the right by binary search
- Count the consecutive zero bits (trailing) on the right by casting to a float
- Count the consecutive zero bits (trailing) on the right with modulus division and lookup
- Count the consecutive zero bits (trailing) on the right with multiply and lookup
- Interleave bits the obvious way
- Interleave bits by table lookup
- Interleave bits with 64-bit multiply
- Interleave bits by Binary Magic Numbers
- Determine if a word has a zero byte
- Determine if a word has a byte equal to n
- Determine if a word has byte less than n
- Determine if a word has a byte greater than n
- Determine if a word has a byte between m and n
相关推荐阅读
-
用户1546808 2012-05-30 22:47
- 经常访问的嵌入式网页荟萃
- WEB LEVEL | COMMENT A | AA- ...
-
- 汽车电子 行业的BOOTLOADER 技术解析
- 随着开发周期的日益缩短，软件开发的方式逐渐转变为动态更新，从而使得汽车电子模块使得顺应时代的潮流。目的： 1） 产品开发周期中，某一阶段需要释放对应的功能需要。 2）应对产品售后阶段，产品...
-
- 【博客大赛】CANBUS 物理信号的测试？
- 最近，在一个项目测试中，测试工程师提交一个ISSUE. 发现CANBU S 的物理信号 不服规范。 介绍： 速率：125KHZ. CAN Transceiver: TJA104...
-
- 汽车零部件的可靠性的反思 (二)
- 失效分析的三步骤 1. 寻找根源 2. 分析问题 3. 制定措施 samon在一家知名的汽车电子零部件公司做产品设计开发。最近他开发的部件收到客户的失效反馈。客户返...
-
- TPMS --不带LFI 的自动定位技术疑问？
- 最近一个接到一个GLOBAL 的项目，要求不带LFI 的TPMS 系统，实现轮胎的自动定位。 和同事们沟通后，得出需要借用整车的一些其他传感器信息才可以达到，当前TPMS SENSOR 本身要...
-
- 转发--关于王立军--一个才女的文章
- 一点愚见只为军 (一） 本人一介女流，素来相夫教子，对政治本无半点兴趣，前日忽闻立军之事，却心中不免阵痛。往日不论贪官下马还是清官提升，都觉与我一介布衣无关，自觉愚钝不敢妄论国事，...
EE直播间
更多
1
2
3
4
5
6
7
8
9
0
关闭
站长推荐
/3 
/3
文章评论（0条评论）
登录后参与讨论