[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [N8VEM-S100:3363] Re: GAL's and PALASM
- To: n8vem-s100@googlegroups.com
- Subject: Re: [N8VEM-S100:3363] Re: GAL's and PALASM
- From: David Riley <frave...@gmail.com>
- Date: Mon, 28 Apr 2014 23:29:20 -0400
- Authentication-results: gmr-mx.google.com; spf=pass (google.com: domain of frave...@gmail.com designates 2607:f8b0:400d:c01::22d as permitted sender) smtp.mail=frave...@gmail.com; dkim=pass head...@gmail.com; dmarc=pass (p=NONE dis=NONE) header.from=gmail.com
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=content-type:mime-version:subject:from:in-reply-to:date :content-transfer-encoding:message-id:references:to; bh=yyPvMr2cft5HmG42UbaHby93eOGUDFpK62qo4mWO4Rs=; b=NXVT8lQWWe7wJhL35uULjSzePAjSsraIi0ouD6ajY3QQWP8ygf056D2Fo1YN8IUxlL t8WV2J603Q40JxpGVbqO4MYu6/FjyD1befK26STMEe7KyX8MZxuKE7RKTlfRBKcd6P0N i+CW8zQbGeCEVeHlKePcmOJq9b6MlZBvDpDEMnWRdffqzEozdOSNVBoE41ZXZwpV+PXF LV06AO3gvG6xwiU3Fa6hKWa/BIGomyMxZJVq4JnosvpBQkDuPecKBI4ToBMeWMLdIf1O eHCaRhJ3uCAK7wTnxnNRg39cHqsQrB3+qvwvpBn/cngJqgfmaOc+iTfLLPKZXTTRJwwj zNSg==
- In-reply-to: <000d01cf6354$cf6c2ed0$6e448c70$@vitasoft.org>
- References: <c2d2c7b9-8df4-438b-a9c4-bc4286bc66a2@googlegroups.com> <de535713-a36f-4003-bb12-539c7d2f4ab4@googlegroups.com> <000d01cf6354$cf6c2ed0$6e448c70$@vitasoft.org>
On Apr 28, 2014, at 10:43 PM, John Monahan wrote:
> Not sure I understand what you have there Neil,
> Are you saying that if an equation has 16 terms you must have the outputs on either pins 18 or 19.
> But if the equation has only 8 terms any pin from 14 to 23 is OK.
> Do you mean “term” to be an input pin.
> John
A term is an individual AND term; the outputs of a PAL/GAL are the OR of a bunch of AND terms (e.g. (A & B) | (A & ~C)). The AND terms can be composed of as many of the input pins or their complements as you wish, but you can only OR a limited number of them together for the output. You can reuse the AND terms, though.
You might want to familiarize yourself with "sum of products" notation and how to decompose arbitrary boolean expressions into sums of products; that is what PALASM does internally (it's simple enough Boolean algebra that the minicomputers of the late '70s could do it symbolically without much trouble). It will better inform you of what your equations are actually turning into, which should also let you know what limitations you'll run into per pin.
- Dave