{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T10:34:12Z","timestamp":1723026852081},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transcom.2016ebp3203","type":"journal-article","created":{"date-parts":[[2016,10,5]],"date-time":"2016-10-05T22:04:18Z","timestamp":1475705058000},"page":"426-432","source":"Crossref","is-referenced-by-count":7,"title":["Pattern Synthesis of Sparse Linear Arrays Using Spider Monkey Optimization"],"prefix":"10.23919","volume":"E100.B","author":[{"given":"Huaning","family":"WU","sequence":"first","affiliation":[{"name":"College of Electronic Engineering, University of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yalong","family":"YAN","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, University of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"LIU","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, University of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, University of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] V. Murino, A. Trucco, and C.S. Regazzoni, \u201cSynthesis of unequally spaced arrays by simulated annealing,\u201d IEEE Trans. Signal Process., vol.44, no.1, pp.119-122, 1996. DOI: 10.1109\/78.482017","DOI":"10.1109\/78.482017"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] K. Chen, Z. He, and C. Han, \u201cA modified real GA for the sparse linear array synthesis with multiple constraints,\u201d IEEE Trans. Antennas Propag., vol.54, no.7, pp.2169-2173, 2006. DOI: 10.1109\/TAP.2006.877211","DOI":"10.1109\/TAP.2006.877211"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] K. Chen, X. Yun, Z. He, and C. Han, \u201cSynthesis of sparse planar arrays using modified real genetic algorithm,\u201d IEEE Trans. Antennas Propag., vol.55, no.4, pp.1067-1073, 2007. DOI: 10.1109\/TAP.2007.893375","DOI":"10.1109\/TAP.2007.893375"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] M.M. Khodier and C.G. Christodoulou, \u201cLinear array geometry synthesis with minimum sidelobe level and null control using particle swarm optimization,\u201d IEEE Trans. Antennas Propag., vol.53, no.8, pp.2674-2679, 2005. DOI: 10.1109\/TAP.2005.851762","DOI":"10.1109\/TAP.2005.851762"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S. Karimkashi and A.A. Kishk, \u201cInvasive weed optimization and its features in electromagnetics,\u201d IEEE Trans. Antennas Propag., vol.58, no.4, pp.1269-1278, 2010. DOI: 10.1109\/TAP.2010.2041163","DOI":"10.1109\/TAP.2010.2041163"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Y. Liu, Z. Nie, and Q.H. Liu, \u201cReducing the number of elements in a linear antenna array by the matrix pencil method,\u201d IEEE Trans. Antennas Propag., vol.56, no.9, pp.2955-2962, 2008. DOI: 10.1109\/TAP.2008.928801","DOI":"10.1109\/TAP.2008.928801"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Y. Liu, Q.H. Liu, and Z. Nie, \u201cReducing the number of elements in the synthesis of shaped-beam patterns by the forward-backward matrix pencil method,\u201d IEEE Trans. Antennas Propag., vol.58, no.2, pp.604-608, 2010. DOI: 10.1109\/TAP.2009.2037709","DOI":"10.1109\/TAP.2009.2037709"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] G. Oliveri and A. Massa, \u201cBayesian compressive sampling for pattern synthesis with maximally sparse non-uniform linear arrays,\u201d IEEE Trans. Antennas Propag., vol.59, no.2, pp.467-481, 2011. DOI: 10.1109\/TAP.2010.2096400","DOI":"10.1109\/TAP.2010.2096400"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] D. Caratelli and M.C. Vigano, \u201cA novel deterministic synthesis technique for constrained sparse array design problems,\u201d IEEE Trans. Antennas Propag., vol.59, no.11, pp.4085-4093, 2011. DOI: 10.1109\/TAP.2011.2164193","DOI":"10.1109\/TAP.2011.2164193"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L.F. Yepes, D.H. Covarrubias, M.A. Alonso, and R. Ferrus, \u201cHybrid sparse linear array synthesis applied to phased antenna arrays,\u201d IEEE Trans. Antennas Propag. Lett., vol.13, pp.185-188, 2014. DOI: 10.1109\/LAWP.2014.2301012","DOI":"10.1109\/LAWP.2014.2301012"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Q. Yang, X. Zhao, and Y. Zhang, \u201cCompressed sensing approach for pattern synthesis of maximally sparse non-uniform linear array,\u201d IET Microwaves, Antennas & Propagation, vol.8, no.5, pp.301-307, 2014. DOI: 10.1049\/iet-map.2013.0492","DOI":"10.1049\/iet-map.2013.0492"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] S.H. Yang and J.F. Kiang, \u201cOptimization of sparse linear arrays using harmony search algorithms,\u201d IEEE Trans. Antennas Propag., vol.63, no.11, pp.4732-4738, 2015. DOI: 10.1109\/TAP.2015.2476518","DOI":"10.1109\/TAP.2015.2476518"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J.C. Bansal, H. Sharma, S.S. Jadon, and M. Clerc, \u201cSpider monkey optimization algorithm for numerical optimization,\u201d Memetic Comp., vol.6, no.1, pp.31-47, 2014. DOI: 10.1109\/RAECS.2015.7453377","DOI":"10.1109\/RAECS.2015.7453377"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E100.B\/3\/E100.B_2016EBP3203\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:00:25Z","timestamp":1704898825000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E100.B\/3\/E100.B_2016EBP3203\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2016ebp3203","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}