中国剩余定理在多项式乘法计算中的应用

本文首先给出了一个有效的中国剩余定理,然后给出一个应用该定理的具有大整数系数的多项式乘法算法,并对该算法的运行时间进行了分析。     

周期为pn+1的GF（q）上广义分圆序列的线性复杂度

主要研究周期为pn+1的q元域上广义分圆序列的线性复杂度,即把二元域上Edemskii的研究结果推广到一般GF(q)上。这里利用分圆数和部分指数和来给出具体的关于线性复杂度的计算公式。     

基于深度学习的两跳放大转发中继网络多中继选择策略

以接收端的平均接收信噪比(SNR)最大化为目标,两跳放大转发中继网络多中继选择策略问题被规划为0-1非线性整数规划问题,其最优解只可以利用穷举法得到.提出基于深度学习多中继选择策略,降低时间复杂度.仿真结果表明:与穷举法相比,该方法能够达到几乎相同的平均接收SNR,且其时间复杂度明显低于穷举法.     

Low-complexity method for DOA estimation based on ESPRIT

A low-complexity method for direction of arrival (DOA) estimation based on estimation signal parameters via rotational invariance technique (ESPRIT) is proposed. Instead of using the cross-correlation vectors in multistage Wiener filter (MSWF), the orthogonal residual vectors obtained in conjugate gradient (CG) method span the signal subspace used by ESPRIT. The computational complexity of the proposed method is significantly reduced, since the signal subspace estimation mainly needs two matrixvector complex multiplications at the iteration of data level. Furthermore, the prior training data are not needed in the proposed method. To overcome performance degradation at low signal to noise ratio (SNR), the expanded signal subspace spanned by more basis vectors is used and simultaneously renders ESPRIT yield redundant DOAs, which can be excluded by performing ESPRIT once more using the unexpanded signal subspace. Compared with the traditional ESPRIT methods by MSWF and eigenvalue decomposition (EVD), numerical results demonstrate the satisfactory performance of the proposed method.     

Low complexity DCT-based distributed source coding with Gray code for hyperspectral images

To compress hyperspectral images, a low complexity discrete cosine transform (DCT)-based distributed source coding (DSC) scheme with Gray code is proposed. Unlike most of the existing DSC schemes, which utilize transform in spatial domain, the proposed algorithm applies transform in spectral domain.Set-partitioning-based approach is applied to reorganize DCT coefficients into waveletlike tree structure and extract the sign, refinement, and significance bitplanes. The extracted refinement bits are Gray encoded. Because of the dependency along the line dimension of hyperspectral images, low density paritycheck-(LDPC)-based Slepian-Wolf coder is adopted to implement the DSC strategy. Experimental results on airborne visible/infrared imaging spectrometer (AVIRIS) dataset show that the proposed paradigm achieves up to 6 dB improvement over DSC-based coders which apply transform in spatial domain, with significantly reduced computational complexity and memory storage.     

一种新的不完备信息系统中极大相容块的构造算法

在不完备信息系统中以分层递阶的方式求取极大相容块的构造算法,简化了不完备信息系统中极大相容块的求取过程.然而,该算法有一定不足之处,在求取极大相容块的中间过程中,没有进行非极大相容块的去除,从而增加了算法的空间复杂度,所以该算法仅适用于小规模不完备信息系统.基于这个缺点,提出了改进的极大相容块求取算法,从而可以在较大规模的不完备信息系统中进行极大相容块的求取.     

单应变换下无人机序列图像高效率压缩算法

针对高空无人机航拍序列图像的实时图像压缩问题,设计了一种基于单应变换的可精确定比的高压缩性能低计算复杂度航拍序列图像压缩算法.该算法使用机载惯导数据进行编码帧组划分并获得中间帧相对于首尾帧的初始单应变换,进而通过多子区匹配实现对单应矩阵的快速精确求解,然后通过单应变换来实现对中间帧的整体运动估计和补偿,最后用JPEG2000算法对帧组数据进行整体压缩.实验结果表明,相对于传统算法,该算法具有计算复杂度低、压缩比高、保真度好、可精确定比压缩的优点.     

周期为2pn的q元序列m紧错线性复杂度

结合k错线性复杂度曲线和最小错误的理论,提出m紧错线性复杂度的概念来研究序列线性复杂度的稳定性.首先优化魏-肖-陈算法的结构,即GF(q)上求周期为2pn的q元序列线性复杂度的快速算法;然后通过采用联合代价的方法,给出一个GF(q)上求周期为2pn的q元序列k错线性复杂度的快速算法;接着给出周期为2pn的q元序列的m紧错线性复杂度快速算法,其中p和q是奇素数,q为模p2的一个本原根.     

基于注水线调整的认知无线电通信效用计算算法

本文在瑞利衰落模型下,根据认知用户的效用函数,来解决认知无线电中的信道规划问题,进而得到认知用户的通信效用。当认知用户输入功率和比特误码率受限时,其最终效用仅与注水线有关,因此我们提出了一种基于注水线不断调整的认知无线电功率分配及通信效用计算算法。理论研究表明,该算法具有较低的运算复杂度和接近于最优算法的认知用户效用,仿真分析验证了结论的正确性。     

22-轮SMS4的差分分析

SMS4是中国官方公布的第一个商用分组密码标准,使用差分方法分析了18轮的SMS4差分特征,并在此基础上攻击了22-轮的SMS4,攻击过程需要2117个选择明文,2112字节的存储空间,而时间复杂度为2123次22-轮加密。此结果是目前对SMS4差分分析的最好结果。