Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

火焰图像特征在火灾数字图像识别中的运用

火焰尖角数目和圆形度是早期火灾火焰的主要特征,本文主要论述了如何在数学形态学基础上,利用火灾火焰的两个特点判断和识别早期火情。实验中,对火焰的二值图像进行开运算,即先腐蚀,再膨胀,目的是为了对火焰图像进行形态学滤波,去噪。从实验结果可以看出,该算法可以很好的识别火焰和干扰源。     

基于算术傅里叶变换的离散Hartley变换的快速算法

离散Hartley变换是一种有用的实值正交变换。文中对其快速算法进行研究,首先介绍利用算术傅里叶变换（AFT）计算离散傅里叶变换（DFT）可使其乘法计算量仅为O（N）,然后文章根据这一特点,分析离散Hartley变换（DHT）的结构特征,通过DFT将AFT和DHT建立了直接联系,提出了一种新的快速DHT算法。算法的计算复杂度能够达到线性O（N）,且算法结构简单,公式统一且易于实现,并与其他快速算法进行了比较,分析可知在数据长度不是2的幂次方时,文中提出的算法的计算时间明显比其他算法的计算时间要小。实验结果也验证了文中算法的有效性,从而为DHT的快速计算开辟了新的思路和途径。     

提高定点精度的FPGA信号处理算法

为了满足速度、功耗等诸多限制的要求,数字信号处理算法常使用FPGA实现。而实现时由于硬件特点,通常将浮点运算转换成定点运算,但定点转换设计流程复杂、周期长,且存在数据范围和精度之间的矛盾。利用浮点数的优点,本文改进了基于FPGA的定点数的基本运算规则,有效解决了上述矛盾。本文详细论述了实现移位、加/减、乘、除基本运算模块的方法和步骤,最后以FIR数字滤波器为设计实例。仿真结果表明:改进的定点数算法比定点运算误差小、精度高、数据范围宽,能有效地防止溢出。     

Efficient multiple-precision integer division algorithm

Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient multi-precision integer division algorithm, and experimentally showed that it is about three times faster than the most popular algorithms proposed by Knuth [2] and Smith [3]. This paper reports a bug in the algorithm of Huang et al. [1], and suggests the necessary corrections. The theoretical correctness proof of the proposed algorithm is also given. The resulting algorithm remains as fast as that of [1].     

基于二叉树的几何图形拓扑运算

该文提出了一种基于二叉树的几何图形拓扑处理算法,实现几何图形间的精确处理。并能有效解决大多数边界问题,同时可以按需求设定不同的精度。     

基于动态联盟的一种身份信任计算模型

在动态联盟中,身份管理是确保信息安全的一种手段,但是随着联盟成员数日益增多,传统的身份管理难以妥善应对当前较为复杂的环境,尤其当成员之间无交互历史时,数据交换的可靠性无法保障。文中研究了不同计算环境中的多种信任管理方法,并把P2P的推荐评价机制应用到动态联盟的身份管理中,提出了一种基于推荐的身份信任管理的算法。在这种算法中,身份的信任值由多因素加权综合而成,其中推荐信任值在算法中起到关键的作用。该算法试图为解决复杂的动态联盟环境下的身份管理问题提供一种途径。     

聚众事件的建模与实现

在视频监控领域聚众等异常事件检测有着广泛的应用前景,然而相关研究在国内发展还比较缓慢。在这里给出了基于隐马尔科夫模型的聚众事件的检测方法,其简单过程如下:首先在高斯混合模型检测出目标的基础上,针对聚众事件视频序列的特性,完成了关于帧图像二元组的特征提取;然后,在合理选择初始模型的前提下使用Baum-Welch算法训练聚众事件的隐马尔科夫模型;最后通过实拍的视频序列验证其有效性。     

Continuous collision detection for adaptive simulation of articulated bodies

We perform continuous collision detection (CCD) for articulated bodies where motion is governed by an adaptive dynamics simulation. Our algorithm is based on a novel hierarchical set of transforms that represent the kinematics of an articulated body recursively, as described by an assembly tree. The performance of our CCD algorithm significantly improves as the number of active degrees of freedom in the simulation decreases.     

Structural Presburger digit vector automata

The least significant digit first decomposition of integer vectors into words of digit vectors provides a natural way for representing sets of integer vectors by automata. In this paper, the minimal automata representing Presburger sets are proved structurally Presburger: automata obtained by moving the initial state and replacing the accepting condition represent Presburger sets.