Off‐grid DoA estimation method of wideband signals

In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.     

干扰条件下的“北斗”信号解扩重构DOA估计

在干扰条件下，卫星导航抗干扰波束形成算法往往需要卫星信号波达方向（Direction-of-Arrival，DOA）的先验信息。但当存在低信噪比信号或主动干扰源时，常规的DOA估计算法性能急剧下降甚至失效。针对此问题，提出了一种被干扰信号压制的低信噪比“北斗”信号的DOA估计算法。该算法首先通过对接收信号进行子空间投影抑制干扰信号，然后对抑制干扰后的信号进行解扩重构处理，最后通过多重信号分类算法完成对“北斗”信号的DOA估计。仿真结果表明，在干扰信号干信比80 dB条件下，“北斗”信号DOA估计误差在5°以内，为下一步进行波束形成计算提供了高精度的入射角信息。     

基于三相幅度测量的相控阵天线快速校准方法

提出了一种基于三相幅度测量的相控阵天线快速校准方法。该方法将天线阵列进行分组,利用每种分组在三种配相下的阵面合成场幅度测量值,可解算出各个天线单元的初始幅相值。该方法仅需幅度测量,避免了相位测量误差影响单元幅相值的计算精度,而且所需幅度测量次数仅为(2N+1)次,可显著提高校准时效性。另外,利用分组思想,同时改变多个单元相位,使总辐射场的幅度变化显著,提升校准准确性。仿真结果表明:校准后相位均方根误差为2.2°,幅度均方根误差为0.2 dB。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

传感器管理及其在相控阵雷达中的应用

传感器管理是数据融合的一部分。介绍了传感器管理的概念和框架 ,概述了国内外传感器管理算法的研究现状。主要工作是针对相控阵雷达这一传感器 ,通过对其不同工作模式以及不同参数的管理 ,来说明传感器管理的原理。提出了一种新的自适应采样周期算法 ,仿真结果表明该算法的优越性     

生存能力技术及其实现案例研究

生存能力技术谋求增强系统在面临攻击、失效等灾难情况下仍能继续提供服务的能力。本文提出了以多样化分布式动态备份技术和主动漂移机制为手段，以被保护目标的机动性和隐蔽性为目的的生存能力技术模型。提出了多样化体系理论及其实现案例，基于该理论设计并实现了自适应TOM方法。最后通过模拟和测试探讨了生存能力的评价方法，并验证了本文的结果。     

分布式无线传感器网络通信协议研究

在归纳分布式无线传感器网络研究进展的基础上，给出了综合分布式无线传感器网络技术各个方面的协议体系结构，并在新的体系结构下，系统地阐述了分布式无线传感器网络通信协议研究的进展，介绍了典型的应用案例和国外相关计划的研究情况。最后，指明了这一处于发展初期的研究领域的未来发展方向。     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

分布式光纤拉曼放大器的增益平坦设计

介绍了在波分复用（WDM）系统中分布式光纤拉曼放大器（FRA）的理论分析模型。在此基础上，对增益平坦设计所需考虑的因素进行了分析；最后通过试验证明了它的有效性。     

异步DS-CDMA系统中基于矩阵点除算法的DOA估计

针对异步DS-CDMA系统中的多用户环境,本文提出了一种低复杂度的DOA估计算法——矩阵点除算法。该算法通过对感兴趣信息的逐次分离,实现了DOA的逐路径估计。算法具有两方面显著优势:(1)克服了传统的DOA估计算法在路径总数大于天线阵元数时不能工作这一缺陷:(2)避免了计算复杂的特征值分解运算,大大降低了算法复杂度。仿真实验验证了算法的有效性。