1997
DOI: 10.1109/78.552229
|View full text |Cite
|
Sign up to set email alerts
|

Robust beamforming for interference rejection in mobile communications

Abstract: The problem of robust beamformer design in the presence of moving sources is considered. A new technique based on a generalization of the constrained minimum variance beamformer is proposed. The method explicitly takes into account c hanges in the scenario due to the movement of the desired and interfering sources, requiring only estimation of the desired DOA. Computer simulations show that the resulting performance constitutes a compromise between interference and noise rejection, computational complexity, an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2001
2001
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 60 publications
(28 citation statements)
references
References 5 publications
0
28
0
Order By: Relevance
“…Because the change of DOA is very small with high probability, suppose that Δθ q obeys normal distribution with a mean of 0 and a variance of ξ 2 q1 (Δθ q ∼ N (0, ξ 2 q1 )), and Δφ q obeys normal distribution with a mean of 0 and a variance of ξ 2 q2 (Δφ q ∼ N (0, ξ 2 q2 )). The above model is used in [15] and [16] to describe the distributed targets and the transmit characteristics of mobile communication. Thus, the mean covariance matrix can be given bȳ…”
Section: Algorithm Formulationmentioning
confidence: 99%
“…Because the change of DOA is very small with high probability, suppose that Δθ q obeys normal distribution with a mean of 0 and a variance of ξ 2 q1 (Δθ q ∼ N (0, ξ 2 q1 )), and Δφ q obeys normal distribution with a mean of 0 and a variance of ξ 2 q2 (Δφ q ∼ N (0, ξ 2 q2 )). The above model is used in [15] and [16] to describe the distributed targets and the transmit characteristics of mobile communication. Thus, the mean covariance matrix can be given bȳ…”
Section: Algorithm Formulationmentioning
confidence: 99%
“…Two different approaches have been independently developed using this idea. The first one exploits the so-called data-dependent derivative constraints (DDCs) [1], [3], whereas the second one is based on matrix tapers (MTs) [2], [4]. Unfortunately, both of them are ad hoc techniques and, hence, their performance can be unpredictable in scenarios with rapidly moving interferers.…”
Section: Introductionmentioning
confidence: 98%
“…The snapshot vector can be modeled as (2) where and are the interference and noise components, respectively. Here, is the signal waveform, and is the signal steering vector (which is assumed to be precisely known in this section).…”
Section: Introductionmentioning
confidence: 99%
“…In [29], two NB algorithms as covariance matrix taper methods are defined, and considered as effective robust adaptive beam forming techniques, imparting robustness into adaptive pattern by judicious choice of null placement and width. As for wireless communication, NB was employed in a cellular communication system, particularly an example was given in space division multiple access system for downlink beam forming [30].…”
Section: Podb Methods With Spread Nullsmentioning
confidence: 99%