What is the fastest way to rotate the bits in an 8x8 block on bits?

I'm not sure the exact term for what I'm trying to do. I have an `8x8` block of `bits` stored in `8 bytes`, each byte stores one row. When I'm finished, I'd like each byte to store one column. For example, when I'm finished: Byte0out = Byte0inBit0 + Byte1inBit0 + Byte2inBit0 + Byte3inBit0 + ... Byte1out = Byte0inBit1 + Byte1inBit1 + Byte2inBit1 + Byte3inBit1 + ... What is the *easiest* way to do this in **C** which performs well? This will run on a dsPIC microcontroller
So, the answer should be fastest or easiest?

以上就是What is the fastest way to rotate the bits in an 8x8 block on bits?的详细内容,更多请关注web前端其它相关文章!

赞(0) 打赏
未经允许不得转载:web前端首页 » CSS3 答疑

评论 抢沙发

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址

前端开发相关广告投放 更专业 更精准

联系我们

觉得文章有用就打赏一下文章作者

支付宝扫一扫打赏

微信扫一扫打赏