Re: Byte-wise boolean optimisation

fortunately my case is slightly simpler. I have one input byte and one
output byte and a given algorithm to transform the former into the latter,
but I want to simplify the algorithm to use just logic operators (instead
of loops).

The most simple way to do that is to use a table. Use your f1..8()
functions
to create the table either at runtime or at compiletime, whatever fits
better.

.

Relevant Pages

  • Re: Inverse chirp z
    ... It looks like chirp z and especially inverse transform is ... you have to separate the algorithm from the ... variant of Bluestein's 1968 FFT algorithm, ...
    (comp.dsp)
  • Graph simplification????
    ... graph into a sequence of serial boxes. ... I think that there a lot of application based on such algorithm ... * If a node has two or more edges directed outward of it, ... who can simplify it for me!!!!!!! ...
    (sci.math)
  • Re: "Discrete Hartley transform" vs " Discrete Fouuier transform"
    ... transform to think about from time to time. ... advantages from FHT algorithms for power-of-two sizes have, sadly, not ... Use Ron Mayer's algorithm from the early 1990's, ... trig tables and test it yourself. ...
    (comp.dsp)
  • Re: We have developed this revolutionary tech - now starts the hard work!
    ... We are a small software company who has developed this ... remarkable software technology; namely a new and improve way to do ... The algorithm is faster, more versatile and its output is both more stable ... It can be adapted in many ways to the data to transform ...
    (comp.dsp)
  • Re: fuzzy logic
    ... Let "implies" mean that one polytope fits inside of another. ... E.g. simplify "P implies Q" where P and Q are rectanges: ... So that algorithm is wrong. ... are a convenient extrapolation (a use of an extrapolating principle ...
    (comp.lang.ada)