Cramer-Rao bound for channel parameters in ultra-wide band based system

Deleuze, A.-L.; Martret, C. Le; Ciblat, Philippe; Serpedin, Erchin

doi:10.1109/spawc.2004.1439220

Cited by 9 publications

(7 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…random vector whose each component is a Bernoulli random variable with parameter p = 1/N c [14]. Hence, C k u,u (q) is a binomial random variable depending on k and on α (u ) .…”

Section: B Sketch Of Proof Of Theoremmentioning

confidence: 99%

Multi-Rate Resource Allocations for TH-UWB Wireless Communications

Mary

Fijalkow

Poulliat³

2012

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-In this paper, we are interested in resource allocation strategies for wireless time-hopping ultra-wide band (TH-UWB) communications with multiple rate capabilities between users. Multiple rates are achieved by assigning different processing gains, i.e. N f , to users. For this purpose, the multiple-access interference (MAI) variance accounting for multi-rate is needed. It is a challenging task due to the lack of a suitable closedform expression for the MAI variance in a multi-rate context. We further study the multi-rate resource allocation problem in uplink TH-UWB systems for which an optimal search cannot be envisaged due to the exponential complexity induced. Our contribution lies in three-fold: i) A new intercode correlation expression accounting for multi-rate communications is derived, and the variance of the MAI averaging over the codes is obtained.ii) The multi-rate resource allocation problem is tackled by relaxing the integer constraint on the processing gains and modeled via a signomial programming problem. iii) Based on this, a branch and bound (BB) algorithm is derived for the allocation of the processing gains in TH-UWB systems. We also propose a really simple heuristic with linear complexity for the N f allocation. We show that the algorithm proposed outperforms the BB algorithm in average throughput and average starvation rate 1 .

show abstract

“…random vector whose each component is a Bernoulli random variable with parameter p = 1/N c [14]. Hence, C k u,u (q) is a binomial random variable depending on k and on α (u ) .…”

Section: B Sketch Of Proof Of Theoremmentioning

confidence: 99%

Multi-Rate Resource Allocations for TH-UWB Wireless Communications

Mary

Fijalkow

Poulliat³

2012

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…One special case of interest is to set all entries of to zero except for the th entry, i.e., and if . Using the associated optimal for (19), the constructed 's by (16) reduce the ranging energy of beacon to its minimal possible value with the RSP constraint satisfied.…”

Section: B Sensor and Beacon Ranging Energy Optimization Problemsmentioning

confidence: 99%

“…In general, no closed-form solution exists for (19). Nevertheless, is equivalent to the LMI , and, thus, (19) actually belongs to the class of SDP problems, which can be solved numerically with convex optimization techniques [49].…”

Section: B Sensor and Beacon Ranging Energy Optimization Problemsmentioning

confidence: 99%

Ranging Energy Optimization for Robust Sensor Positioning Based on Semidefinite Programming

Wang

Leus

Huang

2009

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Abstract-Sensor positioning is an important task of location-aware wireless sensor networks. In most sensor positioning systems, sensors and beacons need to emit ranging signals to each other. Sensor ranging energy should be low to prolong system lifetime, but sufficiently high to fulfill prescribed accuracy requirements. This motivates us to investigate ranging energy optimization problems. We address ranging energy optimization for an unsynchronized positioning system, which features robust sensor positioning (RSP) in the sense that a specific accuracy requirement is fulfilled within a prescribed service area. We assume a line-of-sight (LOS) channel exists between the sensor and each beacon. The positioning is implemented by time-of-arrival (TOA) based two-way ranging between a sensor and beacons, followed by a location estimation at a central processing unit. To establish a dependency between positioning accuracy and ranging energy, we assume the adopted TOA and location estimators are unbiased and attain the associated Cramér-Rao bound. The accuracy requirement has the same form as the one defined by the Federal Communication Commission (FCC), and we present two constraints with linear-matrix-inequality form for the RSP. Ranging energy optimization problems, as well as a practical algorithm based on semidefinite programming are proposed. The effectiveness of the algorithm is illustrated by numerical experiments.Index Terms-Cramér-Rao bound, localization, semidefinite programming, wireless sensor networks.

show abstract

“…in (20) can be obtained 18 . Then, the limit of as can be calculated, after some manipulation, as in Proposition 1.…”

Section: A Proof Of Propositionmentioning

confidence: 99%

“…However, in the movement estimation problem, the main parameters to be estimated are related to the time varying multipath components only, and the other channel parameters such as the channel coefficients and delays (corresponding to other multipath components) are all considered as nuisance parameters. On the other hand, the channel estimation problem [19], [20], [22] considers channel coefficients and delays as the main parameters to be estimated. In addition, the observation interval in a movement estimation problem is considerably larger than that in a channel estimation problem.…”

Section: Introductionmentioning

confidence: 99%

Theoretical Limits for Estimation of Periodic Movements in Pulse-Based UWB Systems

Gezici

2007

IEEE J. Sel. Top. Signal Process.

View full text Add to dashboard Cite

Abstract-In this paper, Cramer-Rao lower bounds (CRLBs) for estimation of signal parameters related to periodically moving objects in pulse-based ultra-wideband (UWB) systems are presented. The results also apply to estimation of vital parameters, such as respiration rate, using UWB signals. In addition to obtaining the CRLBs, suboptimal estimation algorithms are also presented. First, a single-path channel with additive white Gaussian noise is considered, and closed-form CRLB expressions are obtained for sinusoidal object movements. Also, a two-step suboptimal algorithm is proposed, which is based on time delay estimation via matched filtering followed by least-squares estimation, and its asymptotic optimality property is shown in the limit of certain system parameters. Then, a multipath environment is considered, and exact and approximate CRLB expressions are derived. Moreover, suboptimal schemes for parameter estimation are studied. Simulation studies are performed for the estimation of respiration rates in order to evaluate the lower bounds and performance of the suboptimal algorithms for realistic system parameters.Index Terms-Cramer-Rao lower bound (CRLB), estimation theory, impulse radio (IR), least-squares (LS) estimation, matched filtering, ultra-wideband (UWB).

show abstract

Cramer-Rao bound for channel parameters in ultra-wide band based system

Cited by 9 publications

References 13 publications

Multi-Rate Resource Allocations for TH-UWB Wireless Communications

Multi-Rate Resource Allocations for TH-UWB Wireless Communications

Ranging Energy Optimization for Robust Sensor Positioning Based on Semidefinite Programming

Theoretical Limits for Estimation of Periodic Movements in Pulse-Based UWB Systems

Contact Info

Product

Resources

About