In this paper, we extend notions of complex C - RIB-calculus to the bicomplex setting and compare the bicomplex polyanalytic function theory to the classical complex case. Applications of this theory include two bicom...
详细信息
In this paper, we extend notions of complex C - RIB-calculus to the bicomplex setting and compare the bicomplex polyanalytic function theory to the classical complex case. Applications of this theory include two bicomplex least mean square algorithms, which extend classical real and complex least mean square algorithms.
In this paper, we propose a block least mean square algorithm with delayed weight adaptation for hardware implementation of finite impulse response (FIR) adaptive filters. We have referred to the proposed algorithm as...
详细信息
ISBN:
(纸本)9781424424085
In this paper, we propose a block least mean square algorithm with delayed weight adaptation for hardware implementation of finite impulse response (FIR) adaptive filters. We have referred to the proposed algorithm as delayed block least mean square (Dblms) algorithm. Unlike the delayed least mean square (DLMS) algorithm, the Dblms algorithm takes a block of L input samples and yields a block of L output in every training cycle. The simulation result shows that the Dblms algorithm has convergence performance equivalent to that of the DLMS algorithm. We have exploited the parallelism inherent in the Dblms algorithm to derive a highly concurrent systolic architecture for FIR adaptive filters. The proposed architecture can support L time higher sampling rate compared with the best of the existing pipelined designs and, therefore, it would involve less samples of adaptation delays and would provide a more efficient implementation of LMS-based adaptive filters.
暂无评论