Improved Scalar Multiplication on Elliptic Curves Defined over F2mn

We propose two improved scalar multiplication methods on elliptic curves over F_qn where q = 2^m using Frobenius expansion. The scalar multiplication of elliptic curves defined over subfield F_q can be sped up by Frobenius expansion. Previous methods are restricted to the case of a small m. However, when m is small, it is hard to find curves having good cryptographic properties. Our methods are suitable for curves defined over medium‐sized fields, that is, 10 ≤ m ≤ 20. These methods are variants of the conventional multiple‐base binary (MBB) method combined with the window method. One of our methods is for a polynomial basis representation with software implementation, and the other is for a normal basis representation with hardware implementation. Our software experiment shows that it is about 10% faster than the MBB method, which also uses Frobenius expansion, and about 20% faster than the Montgomery method, which is the fastest general method in polynomial basis implementation.     

Threshold‐Based Camera Motion Characterization of MPEG Video

We propose an efficient scheme for camera motion characterization in MPEG‐compressed video. The proposed scheme detects six types of basic camera motions through threshold‐based qualitative interpretation, in which fixed thresholds are applied to motion model parameters estimated from MPEG motion vectors (MVs). The efficiency and robustness of the scheme are validated by the experiment with real compressed video sequences.     

Exhaustive Output Arbitration of Input Buffered Switch with Buffered Crossbar

We propose a new arbitration method for an input buffered switch with a buffered crossbar. In the proposed method, an exhaustive polling method is used to decrease the synchronization. Using an approximate analysis, we explain how the proposed method improves the switch performance. Also, using computer simulations, we show the proposed method outperforms the previous methods under burst traffic.     

对Rijndael-256算法新的积分攻击

本文对Rijndael-256密码进行分析,从比特的层面上寻找平衡性,得到了一个新的3轮积分区分器,该区分器仅需32个明文就可将3轮Rijndael-256与随机置换区分开来,并且所得密文的每一比特都是平衡的.该区分器在已知的mjndael-256积分区分器中所需明文量最少.基于新的区分器,对4至7轮Riindael-...     

Fault dictionary based switched current circuit fault diagnosis using entropy as a preprocessor

A novel method based on a fault dictionary that uses entropy as a preprocessor to diagnose faulty behavior in switched current (SI) circuit is presented in the paper. The proposed method uses a data acquisition board to extract the original signal form the output terminals of the circuit-under-tests. These original data are fed to the preprocessors for feature extraction and finds out the entropies of the signals which are a quantitative measure of the information contained in the signals. The proposed method has the capability to detect and identify faulty transistors in SI circuit by analyzing its output signals with high accuracy. Using entropy of signals to preprocess the circuit response drastically reduces the size of fault dictionary, minimizing fault detect time and simplifying fault dictionary architecture. The result from our examples showed that entropies of the signals fall on different range when the faulty transistors^` Transconductance G_m value varying within their tolerances of 5 or 10%, thus we can identify the faulty transistors correctly when the response do not overlap. The average accuracy of fault recognition achieved is more than 95% although there are some overlapping data when tolerance is considered. The method can classify not only parametric faults but also catastrophic faults. It is applicable to analog circuits as well as SI ones. A low-pass and a band-pass SI filter and a Clock feedthrough cancellation circuit have been used as test beached to verify the effectiveness of the proposed method. A comparison of our work with Yuan et al. (IEEE Trans Instrum Meas 59(3):586–595, 2010), which used entropy and kurtosis as preprocessors, reveals that our method requiring one feature parameter reduces the computation and fault diagnosis time.     

一种新模板的图像边缘提取方法

为解决拉普拉斯和梯度等类算子提取图像边缘时算法复杂、程序化实现较为困难的问题,提出了一种新的横向和纵向模板算法,通过仿真实验,获得了优于梯度算子提取图像边缘的结果。并对以上算法进行改进,在边缘图像信息衰减微小的情况下,有效地改善了图像边缘的提取时间。利用该算法,对图像定位与匹配等领域进行了进一步的研究。     

一种基于Kalman的实时话务量预测算法

移动网话务量的预测可以为解决移动网的网络拥塞、覆盖规划、负载均衡和接入控制等方面的问题提供决策支持。日益复杂的移动网络环境对移动网话务量预测的实时性提出了新的要求,针对这一问题进行了研究,结合卡尔曼滤波算法在预测时效性方面的优点,提出了一种基于卡尔曼滤波的移动网实时话务量预测算。该算法通过对呼叫时延的实时预测实现对移动网实时话务量的预测。仿真结果表明,所提算法具有良好的实时性和预测质量。     

基于衍射受限矢量光管场的离散式复振幅滤波器的设计

提出一种离散式的复振幅光瞳滤波器,用于构建大数值孔径系统下柱对称偏振矢量光束的特殊聚焦光场。输入角向偏振矢量光束,经圆对称的6个离散环带复振幅滤波器滤波后聚焦。该滤波器半径已归一化,各环带具有不同透射振幅,外围两环带有相同的相位延迟,其余相邻透射环带间π反相。在聚焦区可获得超长(大于8λ)的衍射受限"光管"场。该"光管"场为中空的纯角向偏振矢量光场,管中心沿轴向无光场分布,光管横向直径(约0.31λ)在亚波长量级,"光管"管壁为沿轴向平坦分布的角向偏振矢量场,无轴向旁瓣。该复振幅滤波器可用于构建特殊三维矢量光场以及利用该光场进行粒子捕获和操控。     

基于UC28600控制器的开关电源设计

提出一种基于UC28600的脉冲宽度调制（PWM）控制器的开关电源设计方案。UC28600是TI公司的一款高性能的准谐振PWM控制器。该方案选用UC28600采用多模式控制以提高全负载条件下的开关转换效率,并达到减少电磁干扰,降低待机损耗的目的。