assembly - Is there a system for realizing digital logic functions without branches? -


i going ask on electric engineering, decided it's more related programming.

with digital logic, can reduce truth tables minimized functions using karnaugh diagrams or boolean algebra. on cpu, these functions can of course expressed using conditional statements, however, i'm curious if there's standard approach realizing them without branches, using bit operations, whenever possible.

i don't know if ever interesting able nowadays, or if more efficient today's processors. still, might have been relevant in past , interesting know anyhow.

so, let's have f = !a*b + !b*!c, or similar function: there system (like karnaugh) finding out whether there's "smart" way avoid branches, using registers, calculating total bits, masking, anything? or, see if see , otherwise don't?


Comments

Popular posts from this blog

java - Jmockit String final length method mocking Issue -

asp.net - Razor Page Hosted on IIS 6 Fails Every Morning -

c++ - wxwidget compiling on windows command prompt -