Evolving signal processing algorithms by genetic programming

Ken C. Sharman, Anna I.Esparcia Alcazar, Y. Li

Research output: Contribution to journalConference article

28 Citations (Scopus)

Abstract

We introduce a novel genetic programming (GP) technique to evolve both the structure and parameters of adaptive digital signal processing algorithms. This is accomplished by defining a set of node functions and terminals to implement the basic operations commonly used in a large class of DSP algorithms. In addition, we show how simulated annealing may be employed to assist the GP in optimizing the numerical parameters of expression trees. The concepts are illustrated by using GP to evolve high performance algorithms for detecting binary data sequences at the output of a noisy, non-linear communications channel.

Original languageEnglish
Pages (from-to)473-480
Number of pages8
JournalIEE Conference Publication
Issue number414
Publication statusPublished - 1 Jan 1995
EventProceedings of the 1st IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications GALESIA '95 - Sheffield, Engl
Duration: 12 Sep 199514 Sep 1995

Fingerprint

Genetic programming
Signal processing
Simulated annealing
Digital signal processing

Keywords

  • genetic algorithms
  • digital signal processing
  • learning algorithms
  • communication channels (information theory)
  • mathematical operators
  • binary sequences

Cite this

Sharman, K. C., Alcazar, A. I. E., & Li, Y. (1995). Evolving signal processing algorithms by genetic programming. IEE Conference Publication, (414), 473-480.
Sharman, Ken C. ; Alcazar, Anna I.Esparcia ; Li, Y. / Evolving signal processing algorithms by genetic programming. In: IEE Conference Publication. 1995 ; No. 414. pp. 473-480.
@article{b63889a9fe4e447da686d41c1c5809eb,
title = "Evolving signal processing algorithms by genetic programming",
abstract = "We introduce a novel genetic programming (GP) technique to evolve both the structure and parameters of adaptive digital signal processing algorithms. This is accomplished by defining a set of node functions and terminals to implement the basic operations commonly used in a large class of DSP algorithms. In addition, we show how simulated annealing may be employed to assist the GP in optimizing the numerical parameters of expression trees. The concepts are illustrated by using GP to evolve high performance algorithms for detecting binary data sequences at the output of a noisy, non-linear communications channel.",
keywords = "genetic algorithms, digital signal processing, learning algorithms, communication channels (information theory), mathematical operators, binary sequences",
author = "Sharman, {Ken C.} and Alcazar, {Anna I.Esparcia} and Y. Li",
year = "1995",
month = "1",
day = "1",
language = "English",
pages = "473--480",
journal = "The IEE International Workshop on Intelligent Environments",
issn = "0537-9989",
publisher = "Institution of Engineering and Technology",
number = "414",

}

Sharman, KC, Alcazar, AIE & Li, Y 1995, 'Evolving signal processing algorithms by genetic programming', IEE Conference Publication, no. 414, pp. 473-480.

Evolving signal processing algorithms by genetic programming. / Sharman, Ken C.; Alcazar, Anna I.Esparcia; Li, Y.

In: IEE Conference Publication, No. 414, 01.01.1995, p. 473-480.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Evolving signal processing algorithms by genetic programming

AU - Sharman, Ken C.

AU - Alcazar, Anna I.Esparcia

AU - Li, Y.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We introduce a novel genetic programming (GP) technique to evolve both the structure and parameters of adaptive digital signal processing algorithms. This is accomplished by defining a set of node functions and terminals to implement the basic operations commonly used in a large class of DSP algorithms. In addition, we show how simulated annealing may be employed to assist the GP in optimizing the numerical parameters of expression trees. The concepts are illustrated by using GP to evolve high performance algorithms for detecting binary data sequences at the output of a noisy, non-linear communications channel.

AB - We introduce a novel genetic programming (GP) technique to evolve both the structure and parameters of adaptive digital signal processing algorithms. This is accomplished by defining a set of node functions and terminals to implement the basic operations commonly used in a large class of DSP algorithms. In addition, we show how simulated annealing may be employed to assist the GP in optimizing the numerical parameters of expression trees. The concepts are illustrated by using GP to evolve high performance algorithms for detecting binary data sequences at the output of a noisy, non-linear communications channel.

KW - genetic algorithms

KW - digital signal processing

KW - learning algorithms

KW - communication channels (information theory)

KW - mathematical operators

KW - binary sequences

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

M3 - Conference article

AN - SCOPUS:0029181058

SP - 473

EP - 480

JO - The IEE International Workshop on Intelligent Environments

JF - The IEE International Workshop on Intelligent Environments

SN - 0537-9989

IS - 414

ER -

Sharman KC, Alcazar AIE, Li Y. Evolving signal processing algorithms by genetic programming. IEE Conference Publication. 1995 Jan 1;(414):473-480.