The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe th...The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe the distribution of the square root of the nodes on T3 tree.展开更多
提出了一种应用于移动自主网中节点定位的波达方向(Direction of Arrival,DOA)估计新方法,以满足移动自主网对节点定位机制的高精度和低复杂度的要求。利用牛顿法将延迟相加法和求根多重信号分类算法(Root-MUSIC)进行联合估计,定位过程...提出了一种应用于移动自主网中节点定位的波达方向(Direction of Arrival,DOA)估计新方法,以满足移动自主网对节点定位机制的高精度和低复杂度的要求。利用牛顿法将延迟相加法和求根多重信号分类算法(Root-MUSIC)进行联合估计,定位过程分为2个阶段:采用延迟相加法进行实时粗略DOA估计;采用Root-MUSIC进行精准定位。将该方法实现于软件无线电(SDR)系统,综合了延迟相加法低复杂度和Root-MUSIC高估计精度的优点。Matlab仿真实验结果证明了该方法以较低的复杂度获得近似于单独采用Root-MUSIC所达到的高精度,解决了现有方法难以同时达到高精度和低复杂度的问题。展开更多
文摘The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe the distribution of the square root of the nodes on T3 tree.
文摘提出了一种应用于移动自主网中节点定位的波达方向(Direction of Arrival,DOA)估计新方法,以满足移动自主网对节点定位机制的高精度和低复杂度的要求。利用牛顿法将延迟相加法和求根多重信号分类算法(Root-MUSIC)进行联合估计,定位过程分为2个阶段:采用延迟相加法进行实时粗略DOA估计;采用Root-MUSIC进行精准定位。将该方法实现于软件无线电(SDR)系统,综合了延迟相加法低复杂度和Root-MUSIC高估计精度的优点。Matlab仿真实验结果证明了该方法以较低的复杂度获得近似于单独采用Root-MUSIC所达到的高精度,解决了现有方法难以同时达到高精度和低复杂度的问题。
