Re: Bit swizzling

Kaz Kylheku <>
Sat, 5 Sep 2020 20:15:50 +0000 (UTC)

          From comp.compilers

Related articles
Bit swizzling (Rick C. Hodgin) (2020-09-05)
Re: Bit swizzling (Hans-Peter Diettrich) (2020-09-05)
Re: Bit Swizzling (John Levine) (2020-09-05)
Re: Bit swizzling (Kaz Kylheku) (2020-09-05)
Re: Bit swizzling ( (2020-09-06)
Re: Bit Swizzling (Chris) (2020-09-06)
Re: Bit swizzling (Martin Ward) (2020-09-07)
Re: Bit swizzling (Rick C. Hodgin) (2020-09-07)
Re: Bit swizzling (Hans-Peter Diettrich) (2020-09-08)
Re: Bit swizzling (Tom Crick) (2020-09-08)
[2 later articles]
| List of all articles for this month |

From: Kaz Kylheku <>
Newsgroups: comp.compilers
Date: Sat, 5 Sep 2020 20:15:50 +0000 (UTC)
Organization: NNTP Server
References: 20-09-014
Injection-Info:; posting-host=""; logging-data="25441"; mail-complaints-to=""
Keywords: optimize
Posted-Date: 05 Sep 2020 16:21:49 EDT

On 2020-09-05, Rick C. Hodgin <> wrote:
> Are there any existing algorithms which examine the operations that
> must be conducted and then create an optimized / minimal sequence of
> mechanical steps to conduct it given a constrained set of features
> (such as those present on a given CPU)?

For mapping 8 bit quantities to other 8 bit quantities, you can always
use a 256 byte look up table.

Of course, it's not practical for larger spaces. Still, it may be possibel to
identify the possibility of involving multiple smaller look-up tables.

Post a followup to this message

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