Identifiability results for blind beamforming in incoherentmultipath with small delay spread

Authors:
N.D. Sidiropoulos;Xiangqian Liu
Affiliations:
Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN;-
Venue:
IEEE Transactions on Signal Processing
Year:
2001

Citing 0
Cited 11

PARAFAC-based unified tensor modeling for wireless communication systems with application to blind multiuser equalization

Signal Processing
Blind PARAFAC signal detection for polarization sensitive array

EURASIP Journal on Applied Signal Processing
Blind channel identification algorithms based on the Parafac decomposition of cumulant tensors: The single and multiuser cases

Signal Processing
Blind Joint Symbol Detection and DOA Estimation for OFDM System with Antenna Array

Wireless Personal Communications: An International Journal
Multiuser MIMO system using block space-time spreading and tensor modeling

Signal Processing
Blind equalization of nonlinear channels using a tensor decomposition with code/space/time diversities

Signal Processing
Fast communication: Constrained Tucker-3 model for blind beamforming

Signal Processing
Blind multipath MIMO channel parameter estimation using the Parafac decomposition

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
DOA estimation of quasi-stationary signals with less sensors than sources and unknown spatial noise covariance: a Khatri-Rao subspace approach

IEEE Transactions on Signal Processing
Novel blind carrier frequency offset estimation for OFDM system with multiple antennas

IEEE Transactions on Wireless Communications
Uni-mode and Partial Uniqueness Conditions for CANDECOMP/PARAFAC of Three-Way Arrays with Linearly Dependent Loadings

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	35.69

Visualization

Abstract

Several explicit identifiability results are derived for deterministic blind beamforming in incoherent multipath with small delay spread. For example, it is shown that if the sum of spatial and fractional sampling diversities exceeds two times the total number of paths, then identifiability can be guaranteed even for one symbol snapshot. The tools come from the theory of low-rank three-way array decomposition (commonly referred to as parallel factor analysis (PARAFAC) and data smoothing in one and two dimensions. New results regarding the Kruskal-rank of certain structured matrices are also included, and they are of interest in their own right