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).     

A Neural Network Approach for Signal Detection in Digital Communications

In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications.     

Discrete element approach for mine dump stability analysis

Mine overburden dumps have posed significant safety issues in the operations of various unit operations of open pit min-ing especially the external dumps. The external dumps are composed of a mixture of fragmented rocks and loose soil. Their charac-teristic is comparable to heavily discontinuous solid mass. The conventional approach of limit equilibrium methods provide safety factors for the slope but nothing about the stress-strain characteristics of the large dump mass. The designs of dump location and their respective geometry are integrated for the know-how of the stability characteristics of these dumps. The discrete element method uses a circular disk to represent the granular solid mass and their interactions are described by the Newton's third law of motion. The displacement is described by the sliding of the circular disk. This work is focused on the modeling efficiency of the discrete element methods to represent the behaviour of mine dump masses with the specified joint plane for the limit equilibrium method. The advantage of the work lies on the ease of information retrieval at any point at the dump mass concerning the stress and strain histories, displacement, failures etc. which when integrated produces a better understanding of the stability of the dump masses.     

A social interaction system based on cloud computing for mobile video telephony

As the use of smartphones become popular,people heavily depend on smartphone applications to deal with their social activities.For this reason,traditional message texting between mobile applications does not fulfill the versatile requirements of social networking.Many mobile applications use multimodality to deliver multimedia messages including sticker,voice and photo message,video call,and snap movie to enhance the communicative capability.However,without face-to-face interaction,people may fail to detect the other side’s non-verbal social behavior such as fine-grain facial expressions,body movements,or hand gesture.During social interaction,non-verbal behavior conveys information about the involved individuals and help the speakers express their social emotion in an implicit way.It is so important for real-world face-to-face interaction but is often blocked on the mobile telephony.To cope with this problem,we propose an afective computing model to assist the representation of social emotion and then help the progress of social interaction on the mobile telephony.In this model,for the purpose of real-time afective analysis,we delegate the computing loading to the cloud side service and enhance the system’s scalability and availability.The result of this experiment approves the feasibility of our system design for the applications of social intelligent.Also,the system provides a research framework of the social intelligent system on the mobile telephony.     

一种改进编码器角度解算过程的方法与实现

在机械电子一直是一个热门学科,其目的是通过软件控制机械操作来代替机械的哑巴解决方案。DS-25旋转电子编码器能够很好地与机械电子应用相匹配,其输出为两路标准的sine和cosine曲线,通过分析sine和cosine数值来计算编码器所对应的绝对角度位置。通过对DS-25的工作模式分析和实际应用情况提出角度解算的改进方案,该方案利用DS-25工作于粗略模式下测试到的角度值来推算精确模式下的信号周期,结合精确模式下测试到的角度值来计算编码器所对应的绝对角度。摒弃其原有的复杂查表过程进而节省电子表格的存储空间,在降低硬件成本的同时提升了软件灵活性。实验证明,算法的改进能够节省约2KB的存储空间,角度位置误差能控制在1‰以内。     

改进的猴王遗传算法求解组合拍卖最优竞胜标

应用遗传算法求解第一价格封闭组合拍卖问题,编码及约束条件复杂,在交叉和变异的过程中容易产生大量不可行解,并且在选择和精英保留中,一些局部最优点(早熟点)对应的个体容易被大量复制,使群体多样性下降。该文就以上的问题,改进了原有遗传算法求解组合拍卖最优竞胜标的方法,并采用了猴王遗传算法的精英保留策略。实际计算证明本算法编码方式自然并且直观表达了个体和标的的关系。在交叉和变异算子中,产生不可行解的数量下降,更积极的保存了上一代进化的部分成果。而改进猴王遗传算法的精英保留策略,使算法能够以高概率跳出早熟,达到算法速度与准确的平衡。     

Stabilizing switching design for switched linear systems: A state-feedback path-wise switching approach

This paper addresses the problem of switching stabilization for discrete-time switched linear systems. Based on the abstraction-aggregation methodology, we propose a state-feedback path-wise switching law, which is a state-feedback concatenation from a finite set of switching paths each defined over a finite time interval. We prove that the set of state-feedback path-wise switching laws is universal in the sense that any stabilizable switched linear system admits a stabilizing switching law in this set. We further develop a computational procedure to calculate a stabilizing switching law in the set.     

Mathematical methods of geoinformatics. III. Fuzzy comparisons and recognition of anomalies in time series

The search for anomalies in time series by methods of fuzzy logic is further explored. The algorithms DRAS and FLARS underlying these methods are further developed in the form of the algorithm FCARS that is completely based on fuzzy comparisons. Parts 1 and 2 were published in Cybernetics and Systems Analysis, No. 2, 2002 and No. 4, 2003. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 3–18, May–June 2008.     

DCT- and DST-based splitting methods for Toeplitz systems

New splitting iterative methods for Toeplitz systems are proposed by means of recently developed matrix splittings based on discrete sine and cosine transforms due to Kailath and Olshevsky [Displacement structure approach to discrete-trigonometric transform-based preconditioners of G. Strang type and of T. Chan type, SIAM J. Matrix Anal. Appl. 26 (2005), pp. 706–734]. Theoretical analysis shows that new splitting iterative methods converge to the unique solution of a symmetric Toeplitz linear system. Moreover, an upper bound of the contraction factor of our new splitting iterations is derived. Numerical examples are reported to illustrate the effectiveness of new splitting iterative methods.     

Stability analysis in a second-order differential equation with delays

A second-order differential equation with finite discrete delays is considered. Local stability of the zero equilibrium is investigated, and we obtain some sufficient conditions for the zero equilibrium is stable or unstable. Moreover, it is found that there exist the local Hopf bifurcations of the system when the delay varies.