2 papers
cs.AR2026
Decompose, Optimize, and Reconstruct: Very Large Constant Multiplication at Scale
Théo Cantaloube, Nicolai Fiege, Anastasia Volkova +1
Efficient arithmetic circuit design for resourceconstrained hardware involves challenging combinatorial optimization problems, among which Multiple Constant Multiplication (MCM) is…
cs.PL2024
Towards Fixed-Point Formats Determination for Faust Programs
Agathe Herrou, Florent de Dinechin, Stéphane Letz +2
Modern programmable digital signal processing relies on floating-point numbers for their ease of use. Fixed-point number formats have the potential to save resources and improve ex…