返回
Distributed Convex Optimization Compressed Sensing Method for Sparse Planar Array Synthesis in 3-D Imaging Sonar Systems
DOI:10.1109/JOE.2019.2914983.png)
摘要
En 中文
Synthesis of sparse planar arrays can effectively reduce hardware costs and computational complexity in phased array 3-D imaging sonar systems. Traditional stochastic methods, such as simulated annealing, require multiple experiments and parameter adjustments to obtain optimal results. Methods based on compressed sensing (CS) can overcome this defect. However, when applied to large arrays, CS methods require vast computational complexity and may not obtain optimal sparse results because of violating the restricted isometry property. To make CS methods more practical, a distributed convex optimization CS method is proposed here for the sparse planar array synthesis in 3-D imaging sonar systems. This method is based on the CS theory, solving the minimum number of active elements under certain beam pattern constraints using the iterative reweighted l(1)-norm minimization algorithm. Then, a multistage distributed framework is proposed to decompose the array into multistage subarrays, and the array synthesis is performed sequentially for each stage subarray to reduce computational complexity and obtain higher sparsity rates. Some applications of sparse planar array synthesis are employed to evaluate the efficiency of the proposed method.
Keyword:
Planar arrays
Convex functions
Apertures
Computational complexity
Iterative algorithms
Minimization
Transmission line matrix methods
Compressed sensing (CS)
convex optimization
multistage distributed framework
phased array 3-D imaging sonar system
sparse planar array
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.3
论文数:
2.6K
被引数:
7.4K
机构
引用论文
A dimensioning and tolerancing methodology for concurrent engineering applications I: problem representation一种面向并行工程应用的尺寸标注与公差方法学 I:问题表述

