2003
DOI: 10.1109/tsp.2002.806588
|View full text |Cite
|
Sign up to set email alerts
|

Gain calibration methods for radio telescope arrays

Abstract: Abstract-In radio telescope arrays, the complex receiver gains and sensor noise powers are initially unknown and have to be calibrated. Gain calibration can enhance the quality of astronomical sky images and, moreover, improve the effectiveness of array signal processing techniques for interference mitigation and spatial filtering. A challenging aspect is that the signal-to-noise ratio (SNR) is usually well below 0 dB, even for the brightest sky sources. The calibration method considered here consists of obser… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
87
0

Year Published

2005
2005
2017
2017

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 76 publications
(88 citation statements)
references
References 11 publications
1
87
0
Order By: Relevance
“…One of these compromises will be the number of sources peeled every 8 seconds. Several methods for calibrating antenna gains are compared in [26]. These are alternatives to the technique discussed in section III-C.…”
Section: Discussion Performancementioning
confidence: 99%
See 1 more Smart Citation
“…One of these compromises will be the number of sources peeled every 8 seconds. Several methods for calibrating antenna gains are compared in [26]. These are alternatives to the technique discussed in section III-C.…”
Section: Discussion Performancementioning
confidence: 99%
“…The technique that required the fewest computations was the logarithmic least squares (LOGLS) algorithm, which scaled as N 2 a . The numbers given in [26] for a single polarization version are 2N 2 a multiplications with an additional 16N 2 a for weighting. How does this compare to the algorithm discussed in section III-C?…”
Section: Discussion Performancementioning
confidence: 99%
“…Given R, we can solve for g and Σ n in several ways [24]- [26]. E.g., any submatrix away from the diagonal is only dependent on g and is rank 1: this allows direct estimation of g. In the more general case described by (3), multiple calibrators may be simultaneously present.…”
Section: Scenariomentioning
confidence: 99%
“…The state-of-the-art consists in the so-called alternating least squares approach [24]- [27], which leads to statistically efficient algorithm under a Gaussian model, since the least squares estimator is equivalent to the maximum likelihood (ML) estimator in this case. On the other hand, expectation maximization (EM) [28]- [30] and EM-based algorithms, such as the space alternating generalized expectation maximization algorithm [31], have been proposed in order to enhance the convergence rate of the least squares-based calibration algorithms [32].…”
Section: Introductionmentioning
confidence: 99%