It is known that numerical performance of a discrete filter is strictly dependant to the state space realization adopted. In particular realization matrix plays an important role into determination of a good representation when a finite length arithmetic is used. The optimal representation problem has not in general a solution in closed-form and numerical optimization algorithms must be adopted. Genetic Algorithms, a new class of optimization procedure that simulate natural adaptation, have shown to be a valid alternative respect to a classical approach. This procedure allows to find near-optimal solution by avoiding to deep in local minima.
Search of optimal realization matrix for filter implementation by using a genetic algorithm
Muscato G.;Nunnari G.
1993-01-01
Abstract
It is known that numerical performance of a discrete filter is strictly dependant to the state space realization adopted. In particular realization matrix plays an important role into determination of a good representation when a finite length arithmetic is used. The optimal representation problem has not in general a solution in closed-form and numerical optimization algorithms must be adopted. Genetic Algorithms, a new class of optimization procedure that simulate natural adaptation, have shown to be a valid alternative respect to a classical approach. This procedure allows to find near-optimal solution by avoiding to deep in local minima.| File | Dimensione | Formato | |
|---|---|---|---|
|
Search_of_optimal_realization_matrix_for_filter_implementation_by_using_a_genetic_algorithm.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
300.54 kB
Formato
Adobe PDF
|
300.54 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


