# How to optimise a logic circuit? [on hold]

I have the following 15 sets of binary outputs:

A B C D E b c d e f
1         1
1           1
1             1
1               1
1                 1
1         1
1           1
1             1
1               1
1         1
1           1
1             1
1         1
1           1
1         1


I want to create a logic circuit that turns each 4 bit input value into a different 10-bit output row. (There will be one 4 bit value unused, whose output I do not care about, as there are only 15 rows.)

The rows can be numbered in any order, provided there is an input which will generate each row.

How can I go about finding the optimal logic circuit and numbering scheme for the rows, to use the least gates?

## put on hold as unclear what you're asking by Elliot Alderson, Dave Tweed♦Sep 12 at 13:14

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

• Do you really mean outputs or do you mean inputs to your logic circuit? I think you may have 12 outputs and 15 inputs? What about the zeros? – Andy aka Sep 12 at 12:21
• Four bits of input (not shown) 15 outputs A-F and a-f. Zeros not shown because they obscured the pattern in the output. – fadedbee Sep 12 at 12:36
• Welcome to EE.SE! This appears to be a homework question. As such, you need to show us your work so far, and explain which part of the question you're having trouble with. For future reference: Homework questions on EE.SE enjoy/suffer a special treatment. We don't provide complete answers, we only provide hints or Socratic questions, and only when you have demonstrated sufficient effort of your own. Otherwise, we would be doing you a disservice, and getting swamped by homework questions at the same time. See also here. – Dave Tweed Sep 12 at 12:46
• So, what have you tried so far? You've offered us no clues about your level of skill in this area, and there's no way we're going to be able to give you a complete course in logic minimization in the space provided here. Also, you've provided no context around this problem, including the implementation technology you're using, or the timing constraints that you need to meet. – Dave Tweed Sep 12 at 13:01
• So the question is find an ordering of the input space that minimizes the number of gates required to implement the 10 output functions so defined, that's kind of interesting, and sounds like a search problem to me (but don't they all?). Only 16! possible orderings, better get cranking :-). – vicatcu Sep 12 at 13:28