You are currently logged in as an
Institutional Subscriber.
If you would like to logout,
please click on the button below.
Home / Publications / E-library page
Only AES members and Institutional Journal Subscribers can download
A new algorithm, the tree evolution algorithm (TEA), is proposed for parameter optimization separately in a complex solution space, with its search algorithm forming a tree structure. It is shown that the algorithm, which is based on the genetic annealing algorithm (GAA), is more accurate and more stable than GAA in estimating the optimum parameters for double frequency modulation (DFM) synthesis.
Author (s): Tan, B. T. G.; Liu, N.
Affiliation:
Department of Physics, National University of Singapore, Singapore, Republic of Singapore
(See document for exact affiliation information.)
Publication Date:
2003-06-06
Import into BibTeX
Permalink: https://aes2.org/publications/elibrary-page/?id=12219
(132KB)
Click to purchase paper as a non-member or login as an AES member. If your company or school subscribes to the E-Library then switch to the institutional version. If you are not an AES member Join the AES. If you need to check your member status, login to the Member Portal.
Tan, B. T. G.; Liu, N.; 2003; Automated Parameter Optimization for Double Frequency Modulation Synthesis Using a Tree Evolution Algorithm [PDF]; Department of Physics, National University of Singapore, Singapore, Republic of Singapore; Paper ; Available from: https://aes2.org/publications/elibrary-page/?id=12219
Tan, B. T. G.; Liu, N.; Automated Parameter Optimization for Double Frequency Modulation Synthesis Using a Tree Evolution Algorithm [PDF]; Department of Physics, National University of Singapore, Singapore, Republic of Singapore; Paper ; 2003 Available: https://aes2.org/publications/elibrary-page/?id=12219
@article{tan2003automated,
author={tan b. t. g. and liu n.},
journal={journal of the audio engineering society},
title={automated parameter optimization for double frequency modulation synthesis using a tree evolution algorithm},
year={2003},
volume={51},
issue={6},
pages={534-546},
month={june},}