Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Near-Field Source Localization Using Music With Polynomial Rooting, Hsien-Sen Hung, Shun-Hsyung Chang, Chien-Hsing Wu
Near-Field Source Localization Using Music With Polynomial Rooting, Hsien-Sen Hung, Shun-Hsyung Chang, Chien-Hsing Wu
Journal of Marine Science and Technology
In this paper, the bearing, elevation, and range estimation of near-field narrow-band sources from data observed across an array of sensors is considered. For high-resolution source localization, the multiple signal classification (MUSIC) algorithm is modified and extended to its 3-D version by accounting for spherical curvature and spreading factor in the array manifold. However, the simultaneous estimation of bearing, elevation, and range from 3-D MUSIC spectrum requires exhaustive multidimensional search. As to alleviate computational load, an alternative algorithm is proposed. The proposed algorithm involves search in the range domain combined with polynomial rooting, which replaces the search in the azimuth-elevation …
A Unified Approach For The Robust Spr Property Of A Parametric Uncertainty System, Chih-Yung Cheng, Chao-Fong Chang
A Unified Approach For The Robust Spr Property Of A Parametric Uncertainty System, Chih-Yung Cheng, Chao-Fong Chang
Journal of Marine Science and Technology
In this paper, we adopt a unified approach based on the concept of value set to analyze the robust strict positive real (SPR) property of uncertain systems with interval, affine linear or multilinear uncertainty structures.
Routing And Broadcasting Algorithms For The Root-Folded Petersen Etworks, Ming-Bo Lin, Grene-Eu Jan
Routing And Broadcasting Algorithms For The Root-Folded Petersen Etworks, Ming-Bo Lin, Grene-Eu Jan
Journal of Marine Science and Technology
Petersen networks have been proposed as the alternatives for interconnecting highly parallel computers. The main advantages of Petersen networks are: regular topology, high scalability, and smaller diameters. In this paper, we propose a new node naming scheme for Petersen networks. Based on this scheme, two Petersen graph related networks, called root-folded Petersen network in type-I and type-II, are constructed. Furthermore, both O(1ogio N) routing and broadcasting algorithms for the proposed networks are developed, where N is the number of nodes.