Handover and Uplink Power Control Performance in the 3.84 Mcps TDD mode of UTRA Network

In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out.     

半导体传感器在生物分析科学中的应用(英文)

回顾了半导体生化传感器 (ISFET 和 LA PS)在医学监测、免疫检测、免疫分析、D N A 杂交以及细胞培养等方面应用的进展。为使半导体器件适用于生化检测,对其中所采用的检测手段和取得的研究结果进行了分析。展望了通过与微流体网络相结合,基于半导体传感器的实验室芯片化的可行性。     

基于MFSK的多载波水声通信系统及实验研究

本文在深入研究水声通信信道特性及多载波关键技术的基础上,设计并研制了基于M FSK的高速自适应多载波水声通信系统,并进行了湖上实验。理论分析、仿真及湖上试验结果表明:基于M FSK的多载波水声通信系统,多径抑制有效,对同步的精确度要求不高,性能稳健,更适合于恶劣水声通信环境下、中距离(10~30km)较高数据率多载波通信系统,易于工程实现,具有良好的应用前景。     

移动通信系统中功率控制研究

在阐述功率控制在移动通信系统中的发展过程的基础上，着重研究了WCDMA系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

基于两层均匀媒质的GPEN SAR地下目标成像方法及其性能分析

地表穿透合成孔径雷达(Ground PENetration SAR,GPEN SAR)为了探测掩埋在地下的目标,通常工作在多层媒质的环境中。传统成像模型是建立在同一均匀媒质的假设上,不再适合于GPEN SAR的实际情况。本文首先建立了两层分区均匀媒质中的成像模型,然后利用后向投影(BP)算法定量分析了成像几何参数、土壤参数等对成像的影响,进而提出了一种修正的后向投影(MBP)算法。MBP算法不仅能够校正两层分区均匀媒质对成像定位的影响,还能估计目标的掩埋深度,提供目标三维位置坐标。仿真结果验证了MBP算法在不同信噪比环境下,对多目标的三维定位精度能满足实际的需要。     

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.     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

质量控制图系统的实现及在SMT中的应用

本文将控制图理论与计算机技术相结合,开发了质量控制图系统.介绍了该系统的设计方案和关键技术问题,并以电子产品制造中监控SMT机的焊膏厚度为例说明了系统的应用.     

2.4GHz动态CMOS分频器的设计

对现阶段的主流高速CMOS分频器进行分析和比较,在此基础上设计一种采用TSPC(truesingle phase clock)和E-TSPC(extended TSPC)技术的前置双模分频器电路.该分频器大大提高了工作频率,采用0.6μm CMOS工艺参数进行仿真的结果表明,在5V电源电压下,最高频率达到3GHz,功耗仅为8mW.