基于维纳滤波的同轴电缆脉冲信号传输畸变补偿研究

由于同轴电缆的低通传输特性,脉冲信号在同轴电缆中传输时不可避免地会出现畸变,并且畸变程度会随着脉冲信号频率、带宽以及传输距离的增加而增大。创新性地将图像处理领域中的一种图像复原方法——维纳滤波法应用于脉冲信号同轴电缆传输畸变补偿,仅利用同轴电缆的S参数和输出信号即可完成输入信号的重构。并以10 m同轴电缆为对象,采用该方法分别对双指数脉冲信号、高斯调制脉冲信号、调制方波信号进行传输畸变补偿。结果表明：对于不同样式的信号,该方法均具有优异的补偿性能;并且,与工程上常用的衰减补偿法相比,该方法不仅补偿精度高,还具有高的计算效率,在同轴电缆脉冲信号传输畸变补偿中具有很好的实用价值。     

On timing Jitter in wavelength-division multiplexed soliton systems

Collision-induced timing shifts in a wavelength-division multiplexed soliton system are computed when damping, amplification, filtering and positive dispersion management following the loss profile are included. A statistical analysis is presented which takes into account the resulting effect of the large number of collisions occurring in the fiber. Analytic expressions are derived for the root mean square timing jitter and the maximum length of error-free transmission with an arbitrary number of channels. An extensive analysis of system performance corresponding to situations with and without filters and/or dispersion management is carried out.     

增量式Huber-支持向量回归机算法研究

传统的面向支持向量回归的一次性建模算法中样本增加时,均需从头开始学习,而增量式算法可以充分利用上一阶段的学习成果。SVR的增量算法通常基于ε-不敏感损失函数,该损失函数对大的异常值比较敏感,而Huber损失函数对异常值敏感度低。所以在有噪声的情况下,Huber损失函数是比ε-不敏感损失函数更好的选择,在现实情况当中。基于此,本文提出了一种基于Huber损失函数的增量式Huber-SVR算法,该算法能够持续地将新样本信息集成到已经构建好的模型中,而不是重新建模。与增量式ε-SVR算法和增量式RBF算法相比,在对真实数据进行预测建模时,增量式Huber-SVR算法具有更高的预测精度。     

Efficient simulation of general stochastic hybrid systems

General Stochastic Hybrid System (SHS) are characterised by Stochastic Differential Equations (SDEs) with discontinuities and Poisson jump processes. SHS are useful in model based design of Cyber-Physical System (CPS) controllers under uncertainty. Industry standard model based design tools such as Simulink/Stateflow® are inefficient when simulating, testing, and validating SHS, because of dependence on fixed-step Euler–Maruyama (EM) integration and discontinuity detection. We present a novel efficient adaptive step-size simulation/integration technique for general SHSs modelled as a network of Stochastic Hybrid Automatons (SHAs). We propose a simulation algorithm where each SHA in the network executes synchronously with the other, at an integration step-size computed using adaptive step-size integration. Ito’ multi-dimensional lemma and the inverse sampling theorem are leveraged to compute the integration step-size by making the SDEs and Poisson jump rate integration dependent upon discontinuities. Existence and convergence analysis along with experimental results show that the proposed technique is substantially faster than Simulink/Stateflow®when simulating general SHSs.     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

Nonlinear Filtering for Diffusions in Random Environments

Suppose that the signal X to be estimated is a diffusion process in a random medium W and the signal is correlated with the observation noise. We study the historical filtering problem concerned with estimating the signal path up until the current time based upon the back observations. Using Dirichlet form theory, we introduce a filtering model for general rough signal X ^W and establish a multiple Wiener integrals representation for the unnormalized pathspace filtering process. Then, we construct a precise nonlinear filtering model for the process X itself and give the corresponding Wiener chaos decomposition.     

LINEAR ISOMETRIC NON-ANTICIPATIVE TRANSFORMATIONS OF WIENER PROCESS

ThispaperisanoutcomeofnumerousdiscusionsandexchangeofideaswithlatePredragPerunicic,whosedeepandprofoundmathematicalknowledgeandhumanvaluesgaveusaninspirationandmotivationtofinalizeourjointideas.1.Wereferto[3,4]forthenotionofspectralmultiplicitytheoryintheseparableHilbertspace.LetHbeacyclicHilbertspacewiththeresolutionoftheidentity{p(t)}ofthemaximalspectraltypelIP(dt)ll'~dt-ordinaryLebesguemeasure.Anon-anticipativelineartransformationsisdefinedbyVolterrakernelg(t,u),uSt,ajsf'g(t)u)p(du),t>0…     

N指标d维广义Wiener过程象集的m项代数和的几个性质

设珮犠（狋）：犚犖＋ →犚犱是犖指标犱维广义Ｗｉｅｎｅｒ过程，对任意紧集犈１，…，犈犿犚犖＞ ，该文研究了犿项代数和珮犠（犈１）…珮犠（犈犿）的Ｈａｕｓｄｏｒｆｆ维数，Ｐａｃｋｉｎｇ维数和正的Ｌｅｂｅｓｇｕｅ测度及内点的存在性． 其结果包含并推广了布朗单的结果．     

Small ball probabilities for a Wiener process under weighted sup-norms,with an application to the supremum of bessel local times

LetR be the radial part of ad-dimensional Wiener process, starting from 0. In this paper, small ball probabilities are evaluated for sup_0<11(t ^–p R(t)) and sup _t 0(e ^–1 R(t)), withp[0, 1/2]. Chung's law of the iterated logarithm is established for the supremum of the local times of a two-dimensional Bessel process.     

匹配滤波器映射编码方法研究

在Vander Lugt 相关器中,预先制作的匹配滤波器是系统能否得到较好的相关识别结果的关键。通常使用的迂回相位匹配滤波器编码法数据利用率不高,相关效果有进一步改进的空间。对基于最小欧几里德距离的映射编码法进行了研究,利用空间光调制器的振幅与相位调制特性进行滤波器编码,通过仿真实验分析了匹配滤波函数幅度因子对相关结果的影响,并与迂回相位编码法的相关结果进行了对比分析。从仿真结果可以看出:匹配滤波函数幅度因子越大,相关峰值越高;当幅度因子达到103时,相关峰值达到最大值;此时,映射编码法的相关峰值接近于迂回相位编码法的2倍。因此映射编码法比迂回相位编码法更有利于相关峰的判别。