Hello! Can anyone tell me how can i implement a simple converter? Let's take the functions in the picture below. What should i do to find out what is the logic circuit that take as an imput f function elements and outputs g function ones? Thank you!

 

you mean your only input is F and you want output G? That is not possible.

 

I'm not sure what you mean... but if you want a simple dependency function, then g=b would suffice for the table shown.

 

My requirement is to build a converter from gray to aiken ( or whatever code to whatever another code... ). The problem arises when i can not see the pattern.
And yes, kubeek is right... that question is nonsensical.

 

You need to describe what you are doing in a bit more detail.

If you are asking about mapping an element of one sequence to the corresponding element of another sequence, such as from the typical Gray code sequence to binary, then the primary requirement is that there be a one-to-one mapping. After that it is a matter of determining the logic relationships between all of the bits of the starting sequence and each bit of the target sequence. Often times this can be done in a very elegant and not-easily-seen way by understanding the deeper structure of both sequences.

 

I got it... using karnaugh map, seems easy. Thanks!

 

I got it... using karnaugh map, seems easy. Thanks!

So, out of curiosity, what WAS the problem that you were trying to work?

 

A converter from AIKEN TO EXCES 3.