Signal processing functions, algorithms and smurfs: the need for declarativity

Raymond T. Boute · Ghent University Academic Bibliography (Ghent University) · 2005

The gap between modelling techniques for DSP functionality and those for software implemenations is widening. This impedes unifying formalisms for analog, digital and software systems. Recovering these opportunities requires declarativity. A suitable formalism is outlined, based on a mathematical rather than a programming language. Examples show how it unifies continuous and discrete mathematics, from analysis to formal program semantics. The formalism provides crucial advantages in reasoning by calculation about all aspects of SP, and paves the way for software tools of the next generation. 1

Read the paper · More papers on PaperTik