paper-with-me

홈 › Papers

Multiplication with Fourier Optics Simulating 16-bit Modular Multiplication

2018-10-19

This paper will describe a simulator developed by the authors to explore the design of Fourier transform based multiplication using optics. Then it will demonstrate an application to the problem of constructing an all-optical modular multiplication circuit. That circuit implements a novel approximate version of the Montgomery multiplication algorithm that enables the calculation to be performed entirely in the analog domain. The results will be used to corroborate the feasibility of scaling the design up to 16-bits without the need for analog to digital conversions at intermediate steps.

📄 PDF Abstract BibTeX arXiv:1801.01121

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Low Rank and Sparse Fourier Structure in Recurrent Networks Trained on Modular Addition

2025-03-28 · Akshay Rangamani

Modular addition tasks serve as a useful test bed for observing empirical phenomena in deep learning, including the phenomenon of \emph{grokking}. Prior work has shown that one-layer transformer architectures learn Fouri…

Attribute

The Discrete-Log Clock: How a Transformer Learns Modular Multiplication

2026-06-16 · Huu Danh Nguyen arxiv

When small transformers grok modular multiplication, prior work reports that the learned embedding has a "dense" Fourier spectrum requiring all frequencies. This contrasts with modular addition, where only a sparse set o…

Multiplication Beyond Groups: Stratified Fourier Mechanisms in Transformer Circuits

2026-07-08 · Zitong Andrew Chen, Junaid Hasan, Akhil Srinivasan, Hemkesh Bandi 외 arxiv

Transformers have demonstrated a remarkable ability to learn algorithmic reasoning, yet mechanistic analyses have mostly focused on globally invertible operations such as cyclic addition and group composition. In this wo…

Graph Signal Processing: Vertex Multiplication

2020-07-09 · Aykut Koç, Yigit E. Bayiz

On the Euclidean domains of classical signal processing, linking of signal samples to the underlying coordinate structure is straightforward. While graph adjacency matrices totally define the quantitative associations am…

Time SeriesTime Series Analysis

Machine learning for modular multiplication

2024-02-29 · Kristin Lauter, Cathy Yuanchen Li, Krystal Maughan, Rachel Newton 외

Motivated by cryptographic applications, we investigate two machine learning approaches to modular multiplication: namely circular regression and a sequence-to-sequence transformer model. The limited success of both meth…

regression