宽带智能天线系统中的频率补偿技术

在无线通信中,智能天线系统在抑制窄带多径干扰方面具有得天独厚的优势,但是用于宽带无线通信系统中时,就需要采用频率补偿方法.重点介绍基于频谱分解、聚焦和插值算法的补偿技术,并对这3种频率补偿技术的性能进行比较,结果表明在应用补偿技术的系统中,系统性能有显著的改善,其中插值算法具有最优的性能.     

A routing framework for providing robustness to node failures in mobile ad hoc networks

Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes.     

一种基于MPEG-2的立体视频编码中的视差匹配快速算法

高效，快速的视差匹配是立体视频处理中的一项关键技术。本文在分析立体图像序列的视差矢量与运动矢量之间的相关性的基础上，提出一种基于MPEG-2的立体视频编码中的视差匹配快速算法。实验结果表明，与全搜索法相比，在保证重建图像质量的前提下，快速算法能显著降低视差估计的计算复杂度。     

准连续波体制雷达最大熵方法的算法选择

准连续体制作为一种新型雷达体制以其固有的优越性给雷达界带来了巨大的冲击。其数字信号处理系统的开发是进一步完善该体制雷达的关键。本文针对数字信号处理系统中最大熵谱外推电路的算法选择进行了研究。     

搜索三个目标

本文通过建立简洁而有效的搜索方法 ,证明了对于无穷多个n来说 ,三个目标的最优搜索问题的最小试验次数等于信息论下界 .同时也研究了上述问题的修正情形 ,证明了对于所有整数n来说 ,对应的最小试验次数或者等于信息论下界或者超过信息论下界 1次并且对于无穷多个区间 ,信息论下界均是可以达到的 .     

On a new stochastic global optimization algorithm based on censored observations

In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented.     

On the performance of peeling algorithms

The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n^˙ Log (n)) execution time, may give an O(n^˙n^˙ Log (n)) to peel all the set; an O(n^˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n^˙n) performance.     

异步编码CDMA系统中基于因子图的迭代多用户接收器

针对异步编码CDMA系统，本文提出了一种基于因子图的迭代多用户接收器，它是将用户信息比特对接收端噪声白化滤波器输出的条件后验概率分布用因子图表示，并采用和-积算法，经过有限次迭代获得用户信息比特的估计值．为降低计算复杂度，本文还提出一种简化算法．仿真结果表明，本文提出的迭代多用户接收器在经过几次迭代后的比特误码性能接近单用户系统；同时，简化算法的性能接近完全算法，但算法复杂度有明显改善．     

Winograd矩阵乘法算法用于任意阶矩阵时的一种新处理方法

摘要t矩阵乘法StraSsen算法及其变形winograd算法用分而治之的方法把矩阵乘法时间复杂性由传统的D(n。)改进到0(佗kg。n.但是对于奇数阶矩阵,在划分子矩阵时,要作特殊处理才能继续使用此算法.本文提出了一种非等阶“十”字架划分方法,可以最少化填零,最大化性能,使得奇数阶矩阵乘法的时间复杂性更加接近偶数阶矩阵乘法的效果.计算实例显示该方法是有效的.     

A new algorithm for fixed design regression and denoising

In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise (standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising and of compression.