Evolving signal processing algorithms by genetic programming
Evolving signal processing algorithms by genetic programming
- Author(s): K.C. Sharman ; A.I.E. Alcazar ; Y. Li
- DOI: 10.1049/cp:19951094
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): K.C. Sharman ; A.I.E. Alcazar ; Y. Li Source: 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA), 1995 p. 473 – 480
- Conference: 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA)
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 optimising 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, nonlinear communications channel.
Inspec keywords: adaptive signal processing; genetic algorithms; simulated annealing
Subjects: Signal processing and detection; Optimisation; Digital signal processing; Optimisation techniques; Communications computing
Related content
content/conferences/10.1049/cp_19951094
pub_keyword,iet_inspecKeyword,pub_concept
6
6