Now showing items 51-53 of 53
A Fast Minimal-Symbol Subspace Approach to Blind Identification and Equalization
A subspace-based blind channel identification algorithm using only the fact that the received signal can be oversampled is proposed. No direct use is made of the statistics of the input sequence or even of the fact that ...
Fast Algorithms for 2-D Circular Convolutions and Number Theoretic Transforms Based on Polynomial Transforms over Finite Rings
In this paper, we develop new fast algorithms for 2-D integer circular convolutions and 2-D Number Theoretic Transforms (NTT). These new algorithms, which offers improved computational complexity, are constructed based on ...
Static and Dynamic Convergence Behavior of Adaptive Blind Equalizers
This paper presents a theoretical analysis of the static and dynamic convergence behavior for a general class of adaptive blind equalizers. We first study the properties of prediction error functions of blind equalization ...