Veuillez utiliser cette adresse pour citer ce document :
http://dspace1.univ-tlemcen.dz/handle/112/1100
Affichage complet
Élément Dublin Core | Valeur | Langue |
---|---|---|
dc.contributor.author | Bousahla, M | - |
dc.contributor.author | Abri, M | - |
dc.contributor.author | Bendimerad, FT | - |
dc.contributor.author | Boukli Hacene, N | - |
dc.date.accessioned | 2012-06-19T10:10:25Z | - |
dc.date.available | 2012-06-19T10:10:25Z | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 0974-2166 | - |
dc.identifier.uri | http://dspace.univ-tlemcen.dz/handle/112/1100 | - |
dc.description | International Journal of Electronics and Communication Engineering. | - |
dc.description.abstract | This paper presents an analysis and a synthesis of circular arrays of printed antennas. The simulated annealing technique which is a probabilistic methodology to solve combinatorial optimization problems, has been applied to optimize the amplitude of weights coefficients of the elements of the circular array in order to improve the antenna performances and to obtain a beam pattern that meet given requirements. It is seen that the optimization method is effective in designing such arrays. The power of the simulated annealing method lies in its ability to avoid the local minima and to converge to the global minimum of the cost function, thanks to the exploitation of simulated annealing potentialities and high flexibility. | en_US |
dc.language.iso | en | en_US |
dc.publisher | University of Tlemcen | en_US |
dc.subject | Printed antennas | en_US |
dc.subject | circular arrays | en_US |
dc.subject | analysis | en_US |
dc.subject | synthesis | en_US |
dc.subject | simulated annealing | en_US |
dc.title | Synthesis of Circular Arrays with Simulated Annealing Optimization Algorithm | en_US |
dc.type | Article | en_US |
Collection(s) : | Articles internationaux |
Fichier(s) constituant ce document :
Fichier | Description | Taille | Format | |
---|---|---|---|---|
Synthesis-of-Circular-Arrays-with-Simulated-Annealing-Optimization-Algorithm.pdf | 90,56 kB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.