Anytime fourier transformation

A. Várkonyi-Kóczy, Graca Ruano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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 languageEnglish
Title of host publication2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings
Pages266-271
Number of pages6
Publication statusPublished - 2005
Event2005 IEEE International Workshop on Intelligent Signal Processing - Faro, Portugal
Duration: Sep 1 2005Sep 3 2005

Other

Other2005 IEEE International Workshop on Intelligent Signal Processing
CountryPortugal
CityFaro
Period9/1/059/3/05

Fingerprint

Signal processing
Processing
Digital signal processing
Embedded systems
Computational complexity
Availability

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Várkonyi-Kóczy, A., & Ruano, G. (2005). Anytime fourier transformation. In 2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings (pp. 266-271). [1531669]

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

2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings. 2005. p. 266-271 1531669.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Várkonyi-Kóczy, A & Ruano, G 2005, Anytime fourier transformation. in 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.
Várkonyi-Kóczy A, Ruano G. Anytime fourier transformation. In 2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings. 2005. p. 266-271. 1531669
Várkonyi-Kóczy, A. ; Ruano, Graca. / Anytime fourier transformation. 2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings. 2005. pp. 266-271
@inproceedings{4e3c03797c1348c89949a7426d64db9f,
title = "Anytime fourier transformation",
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.",
keywords = "Anytime systems, DFT, FFT, Transformed domain signal processing",
author = "A. V{\'a}rkonyi-K{\'o}czy and Graca Ruano",
year = "2005",
language = "English",
isbn = "078039030X",
pages = "266--271",
booktitle = "2005 IEEE International Workshop on Intelligent Signal Processing - Proceedings",

}

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

SN - 078039030X

SN - 9780780390300

SP - 266

EP - 271

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

ER -