In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filt...In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filter is designed using the Frequency Response Masking (FRM) technique. This filter is converted into a multiplier-less filter by representing it in the Canonic Signed Digit (CSD) space. The design of the FRM filter in the CSD space calls for the use of a discrete optimization technique. To this end, a new optimization approach is proposed using a modified Harmony Search Algorithm (HSA). HSA is modified in such a way that, in every exploitation and exploration phase, the candidate solutions turns out to be integers. The 1D FRM multiplier-less filter, is in turn transformed to the 2D equivalent using the recently proposed multiplier-less transformations namely, T1 and T2. These transformations are successful in generating circular contours even for wideband filters. Since multipliers are the most power consuming elements in a 2D filter, the multiplier-less realization calls for reduced power consumption as well as computation time. Significant reduction in the computational complexity and computation time are the highlights of our proposed design technique. Besides, the proposed discrete optimization using modified HSA can be used to solve optimization problems in other engineering disciplines, where the search space consists of integers.展开更多
The sign algorithm has been extensively investigated for digital echo cancellation application and other adaptive filtering applications. In this paper, we use the blind averaging Sign-regressor (SR) algorithm for ada...The sign algorithm has been extensively investigated for digital echo cancellation application and other adaptive filtering applications. In this paper, we use the blind averaging Sign-regressor (SR) algorithm for adaptive multiuser detection. It is another least mean square (LMS) algorithm and eliminates the need for multiplication in the adaptive algorithm. The new algorithm not only reduces the calculation complexity but also has good convergence character. Simulations indicate that this algorithm can adapt to the changes of the environment quickly and improve the stability of the SIR.展开更多
This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is ...This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chordal comparability graphs.展开更多
高速通信接口中均衡器必须借助于自适应算法才能实时跟踪并处理信道的变化以实现对不同信道损耗的动态补偿。提出一种新的符号最小均方(Sign Sign Least Mean Square,SS-LMS)自适应算法,在传统SS-LMS算法的基础上,使用数字状态机检测接...高速通信接口中均衡器必须借助于自适应算法才能实时跟踪并处理信道的变化以实现对不同信道损耗的动态补偿。提出一种新的符号最小均方(Sign Sign Least Mean Square,SS-LMS)自适应算法,在传统SS-LMS算法的基础上,使用数字状态机检测接收数据的码型,并引入期望值算法,利用内部基准电压和均衡数据的乘积替代外部引入的期望数据,通过比较参考基准电压与接收信号,实现对增益的自适应调节。该算法从根本上解决了传统SS-LMS自适应算法需依赖于外部输入训练数据的缺陷,不但提高了均衡器的自适应能力,而且通过减少接口数量节约了芯片设计成本。采用SMIC 28 nm CMOS工艺,设计了基于改进算法的自适应接收器电路。实现最高12.5 Gb/s传输速率下,通道衰减为25 dB的数据均衡,均衡后的眼图水平张开度可达到0.88 UI。展开更多
文摘In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filter is designed using the Frequency Response Masking (FRM) technique. This filter is converted into a multiplier-less filter by representing it in the Canonic Signed Digit (CSD) space. The design of the FRM filter in the CSD space calls for the use of a discrete optimization technique. To this end, a new optimization approach is proposed using a modified Harmony Search Algorithm (HSA). HSA is modified in such a way that, in every exploitation and exploration phase, the candidate solutions turns out to be integers. The 1D FRM multiplier-less filter, is in turn transformed to the 2D equivalent using the recently proposed multiplier-less transformations namely, T1 and T2. These transformations are successful in generating circular contours even for wideband filters. Since multipliers are the most power consuming elements in a 2D filter, the multiplier-less realization calls for reduced power consumption as well as computation time. Significant reduction in the computational complexity and computation time are the highlights of our proposed design technique. Besides, the proposed discrete optimization using modified HSA can be used to solve optimization problems in other engineering disciplines, where the search space consists of integers.
文摘The sign algorithm has been extensively investigated for digital echo cancellation application and other adaptive filtering applications. In this paper, we use the blind averaging Sign-regressor (SR) algorithm for adaptive multiuser detection. It is another least mean square (LMS) algorithm and eliminates the need for multiplication in the adaptive algorithm. The new algorithm not only reduces the calculation complexity but also has good convergence character. Simulations indicate that this algorithm can adapt to the changes of the environment quickly and improve the stability of the SIR.
文摘This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chordal comparability graphs.
