### Abstract

Anytime signal processing algorithms are to improve the overall performance of larger scale embedded digital signal processing (DSP) systems. In such systems there are cases where due to abrupt changes within the environment and/or the processing system temporal shortage of computational power and/or loss of some data may occur. It is an obvious requirement that even in such situations the actual processing should be continued to insure appropriate performance. This means that signal processing of somewhat simpler complexity should provide outputs of acceptable quality to continue the operation of the complete embedded system. The accuracy of the processing will be temporarily lower but possibly still enough to produce data for qualitative evaluations and supporting decisions. In this paper a new anytime Fourier transformation algorithm is introduced. The presented method reduces the delay problem caused by the block-oriented fast algorithms and at the same time keeps the computational complexity on relatively low level. It also makes possible the availability of partial results or estimates in case of abrupt reaction need, long or possibly infinite input data sequences.

Original language | English |
---|---|

Title of host publication | 2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings |

Pages | 266-271 |

Number of pages | 6 |

Publication status | Published - 2005 |

Event | 2005 IEEE International Workshop on Intelligent Signal Processing - Faro, Portugal Duration: Sep 1 2005 → Sep 3 2005 |

### Other

Other | 2005 IEEE International Workshop on Intelligent Signal Processing |
---|---|

Country | Portugal |

City | Faro |

Period | 9/1/05 → 9/3/05 |

### Fingerprint

### Keywords

- Anytime systems
- DFT
- FFT
- Transformed domain signal processing

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings*(pp. 266-271). [1531669]

**Anytime fourier transformation.** / Várkonyi-Kóczy, A.; Ruano, Graca.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings.*, 1531669, pp. 266-271, 2005 IEEE International Workshop on Intelligent Signal Processing, Faro, Portugal, 9/1/05.

}

TY - GEN

T1 - Anytime fourier transformation

AU - Várkonyi-Kóczy, A.

AU - Ruano, Graca

PY - 2005

Y1 - 2005

N2 - Anytime signal processing algorithms are to improve the overall performance of larger scale embedded digital signal processing (DSP) systems. In such systems there are cases where due to abrupt changes within the environment and/or the processing system temporal shortage of computational power and/or loss of some data may occur. It is an obvious requirement that even in such situations the actual processing should be continued to insure appropriate performance. This means that signal processing of somewhat simpler complexity should provide outputs of acceptable quality to continue the operation of the complete embedded system. The accuracy of the processing will be temporarily lower but possibly still enough to produce data for qualitative evaluations and supporting decisions. In this paper a new anytime Fourier transformation algorithm is introduced. The presented method reduces the delay problem caused by the block-oriented fast algorithms and at the same time keeps the computational complexity on relatively low level. It also makes possible the availability of partial results or estimates in case of abrupt reaction need, long or possibly infinite input data sequences.

AB - Anytime signal processing algorithms are to improve the overall performance of larger scale embedded digital signal processing (DSP) systems. In such systems there are cases where due to abrupt changes within the environment and/or the processing system temporal shortage of computational power and/or loss of some data may occur. It is an obvious requirement that even in such situations the actual processing should be continued to insure appropriate performance. This means that signal processing of somewhat simpler complexity should provide outputs of acceptable quality to continue the operation of the complete embedded system. The accuracy of the processing will be temporarily lower but possibly still enough to produce data for qualitative evaluations and supporting decisions. In this paper a new anytime Fourier transformation algorithm is introduced. The presented method reduces the delay problem caused by the block-oriented fast algorithms and at the same time keeps the computational complexity on relatively low level. It also makes possible the availability of partial results or estimates in case of abrupt reaction need, long or possibly infinite input data sequences.

KW - Anytime systems

KW - DFT

KW - FFT

KW - Transformed domain signal processing

UR - http://www.scopus.com/inward/record.url?scp=33749040946&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749040946&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33749040946

SN - 078039030X

SN - 9780780390300

SP - 266

EP - 271

BT - 2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings

ER -