Developing fast and robust methods for identifying multiple FIR channels driven by an unknown common source is important for wireless communications, speech reverberation cancellation, and other applications. In this correspondence, we present a new method that exploits a minimum noisesubspace (MNS). The MNS is computed from a set of channel output pairs that form a “tree”. The “tree” exploits, with minimum redundancy, the diversity among all channels. The MNS method is much more efficient in computation than a standard subspace method. The noise robustness of the MNS method is illustrated by simulatio
The finite alphabet property of digital communication signals, along with oversampling techniques, e...
Summarization: The least-squares and the subspace methods are two well-known approaches for blind ch...
This paper presents a subspace method for bland channel es-t imation based on a special output corre...
Developing fast and robust methods for identifying multiple FIR channels driven by an unknown common...
This paper considers the problem of blind channel estimation of multi channel FIR filters. This is a...
A subspace-based blind channel identification algorithm using only the fact that the received signal...
This paper considers the problem of blind estimation of multiple FIR channels. When a subspace algor...
This paper presents a novel optimization method for blind multi-channel identification. The formulat...
Abstract—We study blind identification and equalization of finite impulse response (FIR) and multi-i...
This paper develops a fast maximum likelihood method for estimating the impulse responses ofmultiple...
We study blind identification and equalization of finite impulse response (FIR) and multi-input and ...
This paper presents a new subspace based method for blind identification of a p-input/q-output syste...
The least-squares and the subspace methods are well known approaches for blind channel identificatio...
International audienceBased on the minimum noise subspace (MNS) method previously introduced in the ...
This paper presents an algorithm of blind identification and equalization of finite-impulse-response...
The finite alphabet property of digital communication signals, along with oversampling techniques, e...
Summarization: The least-squares and the subspace methods are two well-known approaches for blind ch...
This paper presents a subspace method for bland channel es-t imation based on a special output corre...
Developing fast and robust methods for identifying multiple FIR channels driven by an unknown common...
This paper considers the problem of blind channel estimation of multi channel FIR filters. This is a...
A subspace-based blind channel identification algorithm using only the fact that the received signal...
This paper considers the problem of blind estimation of multiple FIR channels. When a subspace algor...
This paper presents a novel optimization method for blind multi-channel identification. The formulat...
Abstract—We study blind identification and equalization of finite impulse response (FIR) and multi-i...
This paper develops a fast maximum likelihood method for estimating the impulse responses ofmultiple...
We study blind identification and equalization of finite impulse response (FIR) and multi-input and ...
This paper presents a new subspace based method for blind identification of a p-input/q-output syste...
The least-squares and the subspace methods are well known approaches for blind channel identificatio...
International audienceBased on the minimum noise subspace (MNS) method previously introduced in the ...
This paper presents an algorithm of blind identification and equalization of finite-impulse-response...
The finite alphabet property of digital communication signals, along with oversampling techniques, e...
Summarization: The least-squares and the subspace methods are two well-known approaches for blind ch...
This paper presents a subspace method for bland channel es-t imation based on a special output corre...