Path: ...!fu-berlin.de!nntp-feed.chiark.greenend.org.uk!ewrotcd!nntp.terraraq.uk!.POSTED.tunnel.sfere.anjou.terraraq.org.uk!not-for-mail From: Richard Kettlewell Newsgroups: comp.os.linux.advocacy,comp.os.linux.misc Subject: Re: Rewriting SSA. Is This A Chance For GNU/Linux? Date: Sat, 05 Apr 2025 22:57:17 +0100 Organization: terraraq NNTP server Message-ID: References: <6BidndvG26Vec236nZ2dnZfqnPadnZ2d@giganews.com> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 8bit Injection-Info: innmantic.terraraq.uk; posting-host="tunnel.sfere.anjou.terraraq.org.uk:172.17.207.6"; logging-data="175064"; mail-complaints-to="usenet@innmantic.terraraq.uk" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/28.2 (gnu/linux) Cancel-Lock: sha1:Xvqrn6fUWykI1VW08qR0FsqyYXQ= X-Face: h[Hh-7npe<v9!1Z&W?r\c.!4DXH5PWpga"ha +r0NzP?vnz:e/knOY)PI- X-Boydie: NO Bytes: 2530 Lines: 16 The Natural Philosopher 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/