Re: Bit Swizzling

"John Levine" <johnl@taugh.com>
5 Sep 2020 18:50:16 -0000

          From comp.compilers
Related articles
Bit swizzling rick.c.hodgin@gmail.com (Rick C. Hodgin) (2020-09-05)
Re: Bit swizzling DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-09-05)
Re: Bit Swizzling johnl@taugh.com (John Levine) (2020-09-05)
Re: Bit swizzling 793-849-0957@kylheku.com (Kaz Kylheku) (2020-09-05)
Re: Bit swizzling davidlovemore@gmail.com (davidl...@gmail.com) (2020-09-06)
Re: Bit Swizzling xxx.syseng.yyy@gfsys.co.uk (Chris) (2020-09-06)
Re: Bit swizzling martin@gkc.org.uk (Martin Ward) (2020-09-07)
Re: Bit swizzling rick.c.hodgin@gmail.com (Rick C. Hodgin) (2020-09-07)
Re: Bit swizzling DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-09-08)
[3 later articles]
| List of all articles for this month |
From: "John Levine" <johnl@taugh.com>
Newsgroups: comp.arch,comp.compilers
Date: 5 Sep 2020 18:50:16 -0000
Organization: Taughannock Networks
References: <riumcj$3j9$1@dont-email.me> <rivvah$1neg$2@gioia.aioe.org> 20-09-014
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="1888"; mail-complaints-to="abuse@iecc.com"
Keywords: optimize
Posted-Date: 05 Sep 2020 14:52:13 EDT
Cleverness: some

In article <rivvah$1neg$2@gioia.aioe.org>,
>> -----
>> Are there any algorithms which take a known-at-compile-time sequence
>> of bitwise operations on an 8-bit to 64-bit quantity, and optimize
>> them down to their minimal set of operations?


>Why not just use a lookup table ?. Minimum ops and fast...


Assuming you're looking for something you can implement in logic
rather than by table lookup, it sounds like a set of Karnaugh maps.


--
Regards,
John Levine, johnl@taugh.com, Primary Perpetrator of "The Internet for Dummies",
Please consider the environment before reading this e-mail. https://jl.ly


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.