Suscripción a Biblioteca: Guest
Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones
Telecommunications and Radio Engineering
SJR: 0.202 SNIP: 0.2 CiteScore™: 0.23

ISSN Imprimir: 0040-2508
ISSN En Línea: 1943-6009

Volumes:
Volumen 78, 2019 Volumen 77, 2018 Volumen 76, 2017 Volumen 75, 2016 Volumen 74, 2015 Volumen 73, 2014 Volumen 72, 2013 Volumen 71, 2012 Volumen 70, 2011 Volumen 69, 2010 Volumen 68, 2009 Volumen 67, 2008 Volumen 66, 2007 Volumen 65, 2006 Volumen 64, 2005 Volumen 63, 2005 Volumen 62, 2004 Volumen 61, 2004 Volumen 60, 2003 Volumen 59, 2003 Volumen 58, 2002 Volumen 57, 2002 Volumen 56, 2001 Volumen 55, 2001 Volumen 54, 2000 Volumen 53, 1999 Volumen 52, 1998 Volumen 51, 1997

Telecommunications and Radio Engineering

DOI: 10.1615/TelecomRadEng.v76.i17.20
pages 1503-1507

OPTIMAL DESIGN OF SPARSE ARRAYS BASED ON MODIFIED QUANTUM GENETIC ALGORITHM

W. Hu
Wenzhou Vocational and Technical College, Chashan higher Education Park, Wenzhou 325035, Prov. Zhejiang, P.R. of China
V. I. Lutsenko
O.Ya. Usikov Institute for Radio Physics and Electronics, National Academy of Sciences of Ukraine, 12 Academician Proskura St., Kharkiv 61085, Ukraine
Q. Guo
Harbin Engineering University, Rd. Nantong 145, Harbin 150001, Prov. Heilongjiang, P.R. of China
Y. Zheng
Qingdao University, Rd. Ningxia 308, Qingdao 266071, Prov. Shandong, P.R. of China
Y. Wang
College of Information and Communication Engineering, Harbin Engineering University, 145 Rd. Nantong, Harbin, Prov. Heilongjiang, P.R. of China

SINOPSIS

In order to reduce the peak sidelobe level (PSLL) of the linear array pattern, algorithm of linear array pattern optimization method is proposed based on margin space coding and quantum genetic algorithm (MS_QGA). Using the quantum genetic algorithm to optimize the position margin of array elements in the case that constrain the array aperture, the number of array elements and the minimum array elements space of the uniform linear array, and the optimization goal is to reduce the PSLL. The convergence speed of the proposed method is accelerated, the local search ability and the diversity of the population are improved to solve the premature convergence problem, the complexity of the method and the computation are reduced, the performance of PSLL of the sparse linear arrays is improved, and the array element is better distributed in the array aperture.