The complexity of multiple wordlength assignment

DOI10.1016/S0893-9659(01)00107-0zbMATH Open0998.94512OpenAlexW2076688134MaRDI QIDQ1609441FDOQ1609441

Authors: Gerhard J. Woeginger, George A. Constantinides 

Publication date: 15 August 2002

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(01)00107-0

zbMATH Keywords

parallel processingdigital signal processingmultiple wordlength

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Title not available (Why is that?)
• On the Interaction of Roundoff Noise and Dynamic Range in Digital Filters*

Cited In (1)

• SQNR estimation of fixed-point DSP algorithms

This page was built for publication: The complexity of multiple wordlength assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609441)