Buffer Memory Optimization in DSP Applications - An Evolutionary Approach

Bhattacharyya SS, Teich J, Zitzler E (1998)

Publication Type: Book chapter / Article in edited volumes

Publication year: 1998

Journal

Lecture Notes in Computer Science Springer Verlag

Publisher: Springer-verlag

Edited Volumes: Parallel Problem Solving from Nature (PPSN'98)

City/Town: Amsterdam, The Netherlands

Pages Range: 292-301

ISBN: 3540650784

Abstract

In the context of digital signal processing, synchronous data flow (SDF) graphs [12] are widely used for specification. For these, so called single appearance schedules provide program memory-optimal uniprocessor implementations. Here, buffer memory minimized schedules are explored among these using an Evolutionary Algorithm (EA). Whereas for a restricted class of graphs, there exist optimal polynomial algorithms, these are not exact and may provide poor results when applied to arbitrary, i.e., randomly generated graphs. We show that a careful EA implementation may outperform these algorithms by sometimes orders of magnitude.

Authors with CRIS profile

Jürgen Teich Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)

Related research project(s)

EVOlutionary Learning by Intelligent Variation and choice of suitable Operator sets (EVOLIVO) Oct. 1, 1998 - March 31, 2005

Involved external institutions

University of Maryland US United States (USA) (US)

How to cite

APA:

Bhattacharyya, S.S., Teich, J., & Zitzler, E. (1998). Buffer Memory Optimization in DSP Applications - An Evolutionary Approach. In Parallel Problem Solving from Nature (PPSN'98). (pp. 292-301). Amsterdam, The Netherlands: Springer-verlag.

MLA:

Bhattacharyya, Shuvra S., Jürgen Teich, and Eckart Zitzler. "Buffer Memory Optimization in DSP Applications - An Evolutionary Approach." Parallel Problem Solving from Nature (PPSN'98). Amsterdam, The Netherlands: Springer-verlag, 1998. 292-301.

BibTeX: Download