Abstract: Generated chirp pulses are modified so that they have an increased time bandwidth product to compensate for noise and/or attenuation in a communication channel. In certain circumstances, the modification alone may be inefficient so a counterbalancing modification may be applied at the receiver.

Abstract: Generated chirp pulses are modified so that they have an increased time bandwidth product to compensate for noise and/or attenuation in a communication channel. In certain circumstances, the modification alone may be inefficient so a counterbalancing modification may be applied at the receiver.

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.

Abstract: Generated chirp pulses are modified so that they have an increased time bandwidth product to compensate for noise and/or attenuation in a communication channel. In certain circumstances, the modification alone may be inefficient so a counterbalancing modification may be applied at the receiver.

Abstract: Generated chirp pulses are modified so that they have an increased time bandwidth product to compensate for noise and/or attenuation in a communication channel In certain circumstances, the modification alone may be inefficient so a counterbalancing modification may be applied at the receiver.

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.