30 Aug 2003 00:22:02 -0400

Related articles |
---|

Truth Table Implementation shibu_baby@yahoo.com (2003-08-23) |

Re: Truth Table Implementation roadieroger@earthlink.net (2003-08-30) |

Re: Truth Table Implementation tmk@netvision.net.il (2003-09-01) |

Re: Truth Table Implementation Mario.Trams@informatik.tu-chemnitz.de (Mario Trams) (2003-09-04) |

From: | roadieroger@earthlink.net (Roadie Roger) |

Newsgroups: | comp.compilers,sci.logic,comp.lang.vhdl |

Date: | 30 Aug 2003 00:22:02 -0400 |

Organization: | http://groups.google.com/ |

References: | 03-08-081 |

Keywords: | optimize |

Posted-Date: | 30 Aug 2003 00:22:02 EDT |

shibu_baby@yahoo.com (shibu) wrote

*> I have several truth tables like the following*

*>*

*> I/P1 I/P2 I/P3 I/P4 => O/P1, I/P1 I/P2 I/P3 => O/P1 O/P2, I/P1 I/P2*

*> I/P3 => O/P1 O/P2 O/P3 etc.*

*>*

*> I need to implement this as C code. What is the best way to implement*

*> this. I know SOP/POS will help me to simplify the truth tables.Is*

*> there any alternative way to solve this. Any generic/optimized way to*

*> solve this?*

*> Is there any lookup ideas to help me, so that I can say "N" Inputs and*

*> "Y" outputs...*

Are you using some kind of compiler/optimiser that will let you look

at the optimised equations? To state the obvious, if you have a total

of N states and inputs you have a lookup table of 2^N entries. The

width of each entry is the number of outputs you have. If you have a

limited number of inputs and lots of memory, the solution is

straightforward. Roadie Roger

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.