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.
Bibliographical noteFunding Information:
Manuscript received May 10, 1999; revised September 15, 2000. This work was supported by NSF/CAREER CCR-9733540 (revised award CCR-0096165) and NSF/Wireless CCR-9979295. A partial summary of results appears in the Proceedings of EUSIPCO, September 5–8, 2000, Tampere, Finland, and in the Proceedings of ICASSP, June 5–9, 1999, Istanbul, Turkey. The associate editor coordinating the review of this paper and approving it for publication was Prof. A. M. Zoubir.