TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Show HN: FMAs Complement – Like 2's Complement but for Matrix Multiplications

1 点作者 muragekibicho大约 1 年前
TLDR : A lookup table for matrix multiplications.<p>Simple description : This is a custom binary number system designed to calculate vector dot products.<p>Technical description : FMA&#x27;s complement is a fixed-point representation of binary numbers created — as an alternative to 2’s complement and 1’s complement — to perform the Fused Multiply-Add instruction.<p>We combine linear algebra and arithmetic codes (from data compression theory) to make a number system great for finding dot products.<p>Motivation I took a gap year to start a data compression startup (this was a mistake, I know) so I spent the past year working with Arithmetic Coders. I was trying to build a lookup table with random matrices and I saw patterns.<p>From my year&#x27;s long experience with data compressors - patterns should NOT exist in random data. I built this because, I could (with reasonable accuracy) estimate dot products using a lookup table.<p>This is the GitHub repo accompanying the article - <a href="https:&#x2F;&#x2F;github.com&#x2F;Fileforma&#x2F;FMA-Complement">https:&#x2F;&#x2F;github.com&#x2F;Fileforma&#x2F;FMA-Complement</a>

暂无评论

暂无评论