在 AVR 中，逻辑右移是否快了 2 的幂?

问题描述

我想知道在移动 2 的幂时执行逻辑右移是否更快

I would like to know if performing a logical right shift is faster when shifting by a power of 2

例如是

myUnsigned >> 4

比

myUnsigned >> 3

我很欣赏每个人的第一反应是告诉我不要担心这样的小事，它使用正确的算法和集合来减少重要的数量级.我完全同意你的看法，但我真的想尽我所能从嵌入式芯片(ATMega328)中挤出一切——我刚刚得到了一个值得哇哦！"的性能转变.通过用位移替换除法，所以我向你保证这很重要.

I appreciate that everyone's first response will be to tell me that one shouldn't worry about tiny little things like this, it's using correct algorithms and collections to cut orders of magnitude that matters. I fully agree with you, but I am really trying to squeeze all I can out of an embedded chip (an ATMega328) - I just got a performance shift worthy of a 'woohoo!' by replacing a divide with a bit-shift, so I promise you that this does matter.

推荐答案

我们来看看数据表:

http://atmel.com/dyn/resources/prod_documents/8271S.pdf

据我所知，ASR(算术右移)总是移位一位，不能取位数移位；执行需要一个周期.因此，右移 n 位需要 n 个周期.二的幂的行为与任何其他数字相同.

As far as I can see, the ASR (arithmetic shift right) always shifts by one bit and cannot take the number of bits to shift; it takes one cycle to execute. Therefore, shifting right by n bits will take n cycles. Powers of two behave just the same as any other number.

这篇关于在 AVR 中，逻辑右移是否快了 2 的幂?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持html5模板网！