毫米波三基线InSAR系统误差校正和信号分析

该文研究了毫米波三基线InSAR系统误差校正问题,给出了系统误差校正方案,以实现三通道信号间的幅相一致性。分析了脉冲压缩处理的效果、通道间的干扰影响、系统相位稳定性、慢时间频谱、幅相一致性程度。给出了三基线干涉测角去模糊的方法以及地面测试实验方案。地面实测数据的处理和分析结果,验证了该文方法的有效性,并检验了该毫米波三基线InSAR的系统性能。     

PLC实训项目的组态开发与设计

介绍了利用组态技术实现PLC实训项目的虚拟控制。把该系统应用于实验教学中,它可以对PLC实训项目的运行状态进行虚拟监控,达到更好的实验效果。     

GHz band frequency hopping PLL-based frequency synthesizers

In this paper we describe a full-integrated circuit containing all building blocks of a completed PLL-based synthesizer except for low pass filter（LPF）. The frequency synthesizer is designed for a frequency hopping （FH） transceiver operating up to 1.5 GHz as a local oscillator. The architecture of Voltage Controlled Oscillator （VCO） is optimized to get better performance, and a phase noise of -111.85-dBc/Hz @ 1 MHz and a tuning range of 250 MHz are gained at a centre frequency of 1.35 GHz. A novel Dual-Modulus Prescaler（DMP） is designed to achieve a very low jitter and a lower power. The settling time of PLL is 80 μs while the reference frequency is 400 KHz. This monolithic frequency synthesizer is to integrate all main building blocks of PLL except for the low pass filter, with a maximum VCO output frequency of 1.5 GHz, and is fabricated with a 0.18 μm mixed signal CMOS process. Low power dissipation, low phase noise, large tuning range and fast settling time are gained in this design.     

变频器在数控机床中的应用探讨

本文主要讲述了三菱变频器在数控机床中的应用，三菱变频器因其性能优越被广泛地应用在现代工业领域中，特别是它的矢量控制、直接转矩控制等，为数控机床的控制提供了传动的最佳解决方案，从而提高了数控机床的整机性能。     

电子产品环境与可靠性试验应力研究

本文从有关标准入手,论述了环境试验与可靠性试验的基本概念及相互关系,重点介绍了环境试验和可靠性试验在应力施加上的异同点,指出了进行这两项试验的重要性。     

天基跟踪层星座性能建模与仿真

随着高超声速武器技术的快速发展和实战化部署,美国有针对性地提出了建设国防太空架构跟踪层计划的设想。首先,介绍了跟踪层卫星主要设计性能参数;其次,建立了跟踪层星座覆盖性能分析模型、探测能力分析模型和跟踪性能分析模型;最后,通过仿真计算对跟踪层系统性能进行了分析,并推断了系统全星座最小卫星数量、探测灵敏度和全球目标最优跟踪精度等核心能力。分析结果对相关系统信息处理算法研究、载荷与星座方案设计具有重要参考价值。     

基于偏振的光矩阵开关

提出了一种新型的基于偏振的光矩阵开关方法 ,通过控制光的偏振态实现严格无阻塞连接。以 4× 4光矩阵开关为例 ,详细给出了其节点开关和交换网络的实现方案。并对该 4× 4光矩阵开关进行实测 ,证明该方法制作的小规模光矩阵开关具有插损低 ,串话小 ,开关时间中等 ,性能稳定 ,工艺成熟等特点。     

火箭拖拽布撒网系统建模与动力学分析

布撒网系统利用火箭拖拽将网体布设至目标区域、完成雷区清障任务,研究其展开动力学过程,对系统设计有着重要的理论指导意义。基于刚体动力学及多体系统动力学中的集中质量方法,分别建立了火箭及柔性布撒网块的三维动力学模型,给出了系统动力学方程。利用4阶 Runge-Kutta法解算系统动力学方程,通过数值模拟计算分析了布撒网飞行布设准确性的影响参数。通过集中质量模型与多刚体模型对比,分析二者仿真结果中的火箭弹道、质心速度和俯仰角等关键动力学参数,研究了火箭拖拽布撒网系统的基本飞行动力学特性,得出集中质量模型的准确性更高。根据工程实际研制出火箭拖拽布撒网系统的试验样机,并完成了样机的场地飞行试验。结果表明：数值计算与试验结果吻合良好,系统布设到位率达到90%以上。     

Achieving fast and bandwidth-efficient shared-path protection

Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we propose novel integer linear programming (ILP) formulations by introducing two parameters (/spl epsi/ and /spl mu/) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible.     

On the complexity of and algorithms for finding the shortest path with a disjoint counterpart

Finding a disjoint path pair is an important component in survivable networks. Since the traffic is carried on the active (working) path most of the time, it is useful to find a disjoint path pair such that the length of the shorter path (to be used as the active path) is minimized. In this paper, we first address such a Min-Min problem. We prove that this problem is NP-complete in either single link cost (e.g., dedicated backup bandwidth) or dual link cost (e.g., shared backup bandwidth) networks. In addition, it is NP-hard to obtain a K-approximation to the optimal solution for any K>1. Our proof is extended to another open question regarding the computational complexity of a restricted version of the Min-Sum problem in an undirected network with ordered dual cost links (called the MSOD problem). To solve the Min-Min problem efficiently, we introduce a novel concept called conflicting link set which provides insights into the so-called trap problem, and develop a divide-and-conquer strategy. The result is an effective heuristic for the Min-Min problem called COnflicting Link Exclusion (COLE), which can outperform other approaches in terms of both the optimality and running time. We also apply COLE to the MSOD problem to efficiently provide shared path protection and conduct comprehensive performance evaluation as well as comparison of various schemes for shared path protection. We show that COLE not only processes connection requests much faster than existing integer linear programming (ILP)-based approaches but also achieves a good balance among the active path length, bandwidth efficiency, and recovery time.