Parameter estimation of MC-CDMA signals based on modified cyclic autocorrelation

An algorithm, based on frequency domain accumulation for the cyclic autocorrelation of MC-CDMA signals, is proposed to estimate the signal parameters: useful data duration, symbol duration, and chip duration in multipath fading channel. Firstly the cycle autocorrelation of received MC-CDMA signals is computed, then frequency domain accumulation is used to reduce the influence of noise. At last, through interval measurement between the peak pulses in different slices, parameters mentioned above can be estimated. Meanwhile, for the estimation of symbol duration, a novel accumulative average method is developed: by averaging amplitudes of the spectral lines in each column parallel to the time-delay axis in the three-dimensional diagram, the symbol duration can be obtained. The cyclic autocorrelation expression of MC-CDMA signal has been derived, and simulation results show that the proposed algorithm is effective and works well under the condition of low signal-to-noise ratio (SNR).     

Syntactic compression codes at the zero entropy point

Syntactic compression codes compress the tree, which is the syntax of a binary source message. The ones considered here originate from image processing. The syntactic trees usedhave a constant valency and their binary labels distinguish whether the source substring derived from a node is completely zero or not. We compress them simply by deleting some redundant subtrees.

These codes fall into a theoretically new class of codes which is wider than the classical ones. They are here studied in the neighborhood of a zero of the binary entropy function. There, their behavior is close to that of an infinite run length encoding and the optimum valency is three. Finally, we open a problem, related with automata theory, which perhaps could provide a further link between Information Theory and Algorithmic Information Theory.     

基于IEEE802.16d系统的简易信道估计算法

提出了基于IEEE802.16d标准的当信道的响应大于循环前缀(CP)时一种简易的信道估计算法。利用系统前导的特殊时域结构,在不增加系统实现复杂度的基础上就可以很好地消除由于循环前缀不足而带来的ICI和ISI的干扰。仿真结果表明该方法可以满足IEEE802.16d在高速非视距环境下对信道估计的性能要求,该研究结果对高传输速率的信道信息估计有较大的参考价值。     

一种基于Trie的快速IP路由查找算法

Internet的飞速发展要求核心路由器能够实现快速的分组转发和路由更新功能,实现这一功能的关键是路由表的组织结构和快速的路由查找算法.提出了带有转发域信息树的多分支Trie结构路由查找算法,它由固定步长的多分支Tile结构的路由表和转发域信息树两部分组成.对于一个长度为w的路由前缀,其查找、插入、删除路由的时间复杂度均为O((w-m)/n+1),其中m、n为Trie树的步长.它解决路由查找过程中快速更新的问题,具有算法简单、查找速度快、易于更新、空间利用率高、便于向IPv6过渡等优点.     

改进的树型结构RFID防碰撞算法

将整棵大查询树分为若干分支,在每一个分支内进行标签识别,减少碰撞发生的概率。算法分为前缀确定和分支查询2个阶段,在前缀确定阶段读取所有标签前缀,每个前缀代表一个分支,依次遍历每一分支;查询过程采用后退式搜索策略和动态搜索方式。理论分析和仿真实验表明,算法能够从查询次数、时延、吞吐率多方面改善RFID系统的整体性能。     

一种改进的TD-LTE下行定时同步算法

针对正交频分复用定时同步实际应用问题,利用循环前缀的统计能量差和统计相关特性,提出了一种改进的TD-LTE下行定时同步算法,减小了计算复杂度,同时能检测循环前缀类型.仿真结果表明,算法在多径衰落信道下,特别是小信噪比条件下,定时同步性能优越,并对归一化频偏和多普勒频移变化具有较强的适应能力.     

基于差分隐私的轨迹模式挖掘算法

针对现有基于差分隐私的频繁轨迹模式挖掘算法全局敏感度过高、挖掘结果可用性较低的问题,提出一种基于前缀序列格和轨迹截断的差分隐私下频繁轨迹模式挖掘算法--LTPM。该算法首先利用自适应的方法获得最优截断长度,然后采用一种动态规划的策略对原始数据库进行截断处理,在此基础上,利用等价关系构建前缀序列格,并挖掘频繁轨迹模式。理论分析表明LTPM算法满足ε-差分隐私;实验结果表明,LTPM算法的准确率（TPR）和平均相对误差（ARE）明显优于N-gram和Prefix算法,能有效提高挖掘结果的可用性。     

低压变频器IGBT模块烧毁原因分析及控制回路改进

通过对焦化空冷器风机变频器整流模块IGBT短路烧毁的故障原因分析,找出故障原因,并通过变频器的工作原理对常用的几中接线方式进行探讨,对现有的变频器接线方式提出整改方案。     

一种基于PN序列和循环前缀的OFDM同步算法

同步是OFDM（Orthogonal Frequency Division Multiplexing）系统的关键技术之一。使用重复的PN（pseudo-noise）序列和循环前缀作同步的新方法,与仅利用循环前缀的方法相比,有估计精度高和范围大的优点。在给出其推导过程的基础上给出了仿真结果,证明了分析的正确性。