Re: Truth Table Implementation

Mario Trams <Mario.Trams@informatik.tu-chemnitz.de>
4 Sep 2003 01:09:11 -0400

          From comp.compilers
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)
| List of all articles for this month |
From: Mario Trams <Mario.Trams@informatik.tu-chemnitz.de>
Newsgroups: comp.compilers,sci.logic,comp.lang.vhdl
Followup-To: comp.compilers
Date: 4 Sep 2003 01:09:11 -0400
Organization: TU Chemnitz
References: 03-08-081
Keywords: practice
Posted-Date: 04 Sep 2003 01:09:10 EDT

shibu wrote:


> Hi All,
> 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...


Using a lookup table for speed-optimization or a language description
(i.e. boolean logic coding) for size-optimization ???


Regards,
Mario

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.