Sujet : Re: Rewriting SSA. Is This A Chance For GNU/Linux?
De : invalid (at) *nospam* invalid.invalid (Richard Kettlewell)
Groupes : comp.os.linux.advocacy comp.os.linux.miscDate : 05. Apr 2025, 22:57:17
Autres entêtes
Organisation : terraraq NNTP server
Message-ID : <wwvikni9sqq.fsf@LkoBDZeT.terraraq.uk>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
User-Agent : Gnus/5.13 (Gnus v5.13) Emacs/28.2 (gnu/linux)
The Natural Philosopher <
tnp@invalid.invalid> writes:
Analogue multiplication is the holy grail and can be dome using the
exponential characteristics of bipolar transistors
>
https://www.analog.com/media/en/technical-documentation/data-sheets/ADL5391.pdf
The electronics there is far beyond me but how general (and how
reliable) can this be made?
The operations I’m currently interested in are modular multiplication,
addition and subtraction with comparatively small moduli (12-bit and
23-bit, currently). It’s a well-undertood problem with digital
computation, of course, but I’m curious about whether there’s another
option here.
-- https://www.greenend.org.uk/rjk/