scholarly journals Beam Performance Optimization of Multibeam Imaging Sonar Based on the Hybrid Algorithm of Binary Particle Swarm Optimization and Convex Optimization

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Weijie Xia ◽  
Xue Jin ◽  
Fawang Dou

It should be noted that the peak sidelobe level (PSLL) significantly influences the performance of the multibeam imaging sonar. Although a great amount of work has been done to suppress the PSLL of the array, one can verify that these methods do not provide optimal results when applied to the case of multiple patterns. In order to suppress the PSLL for multibeam imaging sonar array, a hybrid algorithm of binary particle swarm optimization (BPSO) and convex optimization is proposed in this paper. In this algorithm, the PSLL of multiple patterns is taken as the optimization objective. BPSO is considered as a global optimization algorithm to determine best common elements’ positions and convex optimization is considered as a local optimization algorithm to optimize elements’ weights, which guarantees the complete match of the two factors. At last, simulations are carried out to illustrate the effectiveness of the proposed algorithm in this paper. Results show that, for a sparse semicircular array with multiple patterns, the hybrid algorithm can obtain a lower PSLL compared with existing methods and it consumes less calculation time in comparison with other hybrid algorithms.

Author(s):  
Rajendra Bahadur Singh ◽  
Anurag Singh Baghel ◽  
Arun Solanki

Background: In the field of IC physical design, there is a big problem in the IC floorplanning to find the early feedback to estimate the area, wire length, delay, etc. before IC fabrication. Objective: In this paper, minimization of the area and total wire length on the IC has been done using Binary Particle Swarm Optimization with sequence pair representation. Methods: Optimization of the IC floorplan works in two phases. In the first phase, the floorplan is constructed by sequence pair representation without any overlapping of the modules on IC floorplan. In the second phase, Binary Particle Swarm Optimization algorithm explores the packing of all modules in floorplan to find better optimal performances i.e. area and wire length. Results: The results obtained were compared with the solutions derived from other meta-heuristic algorithms, the area is improved maximum up to 10% and the wire length was improved maximum up to 28%. Conclusion: The Experimental results on Microelectronic Center of North Carolina benchmark circuits show that Binary Particle Swarm Optimization algorithm gives better convergence for the area and wire length optimization than other algorithms.


Sign in / Sign up

Export Citation Format

Share Document