EV-DO信道估计选径策略探讨

EV-DO是高通公司在cdma2000基础上提出的基于提高分组数据性能的系统标准。文章从数据业务和传统的语音业务的比较说起,介绍了EV-DO系统中区别于cdma2000的技术特征(包括自适应编码、快速自动重复请求机制(ARQ)、速率控制、时隙导频工作方式等),并以此平台为例阐述了信道估计中的选径意义和策略,最后简单分析不同选径策略的性能,其中选径策略的讨论是基于带导频信道的无线系统平台而提出的,具有一定的普遍性。     

AJAX在数据广播中的应用及实现

AJAX是Web2.0的核心技术之一,它其实是JavaScript和XML等多种技术的综合.由于AJAX的异步交互特性,使它在数据广播中将有很大的应用空间.分析了AJAX在数据广播中的主要应用方向,研究了AJAX在机顶盒中的实现.     

从数据库到数据仓库——广电未来的制胜武器

在目前数据爆炸、信息匮乏的情况下，需要利用数据仓库系统集成1个或多个独立传统数据库数据，通过分析海量数据发现市场潜在规律，获取商业信息以支持商业决策，这将是广电未来的制胜武器。     

1.25～3.125 Gb/s连续数据速率CDR设计

设计了一款工作速率为1.25～3.125 Gb/s的连续可调时钟数据恢复(CDR)电路,可以满足多种通信标准的设计需求.CDR采用相位插值型双环路结构,使系统可以根据应用需求对抖动抑制和相位跟踪能力独立进行优化.针对低功耗和低噪声的需求,提出一种新型半速率采样判决电路,利用电流共享和节点电容充放电技术,数据速率为3.125 Gb/s时,仅需要消耗50 μA电流.芯片采用0.13 μm工艺流片验证,面积0.42 m㎡,功耗98 mw,测试结果表明,时钟数据恢复电路接收PRBS7序列时,误码率小于10-12.     

双摄像机傅里叶变换轮廓术的数据融合

在三维面形拼接应用当中,对拼接区域内面形数据以一定的权重进行加权平均是最常用的方法,通常的算法是以拼接边界到中心线的距离为权重,这样可以对拼接区域内各点实现平滑过渡,但在拼接区域的边界存在一定的局限性。本文将一种正弦函数形式的图像镶嵌算法引入到三维面形测量的数据融合中,很好地实现了整个拼接区域的平滑过渡。该方法运算量小...     

基于大数据分析的客户维系支撑系统建设和应用

移动互联网的发展催生了海量的数据以及多样化的用户需求,将导致传统的粗放式用户管理模式转变为“以大数据分析为基础,利用互联网平台精确管理用户需求”的用户管理模式,因此要从产品改进、客户细分、线上线下一体化、维系策略等方面重点完善客户维系支撑系统,提高维系效果和效率。     

The convergence of three spline methods for scattered data interpolation and fitting

The convergences of three L₁ spline methods for scattered data interpolation and fitting using bivariate spline spaces are studied in this paper. That is, L₁ interpolatory splines, splines of least absolute deviation, and L₁ smoothing splines are shown to converge to the given data function under some conditions and hence, the surfaces from these three methods will resemble the given data values.     

The Method of Virtual Experts in Mathematical Diagnostics

Mathematical Diagnostics (MD) deals with identification problems arising in different practical areas. Some of these problems can be described by mathematical models where it is required to identify points belonging to two or more sets of points. Most of the existing tools provide some identification rule (a classifier) by means of which a given point is assigned (attributed) to one of the given sets. Each classifier can be viewed as a virtual expert. If there exist several classifiers (experts), the problem of evaluation of experts’ conclusions arises. In the paper for the case of supervised classification the method of virtual experts (the VE-method) is described. Based on this method, a generalized VE method is proposed where each of the classifiers can be chosen from a given family of classifiers. As a result, a new optimization problem with a discontinuous functional is stated. Examples illustrating the proposed approach are provided. The work of the second author was supported by the Russian Foundation for Fundamental Studies (RFFI) under Grant No 03-01-00668.     

Learning Markov chains in fractal compression of image data

In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available. Received: 1 July 2002     

几种国际通用统计软件的比较

汤旦林，王松柏．几种国际通用统计软件的比较，数理统计与管理，１９９７，１６（１），４８～５３．本文对七种著名的国际通用统计软件作了扼要的介绍，并从用户的角度对它们的性能进行了具体的比较