Automated reduction of submillimetre single-dish heterodyne data from the James Clerk Maxwell Telescope using ORAC-DR

With the advent of modern multi-detector heterodyne instruments that can result in observations generating thousands of spectra per minute it is no longer feasible to reduce these data as individual spectra. We describe the automated data reduction procedure used to generate baselined data cubes from heterodyne data obtained at the James Clerk Maxwell Telescope. The system can automatically detect baseline regions in spectra and automatically determine regridding parameters, all without input from a user. Additionally it can detect and remove spectra suffering from transient interference effects or anomalous baselines. The pipeline is written as a set of recipes using the ORAC-DR pipeline environment with the algorithmic code using Starlink software packages and infrastructure. The algorithms presented here can be applied to other heterodyne array instruments and have been applied to data from historical JCMT heterodyne instrumentation.Comment: 18 pages, 13 figures, submitted to Monthly Notices of the Royal Astronomical Societ

Studies on DOA estimation in the presence of multipath in a frequency hopping system

Master'sMASTER OF ENGINEERIN

Joint signal detection and channel estimation in rank-deficient MIMO systems

L'évolution de la prospère famille des standards 802.11 a encouragé le développement des technologies appliquées aux réseaux locaux sans fil (WLANs). Pour faire face à la toujours croissante nécessité de rendre possible les communications à très haut débit, les systèmes à antennes multiples (MIMO) sont une solution viable. Ils ont l'avantage d'accroître le débit de transmission sans avoir recours à plus de puissance ou de largeur de bande. Cependant, l'industrie hésite encore à augmenter le nombre d'antennes des portables et des accésoires sans fil. De plus, à l'intérieur des bâtiments, la déficience de rang de la matrice de canal peut se produire dû à la nature de la dispersion des parcours de propagation, ce phénomène est aussi occasionné à l'extérieur par de longues distances de transmission. Ce projet est motivé par les raisons décrites antérieurement, il se veut un étude sur la viabilité des transcepteurs sans fil à large bande capables de régulariser la déficience de rang du canal sans fil. On vise le développement des techniques capables de séparer M signaux co-canal, même avec une seule antenne et à faire une estimation précise du canal. Les solutions décrites dans ce document cherchent à surmonter les difficultés posées par le medium aux transcepteurs sans fil à large bande. Le résultat de cette étude est un algorithme transcepteur approprié aux systèmes MIMO à rang déficient

An Unsupervised Cluster: Learning Water Customer Behavior Using Variation of Information on a Reconstructed Phase Space

The unsupervised clustering algorithm described in this dissertation addresses the need to divide a population of water utility customers into groups based on their similarities and differences, using only the measured flow data collected by water meters. After clustering, the groups represent customers with similar consumption behavior patterns and provide insight into ‘normal’ and ‘unusual’ customer behavior patterns. This research focuses upon individually metered water utility customers and includes both residential and commercial customer accounts serviced by utilities within North America. The contributions of this dissertation not only represent a novel academic work, but also solve a practical problem for the utility industry. This dissertation introduces a method of agglomerative clustering using information theoretic distance measures on Gaussian mixture models within a reconstructed phase space. The clustering method accommodates a utility’s limited human, financial, computational, and environmental resources. The proposed weighted variation of information distance measure for comparing Gaussian mixture models places emphasis upon those behaviors whose statistical distributions are more compact over those behaviors with large variation and contributes a novel addition to existing comparison options

Road Estimation Using GPS Traces and Real Time Kinematic Data

Advance Driver Assistance System (ADAS) are becoming the main issue in today’s automotive industry. The new generation of ADAS aims at focusing on more details and obtaining more accuracy. To achieve this objective, the research and development parts of the automobile industry intend to utilize Global Positioning System (GPS) by integrating it with other existing tools in ADAS. There are several driving assistance systems which are served by a digital map as a primary or a secondary sensor. The traditional techniques of digital map generation are expensive and time consuming and require extensive manual effort. Therefore, having frequently updated maps is an issue. Furthermore, the existing commercial digital maps are not highly accurate. This Master thesis presents several algorithms for automatically converting raw Universal Serial Bus (USB)-GPS and Real Time Kinematic (RTK) GPS traces into a routable road network. The traces are gathered by driving 20 times on a highway. This work begins by pruning raw GPS traces using four different algorithms. The first step tries to minimize the number of outliers. After the traces are smoothed, they tend to consolidate into smooth paths. So in order to merge all 20 trips together and estimate the road network a Trace Merging algorithm is applied. Finally, a Non-Uniform Rational B-Spline (NURBS) curve is implemented as an approximation curve to smooth the road shape and decrease the effect of noisy data further. Since the RTK-GPS receiver provides highly accurate data, the curve resulted from its GPS data is the most sufficient road shape. Therefore, it is used as a ground truth to compare the result of each pruning algorithm based on data from USB-GPS. Lastly, the results of this work are demonstrated and a quality evaluation is done for all methods