dc.contributor.author |
Guney, Kerim |
|
dc.contributor.author |
Başbuğ, Suad |
|
dc.date.accessioned |
2022-07-18T07:53:25Z |
|
dc.date.available |
2022-07-18T07:53:25Z |
|
dc.date.issued |
2011 |
|
dc.identifier.uri |
http://hdl.handle.net/20.500.11787/7440 |
|
dc.description.abstract |
A method based on the bacterial foraging algorithm (BFA) for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling only the element positions. The BFA is a new evolutionary computing technique, based on the foraging behavior of Escherichia (E) coli bacteria in a human intestine. Simulation results for Chebyshev patterns with the imposed single, multiple and broad nulls are given to show the effectiveness of the proposed method. For practical consideration, due to small variations of the element positions, the sensitivity of the produced patterns is also examined by rounding the element position values to the second decimal position. |
tr_TR |
dc.language.iso |
eng |
tr_TR |
dc.rights |
info:eu-repo/semantics/closedAccess |
tr_TR |
dc.title |
Bacterial foraging algorithm for null synthesizing of linear antenna arrays by controlling only the element positions |
tr_TR |
dc.type |
article |
tr_TR |
dc.relation.journal |
Journal of optimization theory and applications |
tr_TR |
dc.contributor.department |
Nevşehir Hacı Bektaş Veli Üniversitesi/mühendislik-mimarlık fakültesi/elektrik-elektronik mühendisliği bölümü/telekomünikasyon anabilim dalı |
tr_TR |
dc.contributor.authorID |
18263 |
tr_TR |
dc.identifier.volume |
150 |
tr_TR |
dc.identifier.issue |
3 |
tr_TR |
dc.identifier.startpage |
635 |
tr_TR |
dc.identifier.endpage |
656 |
tr_TR |