اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA new map-making algorithm for CMB polarisation experiments
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
With the temperature power spectrum of the cosmic microwave background (CMB) at least four orders of magnitude larger than the B-mode polarisation power spectrum, any instrumental imperfections that couple temperature to polarisation must be carefully controlled and/or removed. Here we present two new map-making algorithms that can create polarisation maps that are clean of temperature-to-polarisation leakage systematics due to differential gain and pointing between a detector pair. Where a half wave plate is used, we show that the spin-2 systematic due to differential ellipticity can also by removed using our algorithms. The algorithms require no prior knowledge of the imperfections or temperature sky to remove the temperature leakage. Instead, they calculate the systematic and polarisation maps in one step directly from the time ordered data (TOD). The first algorithm is designed to work with scan strategies that have a good range of crossing angles for each map pixel and the second for scan strategies that have a limited range of crossing angles. The first algorithm can also be used to identify if systematic errors that have a particular spin are present in a TOD. We demonstrate the use of both algorithms and the ability to identify systematics with simulations of TOD with realistic scan strategies and instrumental noise.
قيم البحث
اقرأ أيضاً
Future cosmic microwave background (CMB) polarisation experiments aim to measure an unprecedentedly small signal - the primordial gravity wave component of the polarisation field B-mode. To achieve this, they will analyse huge datasets, involving yea
rs worth of time-ordered data (TOD) from massively multi-detector focal planes. This creates the need for fast and precise methods to complement the M-L approach in analysis pipelines. In this paper, we investigate fast map-making methods as applied to long duration, massively multi-detector, ground-based experiments, in the context of the search for B-modes. We focus on two alternative map-making approaches: destriping and TOD filtering, comparing their performance on simulated multi-detector polarisation data. We have written an optimised, parallel destriping code, the DEStriping CARTographer DESCART, that is generalised for massive focal planes, including the potential effect of cross-correlated TOD 1/f noise. We also determine the scaling of computing time for destriping as applied to a simulated full-season data-set for a realistic experiment. We find that destriping can out-perform filtering in estimating both the large-scale E and B-mode angular power spectra. In particular, filtering can produce significant spurious B-mode power via EB mixing. Whilst this can be removed, it contributes to the variance of B-mode bandpower estimates at scales near the primordial B-mode peak. For the experimental configuration we simulate, this has an effect on the possible detection significance for primordial B-modes. Destriping is a viable alternative fast method to the full M-L approach that does not cause the problems associated with filtering, and is flexible enough to fit into both M-L and Monte-Carlo pseudo-Cl pipelines.
We present a new map-making method for CMB measurements. The method is based on the destriping technique, but it also utilizes information about the noise spectrum. The low-frequency component of the instrument noise stream is modelled as a superposi
tion of a set of simple base functions, whose amplitudes are determined by means of maximum-likelihood analysis, involving the covariance matrix of the amplitudes. We present simulation results with $1/f$ noise and show a reduction in the residual noise with respect to ordinary destriping. This study is related to Planck LFI activities.
We present ROMA, a parallel code to produce joint optimal temperature and polarisation maps out of multidetector CMB observations. ROMA is a fast, accurate and robust implementation of the iterative generalised least squares approach to map-making. W
e benchmark ROMA on realistic simulated data from the last, polarisation sensitive, flight of BOOMERanG.
A great deal of experimental effort is currently being devoted to the precise measurements of the cosmic microwave background (CMB) sky in temperature and polarisation. Satellites, balloon-borne, and ground-based experiments scrutinize the CMB sky at
multiple scales, and therefore enable to investigate not only the evolution of the early Universe, but also its late-time physics with unprecedented accuracy. The pipeline leading from time ordered data as collected by the instrument to the final product is highly structured. Moreover, it has also to provide accurate estimates of statistical and systematic uncertainties connected to the specific experiment. In this paper, we review likelihood approaches targeted to the analysis of the CMB signal at different scales, and to the estimation of key cosmological parameters. We consider methods that analyze the data in the spatial (i.e., pixel-based) or harmonic domain. We highlight the most relevant aspects of each approach and compare their performance.
We present a Gibbs sampling solution to the map-making problem for CMB measurements, building on existing destriping methodology. Gibbs sampling breaks the computationally heavy destriping problem into two separate steps; noise filtering and map binn
ing. Considered as two separate steps, both are computationally much cheaper than solving the combined problem. This provides a huge performance benefit as compared to traditional methods, and allows us for the first time to bring the destriping baseline length to a single sample. We apply the Gibbs procedure to simulated Planck 30 GHz data. We find that gaps in the time-ordered data are handled efficiently by filling them with simulated noise as part of the Gibbs process. The Gibbs procedure yields a chain of map samples, from which we may compute the posterior mean as a best-estimate map. The variation in the chain provides information on the correlated residual noise, without need to construct a full noise covariance matrix. However, if only a single maximum-likelihood frequency map estimate is required, we find that traditional conjugate gradient solvers converge much faster than a Gibbs sampler in terms of total number of iterations. The conceptual advantages of the Gibbs sampling approach lies in statistically well-defined error propagation and systematic error correction, and this methodology forms the conceptual basis for the map-making algorithm employed in the BeyondPlanck framework, which implements the first end-to-end Bayesian analysis pipeline for CMB observations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
