Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510370
C. Fritsche, A. Klein
While in outdoor scenarios the global positioning system (GPS) provides accurate mobile station (MS) location estimates in the majority of cases, in dense urban and indoor scenarios GPS often cannot provide reliable MS location estimates, due to the attenuation or complete shadowing of the satellite signals. The existing cellular radio network (CRN)-based localization methods, however, provide MS location estimates in almost every scenario, but they do not reach the accuracy of the MS location estimates provided by GPS. Hybrid localization methods combine MS location information available from measured values of the CRN with MS location information provided by the measured values of GPS. In this paper, a hybrid localization method is proposed that combines received signal level and timing advance measured values from the global system for mobile communication (GSM) and time of arrival measured values from GPS. The best achievable localization accuracy of the proposed hybrid localization method is evaluated in terms of the Cramer-Rao Lower Bound. It is shown that the hybrid localization method significantly improves the localization accuracy compared to existing CRN-based localization methods.
{"title":"Cramér-Rao Lower Bounds for hybrid localization of mobile terminals","authors":"C. Fritsche, A. Klein","doi":"10.1109/WPNC.2008.4510370","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510370","url":null,"abstract":"While in outdoor scenarios the global positioning system (GPS) provides accurate mobile station (MS) location estimates in the majority of cases, in dense urban and indoor scenarios GPS often cannot provide reliable MS location estimates, due to the attenuation or complete shadowing of the satellite signals. The existing cellular radio network (CRN)-based localization methods, however, provide MS location estimates in almost every scenario, but they do not reach the accuracy of the MS location estimates provided by GPS. Hybrid localization methods combine MS location information available from measured values of the CRN with MS location information provided by the measured values of GPS. In this paper, a hybrid localization method is proposed that combines received signal level and timing advance measured values from the global system for mobile communication (GSM) and time of arrival measured values from GPS. The best achievable localization accuracy of the proposed hybrid localization method is evaluated in terms of the Cramer-Rao Lower Bound. It is shown that the hybrid localization method significantly improves the localization accuracy compared to existing CRN-based localization methods.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123126011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510373
N. Deblauwe, G. Treu
For realizing proactive Location-based Services it is necessary to automatically detect when the mobile device enters or leaves certain geographical zones. Assuming terminal-based positioning like GPS, in a rudimentary approach this can be realized by continuous operation of the GPS receiver, where the generated position fixes are always checked against the zone definition. However, as GPS is very energy-consuming, this will lead to a quick battery drain and thus to a bad user experience. As a possible solution, this paper presents a novel technique which dynamically switches on and off the GPS receiver. The goal is to keep the GPS receiver off as long as possible in order to save energy, while still being able to detect the entering or leaving of a zone. The basic idea is to compare the device's current GSM measurements with the ones taken the last time the GPS was switched on. If, based on that comparison, it can be ruled out that the zone has been entered or left, the GPS receiver may remain switched off. For comparing GSM readings, the classical Common Base Station indicator is extended by considering multiple samples and incorporating values of Received Signal Strength. The paper presents results based on simulated as well as real test data, which underline the validity of the method.
{"title":"Hybrid GPS and GSM localization — energy-efficient detection of spatial triggers","authors":"N. Deblauwe, G. Treu","doi":"10.1109/WPNC.2008.4510373","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510373","url":null,"abstract":"For realizing proactive Location-based Services it is necessary to automatically detect when the mobile device enters or leaves certain geographical zones. Assuming terminal-based positioning like GPS, in a rudimentary approach this can be realized by continuous operation of the GPS receiver, where the generated position fixes are always checked against the zone definition. However, as GPS is very energy-consuming, this will lead to a quick battery drain and thus to a bad user experience. As a possible solution, this paper presents a novel technique which dynamically switches on and off the GPS receiver. The goal is to keep the GPS receiver off as long as possible in order to save energy, while still being able to detect the entering or leaving of a zone. The basic idea is to compare the device's current GSM measurements with the ones taken the last time the GPS was switched on. If, based on that comparison, it can be ruled out that the zone has been entered or left, the GPS receiver may remain switched off. For comparing GSM readings, the classical Common Base Station indicator is extended by considering multiple samples and incorporating values of Received Signal Strength. The paper presents results based on simulated as well as real test data, which underline the validity of the method.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129278882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510355
Z. Dai, S. Knedlik, O. Loffeld
A real-time algorithm to detect and determine the cycle-slips for multi-frequency GNSS is proposed. The cycle-slip detection is achieved by constructing two geometry-free combinations of carrier phases. Several criteria are established to assess the performance of these combinations in order to achieve better detection sensitivity. Considering the similarity in the integer nature of cycle-slip and phase ambiguity, we apply the LAMBDA technique to quantify the size of each slip. Some tests based on a GPS simulator have been carried out and the results are given to show the performance of the entire algorithm.
{"title":"Real-time cycle-slip detection and determination for multiple frequency GNSS","authors":"Z. Dai, S. Knedlik, O. Loffeld","doi":"10.1109/WPNC.2008.4510355","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510355","url":null,"abstract":"A real-time algorithm to detect and determine the cycle-slips for multi-frequency GNSS is proposed. The cycle-slip detection is achieved by constructing two geometry-free combinations of carrier phases. Several criteria are established to assess the performance of these combinations in order to achieve better detection sensitivity. Considering the similarity in the integer nature of cycle-slip and phase ambiguity, we apply the LAMBDA technique to quantify the size of each slip. Some tests based on a GPS simulator have been carried out and the results are given to show the performance of the entire algorithm.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124887521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510360
S. Korkmaz, A. V. D. Veen
Efficient multipath time delay estimation is of great importance for positioning with Ultra-Wide-Band signals in indoor environments. In dense multipath environments a simple assumption is to model the multipath terms as attenuated and delayed copies of a known waveform. A more realistic model is however the scenario where the pulse shape is different for every multipath term due to scattering effects and the directionality of the antennas. For the purposes of positioning we face three problems. Signal detection, time delay estimation of the strongest path, and leading edge detection. Leading edge detection is necessary since the strongest path may not be the first. We apply Maximum Likelihood Estimation and Generalized Likelihood Ratio Tests to these problems. In the case of a known pulse shape this leads to the well known matched filter. In the case of unknown pulse shape we show that the matched subspace filter is the optimal solution. Another significant property of the matched subspace filter is that it does not require Nyquist rate sampling. Beyond these advantages, the matched subspace filter is not computationally demanding. Finally we discuss various leading edge detection methoods like generalized likelihood rule (GLR) and energy detectors.
{"title":"Time delay estimation in dense multipath with matched subspace filters","authors":"S. Korkmaz, A. V. D. Veen","doi":"10.1109/WPNC.2008.4510360","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510360","url":null,"abstract":"Efficient multipath time delay estimation is of great importance for positioning with Ultra-Wide-Band signals in indoor environments. In dense multipath environments a simple assumption is to model the multipath terms as attenuated and delayed copies of a known waveform. A more realistic model is however the scenario where the pulse shape is different for every multipath term due to scattering effects and the directionality of the antennas. For the purposes of positioning we face three problems. Signal detection, time delay estimation of the strongest path, and leading edge detection. Leading edge detection is necessary since the strongest path may not be the first. We apply Maximum Likelihood Estimation and Generalized Likelihood Ratio Tests to these problems. In the case of a known pulse shape this leads to the well known matched filter. In the case of unknown pulse shape we show that the matched subspace filter is the optimal solution. Another significant property of the matched subspace filter is that it does not require Nyquist rate sampling. Beyond these advantages, the matched subspace filter is not computationally demanding. Finally we discuss various leading edge detection methoods like generalized likelihood rule (GLR) and energy detectors.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116222112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510385
G. Destino, G. Abreu
Wireless sensor networks (WSNs) are considered an adequate solutions for environmental monitoring and surveillance applications, where the physical presence of humans is impossible or costly. In the next future, it is foreseen that nodes will be part of a localization system, that will be able to estimate their locations, aiding the coordination for the most consuming activities such as relaying and routing. However, in some particular conditions, it is useful to know only logical information about the node locations and, specifically it would be sufficient to know if they are in the inner part or at the boundary of the network. In this paper we propose a technique for the identification of nodes at the network boundary, based solely on connectivity information, assumed to be available at a central unit The algorithm is a useful network management tool as it allows one (the central unit) to detect the formation or existence of topological holes, enabling corrective measures such as redeployment in affected areas or warning dead-end nodes of their condition. Since connectivity information is learned overtime by the network sinks (and the coordinator to which they are connected to), the proposed network boundary discovery algorithm incurs no additional cost to the network at steady state of operation. The algorithm is based on a spectral graph clusterization technique, which first tessellates the network in small cells that circumvent (eventual) connectivity holes. Then, the border nodes of each cluster are identified using beetweness centrality scores and clusters are classified by their adjacencies. Since nodes located simultaneously at the boundary of adjacent clusters are obviously not at the border of a hole, the procedure allows the identification of nodes that are exclusively at the boundary of one cluster, ultimately yielding the collection of nodes at the boundaries of the network in general.
{"title":"Network boundary recognition via graph-theory","authors":"G. Destino, G. Abreu","doi":"10.1109/WPNC.2008.4510385","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510385","url":null,"abstract":"Wireless sensor networks (WSNs) are considered an adequate solutions for environmental monitoring and surveillance applications, where the physical presence of humans is impossible or costly. In the next future, it is foreseen that nodes will be part of a localization system, that will be able to estimate their locations, aiding the coordination for the most consuming activities such as relaying and routing. However, in some particular conditions, it is useful to know only logical information about the node locations and, specifically it would be sufficient to know if they are in the inner part or at the boundary of the network. In this paper we propose a technique for the identification of nodes at the network boundary, based solely on connectivity information, assumed to be available at a central unit The algorithm is a useful network management tool as it allows one (the central unit) to detect the formation or existence of topological holes, enabling corrective measures such as redeployment in affected areas or warning dead-end nodes of their condition. Since connectivity information is learned overtime by the network sinks (and the coordinator to which they are connected to), the proposed network boundary discovery algorithm incurs no additional cost to the network at steady state of operation. The algorithm is based on a spectral graph clusterization technique, which first tessellates the network in small cells that circumvent (eventual) connectivity holes. Then, the border nodes of each cluster are identified using beetweness centrality scores and clusters are classified by their adjacencies. Since nodes located simultaneously at the boundary of adjacent clusters are obviously not at the border of a hole, the procedure allows the identification of nodes that are exclusively at the boundary of one cluster, ultimately yielding the collection of nodes at the boundaries of the network in general.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117218501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510380
Oh-Heum Kwon, Ha-Joo Song
In localization algorithms following the "patch-and-stitch" strategy, the network is divided into small overlapping subregions. For each subregion, the algorithm builds a local structure called a patch which is actually an embedding of the nodes it spans in a relative coordinate system. Then, the patches are stitched together to form a single global map. In this class of algorithms, the stitching order makes a great influence on the performance of the algorithm. In this paper, we present a formal framework to deal with stitching orders. In our framework, each stitching scheme consists of a stitching policy and a potential function. The potential function is to predict how well a patch will be stitched if patches are stitched according to a given partial order. The stitching policy is a mechanism that determines the stitching order based on the predictions by the potential function. We present various stitching schemes and evaluate their performances though simulations.
{"title":"Stitching orders in patch-and-stitch localization algorithms for wireless sensor networks","authors":"Oh-Heum Kwon, Ha-Joo Song","doi":"10.1109/WPNC.2008.4510380","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510380","url":null,"abstract":"In localization algorithms following the \"patch-and-stitch\" strategy, the network is divided into small overlapping subregions. For each subregion, the algorithm builds a local structure called a patch which is actually an embedding of the nodes it spans in a relative coordinate system. Then, the patches are stitched together to form a single global map. In this class of algorithms, the stitching order makes a great influence on the performance of the algorithm. In this paper, we present a formal framework to deal with stitching orders. In our framework, each stitching scheme consists of a stitching policy and a potential function. The potential function is to predict how well a patch will be stitched if patches are stitched according to a given partial order. The stitching policy is a mechanism that determines the stitching order based on the predictions by the potential function. We present various stitching schemes and evaluate their performances though simulations.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115506701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510367
M. Raitoharju, Niilo Sirola, S. Ali-Löytty, R. Piché
PNaFF (personal navigation filter framework) is a comprehensive simulation and filtering test bench that is being developed within the Personal Positioning Research Group at the Department of Mathematics of Tampere University of Technology. Hybrid positioning is a process where measurements from different sources are used to obtain position estimate. PNaFF provides tools for comparison and visualization of the performance of hybrid positioning filters that estimate the current state from measurements and the previous state estimate. New filters can be added to PNaFF easily and the performance of the new filter can be assessed instantly. Different kinds of measurements can be used in estimation, and it is simple to add new measurement types.
{"title":"PNaFF: A modular software platform for testing hybrid position estimation algorithms","authors":"M. Raitoharju, Niilo Sirola, S. Ali-Löytty, R. Piché","doi":"10.1109/WPNC.2008.4510367","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510367","url":null,"abstract":"PNaFF (personal navigation filter framework) is a comprehensive simulation and filtering test bench that is being developed within the Personal Positioning Research Group at the Department of Mathematics of Tampere University of Technology. Hybrid positioning is a process where measurements from different sources are used to obtain position estimate. PNaFF provides tools for comparison and visualization of the performance of hybrid positioning filters that estimate the current state from measurements and the previous state estimate. New filters can be added to PNaFF easily and the performance of the new filter can be assessed instantly. Different kinds of measurements can be used in estimation, and it is simple to add new measurement types.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"52 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132772616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510379
H. Qasem, O. Gorgis, L. Reindl
This paper presents a developed inertial navigation multi sensor node, along with an efficient calibration technique to improve the accuracy of the measurement acquired from a set of inertial sensors and magnetic encoder. The implemented node consists of a high resolution magnetic compass sensor, a distance sensor works as magnetic encoder, an accelerometer and a gyroscope to detect the linear and angular acceleration. The node is installed on an autonomous mobile vehicle as part of an inertial system to find the real-time position and direction of the vehicle. RF wireless transceivers and a microcontroller are installed to process and to send the measured data wireless to a central processing unit for more processing and evaluation. The whole hardware and software design of the system is presented. Accuracy and calibrations issues are also discussed. Errors caused by bias, scale factors and nonlinearities in the sensor readings which cause accumulations in navigation errors with time are considered.
{"title":"Design and calibration of an inertial sensor system for precise vehicle navigation","authors":"H. Qasem, O. Gorgis, L. Reindl","doi":"10.1109/WPNC.2008.4510379","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510379","url":null,"abstract":"This paper presents a developed inertial navigation multi sensor node, along with an efficient calibration technique to improve the accuracy of the measurement acquired from a set of inertial sensors and magnetic encoder. The implemented node consists of a high resolution magnetic compass sensor, a distance sensor works as magnetic encoder, an accelerometer and a gyroscope to detect the linear and angular acceleration. The node is installed on an autonomous mobile vehicle as part of an inertial system to find the real-time position and direction of the vehicle. RF wireless transceivers and a microcontroller are installed to process and to send the measured data wireless to a central processing unit for more processing and evaluation. The whole hardware and software design of the system is presented. Accuracy and calibrations issues are also discussed. Errors caused by bias, scale factors and nonlinearities in the sensor readings which cause accumulations in navigation errors with time are considered.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132881904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510371
B. Lamprecht, S. Rass, Simone Fuchs, K. Kyamakya
We present a general method to measure the distance to arbitrary static points from a fairly straight moving camera in the context of highways. We assume that the speed of the camera and vehicle, respectively, can be obtained somehow on board. The proposed approach does not require a calibrated camera and there is no need for an auto-calibration step to determine the cameras intrinsics on-line. To measure the distance to a point it is sufficient to track the point three times over a certain period of time and incorporate the vehicle's velocity. The system does not rely upon principal point and FOE - Focus of Expansion - information.
{"title":"Fusion of an uncalibrated camera with velocity information for distance measurement from a moving camera on highways","authors":"B. Lamprecht, S. Rass, Simone Fuchs, K. Kyamakya","doi":"10.1109/WPNC.2008.4510371","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510371","url":null,"abstract":"We present a general method to measure the distance to arbitrary static points from a fairly straight moving camera in the context of highways. We assume that the speed of the camera and vehicle, respectively, can be obtained somehow on board. The proposed approach does not require a calibrated camera and there is no need for an auto-calibration step to determine the cameras intrinsics on-line. To measure the distance to a point it is sufficient to track the point three times over a certain period of time and incorporate the vehicle's velocity. The system does not rely upon principal point and FOE - Focus of Expansion - information.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-03-27DOI: 10.1109/WPNC.2008.4510372
B. Krach, M. Lentmaier, P. Robertson
A sequential Bayesian estimation algorithm for joint positioning and multipath mitigation in global navigation satellite systems is presented, with an underlying process model that is especially designed for dynamic user scenarios and dynamic channel conditions. In order to facilitate efficient integration into receivers it builds upon complexity reduction concepts that previously have been applied within maximum likelihood estimators. To demonstrate its capabilities simulation results are presented.
{"title":"Bayesian detection and tracking for joint positioning and multipath mitigation in GNSS","authors":"B. Krach, M. Lentmaier, P. Robertson","doi":"10.1109/WPNC.2008.4510372","DOIUrl":"https://doi.org/10.1109/WPNC.2008.4510372","url":null,"abstract":"A sequential Bayesian estimation algorithm for joint positioning and multipath mitigation in global navigation satellite systems is presented, with an underlying process model that is especially designed for dynamic user scenarios and dynamic channel conditions. In order to facilitate efficient integration into receivers it builds upon complexity reduction concepts that previously have been applied within maximum likelihood estimators. To demonstrate its capabilities simulation results are presented.","PeriodicalId":277539,"journal":{"name":"2008 5th Workshop on Positioning, Navigation and Communication","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134014101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：