Adaptive recursive algorithm for complementary subspace-based blind multiuser detection

doi:10.1109/82.988938

Return

Adaptive recursive algorithm for complementary subspace-based blind multiuser detection

2001-01-01

PRE

Jyh‐Horng Wen

Chao-Kai Wen

DOI：10.1109/82.988938

Original

Original request for help

Save

Abstract

En 中文

A novel blind adaptive multiuser detection scheme, the linear decorrelating detector (LDD), based on a concept of the complementary subspace is proposed. Under this scheme, the information bits can be estimated from the received signal with the prior knowledge of the desired user's signature waveform and its timing. The technique has two key elements: a geometric notion of the LDD and the subspace-based concept to estimate the orthogonal complement of the interfering space. It is then shown that the LDD can be formulated in terms of the interference space constructed from the received signal, and the desired user's signature waveform. The interference space components can be adaptively estimated using the modified power-based methods with only O((K - 1)N) flops of computation at each iteration, where N is the processing gain, and K is the number of active users in the channel. It is seen that compared with the previous subspace-based blind adaptive detector [1] having a computational complexity of O(KN) per iteration, our novel blind adaptive detector offers lower computational complexity. The proposed blind multiuser detection offers the optimal near-far resistance, low computational complexity, and resistance against the orthogonality error of the estimated interference space.

Keywords:

blind multiuser detection

complementary subspace concept

linear decorrelating detector

principal eigenspace tracking

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.