Ontology type: schema:ScholarlyArticle Open Access: True
2018-12
AUTHORSAbdellah Chehri, Paul Fortier, Pierre-Martin Tardif
ABSTRACTExtracting parameter estimates from noisy observations of an underlying signal is a common problem in many fields. Time delay estimation (TDE) is essential for many areas, such as localization, array processing, and radar. The performance of any estimator is often evaluated via the mean square error (MSE) that can then be compared to analytical MSE lower bounds. In this paper, we first analyze a maximum likelihood (ML) estimator based on the knowledge of noisy second order statistics of the channel. We investigate lower bounds for the time delay estimation error for ultra-wideband ranging systems operating in realistic multipath environments. Based on the Cramer-Rao lower bound (CRLB), we derive analytically a lower bound of the time delay estimation calculated using the Karhunen–Loève decomposition of the estimated channel autocorrelation matrix. Also, we investigate the practical implementation (based on energy detection) of the time delay estimator. In the second part of the paper, we have analyzed the time delay estimation performances with the energy maximization receiver. Simulations are evaluated using a simulated UWB underground mine channel. This can be considered as the first step for a global positioning system for use mining industry. More... »
PAGES284
http://scigraph.springernature.com/pub.10.1186/s13638-018-1306-z
DOIhttp://dx.doi.org/10.1186/s13638-018-1306-z
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1110518232
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0906",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Electrical and Electronic Engineering",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/09",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Engineering",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "University of Quebec",
"id": "https://www.grid.ac/institutes/grid.265695.b",
"name": [
"University Ottawa, 800 King Edward Avenue, K1N 6N5, Ottawa, ON, Canada",
"Department of Applied Sciences, University of Quebec in Chicoutimi (UQAC), 555, boul. de l\u2019Universit\u00e9, G7H 2B1, Chicoutimi, QC, Canada"
],
"type": "Organization"
},
"familyName": "Chehri",
"givenName": "Abdellah",
"id": "sg:person.014306625077.80",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014306625077.80"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Universit\u00e9 Laval",
"id": "https://www.grid.ac/institutes/grid.23856.3a",
"name": [
"Department of Electrical and Computer Engineering, Laval University, G1V 0A6, Quebec, QC, Canada"
],
"type": "Organization"
},
"familyName": "Fortier",
"givenName": "Paul",
"id": "sg:person.015070214446.22",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015070214446.22"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Universit\u00e9 de Sherbrooke",
"id": "https://www.grid.ac/institutes/grid.86715.3d",
"name": [
"Sherbrooke University, 2500, boul. de l\u2019Universit\u00e9, J1K 2R1, Sherbrooke, QC, Canada"
],
"type": "Organization"
},
"familyName": "Tardif",
"givenName": "Pierre-Martin",
"id": "sg:person.07774075277.17",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07774075277.17"
],
"type": "Person"
}
],
"citation": [
{
"id": "sg:pub.10.1007/s11277-010-0097-2",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1016004170",
"https://doi.org/10.1007/s11277-010-0097-2"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/t-wc.2008.070910",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061467785"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tie.2009.2015754",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061623732"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tie.2009.2038402",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061624311"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tmtt.2006.872044",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061707097"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tmtt.2008.923351",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061708151"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tmtt.2009.2035945",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061708575"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tsp.2013.2239643",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061803692"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tsp.2013.2251341",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061803762"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/tvt.2008.926071",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061819833"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/twc.2010.120610.091659",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061827536"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/pimrc.2006.254399",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1093247409"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/ict.2014.6845077",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1093694755"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/icosp.2012.6491562",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1094246724"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/icu.2006.281616",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1094767660"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/iccw.2014.6881288",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1094854369"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/spawc.2014.6941925",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1095483080"
],
"type": "CreativeWork"
}
],
"datePublished": "2018-12",
"datePublishedReg": "2018-12-01",
"description": "Extracting parameter estimates from noisy observations of an underlying signal is a common problem in many fields. Time delay estimation (TDE) is essential for many areas, such as localization, array processing, and radar. The performance of any estimator is often evaluated via the mean square error (MSE) that can then be compared to analytical MSE lower bounds. In this paper, we first analyze a maximum likelihood (ML) estimator based on the knowledge of noisy second order statistics of the channel. We investigate lower bounds for the time delay estimation error for ultra-wideband ranging systems operating in realistic multipath environments. Based on the Cramer-Rao lower bound (CRLB), we derive analytically a lower bound of the time delay estimation calculated using the Karhunen\u2013Lo\u00e8ve decomposition of the estimated channel autocorrelation matrix. Also, we investigate the practical implementation (based on energy detection) of the time delay estimator. In the second part of the paper, we have analyzed the time delay estimation performances with the energy maximization receiver. Simulations are evaluated using a simulated UWB underground mine channel. This can be considered as the first step for a global positioning system for use mining industry.",
"genre": "research_article",
"id": "sg:pub.10.1186/s13638-018-1306-z",
"inLanguage": [
"en"
],
"isAccessibleForFree": true,
"isPartOf": [
{
"id": "sg:journal.1050477",
"issn": [
"1687-1472",
"1687-1499"
],
"name": "EURASIP Journal on Wireless Communications and Networking",
"type": "Periodical"
},
{
"issueNumber": "1",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "2018"
}
],
"name": "Time delay estimation for UWB non coherent receiver in indoor environment, from theory to practice",
"pagination": "284",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"4fa43f0aaf1304a2cfa85f8f502f31724090cc2fb398befa5d5a9af09268f802"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1186/s13638-018-1306-z"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1110518232"
]
}
],
"sameAs": [
"https://doi.org/10.1186/s13638-018-1306-z",
"https://app.dimensions.ai/details/publication/pub.1110518232"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-11T08:21",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000291_0000000291/records_105771_00000000.jsonl",
"type": "ScholarlyArticle",
"url": "https://link.springer.com/10.1186%2Fs13638-018-1306-z"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1186/s13638-018-1306-z'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1186/s13638-018-1306-z'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1186/s13638-018-1306-z'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1186/s13638-018-1306-z'
This table displays all metadata directly associated to this object as RDF triples.
134 TRIPLES
21 PREDICATES
44 URIs
19 LITERALS
7 BLANK NODES