Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| 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) |
| Re: Bit swizzling tomcrick@gmail.com (Tom Crick) (2020-09-08) |
| [2 later articles] |
| From: | Kaz Kylheku <793-849-0957@kylheku.com> |
| Newsgroups: | comp.compilers |
| Date: | Sat, 5 Sep 2020 20:15:50 +0000 (UTC) |
| Organization: | Aioe.org NNTP Server |
| References: | 20-09-014 |
| Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="25441"; mail-complaints-to="abuse@iecc.com" |
| Keywords: | optimize |
| Posted-Date: | 05 Sep 2020 16:21:49 EDT |
On 2020-09-05, Rick C. Hodgin <rick.c.hodgin@gmail.com> 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.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.