Data flow graph
AssigneeRaptor Oil Limited
InventorsColin MACLEAN, Gordon COWIE
Life of this patent
Estimating the term…
Abstract
To provide dynamic data flow programming for digital signal processing, data flow graphs are constructed from graph libraries. The libraries provide redirection to relevant setup functions so that nodes of a graph table can be instantiated and associated memory can be allocated in dynamic working memory. The nodes of the graph table are modular and should conditions change, the data flow graph can be dynamically altered to change the parameters applied to these nodes thereby altering their functionality and adjusting the behavior of the data flow programming in accordance with the prevailing conditions.
Claims21
A method for executing, in a processor, a dynamically adjustable data flow graph for digital signal processing the method comprising:
- calling a graph setup routine for the data flow graph;
- executing the retrieved routine with a first set of parameter values, thereby instantiating the data flow graph;
- and
- when the graph set up routine is complete, calling a graph execution routine for the data flow graph,
- wherein executing the retrieved routine includes:
- building a node table corresponding to the data flow graph, the node table having one or more nodes and including arc information associated with each of said nodes;
- and
- allocating memory, and
- wherein the arc information defines a respective single arc joining any two nodes in the node table.
A processing device for executing a digital signal processing algorithm, the processing device including:
- a processor configured to:
- call a graph set up routine for a dynamically adjustable data flow graph;
- execute the retrieved routine with a first set of parameter values, thereby instantiating the data flow graph;
- and
- when the graph set up routine is complete, call a graph execution routine for the data flow graph
- wherein the processor is configured to execute the retrieved routine by:
- building a node table corresponding to the data flow graph, the node table having one or more nodes and including arc information associated with each of said nodes;
- and allocating memory, and wherein the arc information defines a respective single arc joining any two nodes in the node table.
Dependencies are inferred from the claim text.