Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

小型机载激光通信系统设计与验证

针对空空宽带高速通信的需求，设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能，并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能，其中粗跟踪误差为533.2 μrad(1σ)，精跟踪误差为3.6 μrad(1σ)，测试数据传输240 s，通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。     

Uplink Scheduling in CDMA Packet-Data Systems

Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness of service among users, hence reducing chances of buffer overflows for poorly located users. The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time, and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement. Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users, and the strongly recieved users at the base as “strong” users. Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton, NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management and scheduling issues in telecommunication networks. Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S. from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University, all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering.     

A Bluetooth Based Sensor Network for Civil Infrastructure Health Monitoring

Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology.     

WPAN/WLAN应用环境下基于PER的链路自适应算法

本文重点研究基于包错误率测量的链路自适应算法，分析了包错误率与信道参数的关系，提出了一种有别于固定门限值方案的优化门限值方案。仿真结果表明，优化门限值方案的网络吞吐量要大于固定门限值方案和基于信干比估计的链路自适应算法，最大增幅可达12Mbit/s。在系统引入重传机制后，网络吞吐量将有所损失，但最大不超过1Mbit/s，相比较服务质量的提高是值得的。需指出的是，虽然分析和仿真均以HIPERLAN／2为例，但不失一般性，它们同样适合于WPAN/WLAN等类似系统。     

2Mbit/s高速信令链路在移动通信七号信令网中的应用

通过对2Mbit/s高速信令链路原理、特点的介绍，阐明了该技术在现阶段使用的实际意义，并给出了2Mbit/s高速信令链路在移动通信七号信令网中的应用。     

链环的trip矩阵

ZULLI L首先构造了一个用于计算纽结Kauffman尖括号多项式的模2矩阵,纽结的trip矩阵.为了构造链环的trip矩阵,引入了一个带标识的穿有m个孔的圆盘来取代纽结情形下的圆盘,其中m为链环的分支数.主要结果为:定理若状态S是从状态AA…A经过i1,i2,…,ip位置上的标记替换(A换成B)而得的状态.设Ts是将trip矩阵T的左上角的n×n子块中ai1i1,ai2i2,…,aipip之值进行替换(0→1或1→0)所得的矩阵,则#(L|S)=n+m-秩(Ts).因此计算链环Kauffman尖括号多项式就归结为计算一组模2矩阵的秩.     

内容寻址网络中内容的有效定位

P2P(Peer—to—Peer)的最基本的问题是如何高效地查找到存放文件的节点。本文提出在保持内容寻址网络(Content Addressable Network：CAN)现有特性的基础上建立一种更快捷有效的内容定位结构：基于快捷链接和最小距离的内容定位。本文首先介绍了内容寻址网络的基本工作原理，然后详细描述了基于快捷链接和最小距离进行内容定位的方法，并通过仿真证实了该方法很大程度上改善了CAN的性能。     

Neutral Community Theory: How Stochasticity and Dispersal-Limitation Can Explain Species Coexistence

Neutral community theory explains biodiversity, i.e. the coexistence of several species, as the result of a stochastic balance between immigration and extinction on a local level, and between speciation and extinction on a regional level. The most popular model, presented by Hubbell in 2001, has seen many analytical developments in recent years, which can be used in model analysis, model testing and model comparison. We review these developments here, and present alternative derivations and shine previously unnoticed lights on them.     

基于TS101型DSP链路口的多通道高精度数据采集电路设计

介绍一种基于数字信号处理器(DSP)TS101链路口的多通道高精度数据采集电路的设计方法,详细阐述利用多个ADS8361型A/D转换器进行数据采集,并经TS101链路口传输数据的FP-GA和DSP设计实现,讨论如何提高A/D转换精度的问题.