15,458 research outputs found

    A reduced-complexity and asymptotically efficient time-delay estimator

    Get PDF
    This paper considers the problem of estimating the time delays of multiple replicas of a known signal received by an array of antennas. Under the assumptions that the noise and co-channel interference (CCI) are spatially colored Gaussian processes and that the spatial signatures are arbitrary, the maximum likelihood (ML) solution to the general time delay estimation problem is derived. The resulting criterion for the delays yields consistent and asymptotically efficient estimates. However, the criterion is highly non-linear, and not conducive to simple minimization procedures. We propose a new cost function that is shown to provide asymptotically efficient delay estimates. We also outline a heuristic way of deriving this cost function. The form of this new estimator lends itself to minimization by the computationally attractive iterative quadratic maximum likelihood (IQML) algorithm. The existence of simple yet accurate initialization schemes based on ESPRIT and identity weightings makes the approach viable for practical implementation.Peer ReviewedPostprint (published version

    Bibliographic Review on Distributed Kalman Filtering

    Get PDF
    In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area

    A polynomial rooting approach for synchronization in multipath channels using antenna arrays

    Get PDF
    The estimation of the delay of a known training signal received by an antenna array in a multipath channel is addressed. The effect of the co-channel interference is taken into account by including a term with unknown spatial correlation. The channel is modeled as an unstructured FIR filter. The exact maximum likelihood (ML) solution for this problem is derived, but it does not have a simple dependence on the delay. An approximate estimator that is asymptotically equivalent to the exact one is presented. Using an appropriate reparameterization, it is shown that the delay estimate is obtained by rooting a low-order polynomial, which may be of interest in applications where fast feedforward synchronization is needed.Peer ReviewedPostprint (published version

    Design Guidelines for Training-based MIMO Systems with Feedback

    Full text link
    In this paper, we study the optimal training and data transmission strategies for block fading multiple-input multiple-output (MIMO) systems with feedback. We consider both the channel gain feedback (CGF) system and the channel covariance feedback (CCF) system. Using an accurate capacity lower bound as a figure of merit, we investigate the optimization problems on the temporal power allocation to training and data transmission as well as the training length. For CGF systems without feedback delay, we prove that the optimal solutions coincide with those for non-feedback systems. Moreover, we show that these solutions stay nearly optimal even in the presence of feedback delay. This finding is important for practical MIMO training design. For CCF systems, the optimal training length can be less than the number of transmit antennas, which is verified through numerical analysis. Taking this fact into account, we propose a simple yet near optimal transmission strategy for CCF systems, and derive the optimal temporal power allocation over pilot and data transmission.Comment: Submitted to IEEE Trans. Signal Processin

    Cramer-Rao bounds in the estimation of time of arrival in fading channels

    Get PDF
    This paper computes the Cramer-Rao bounds for the time of arrival estimation in a multipath Rice and Rayleigh fading scenario, conditioned to the previous estimation of a set of propagation channels, since these channel estimates (correlation between received signal and the pilot sequence) are sufficient statistics in the estimation of delays. Furthermore, channel estimation is a constitutive block in receivers, so we can take advantage of this information to improve timing estimation by using time and space diversity. The received signal is modeled as coming from a scattering environment that disperses the signal both in space and time. Spatial scattering is modeled with a Gaussian distribution and temporal dispersion as an exponential random variable. The impact of the sampling rate, the roll-off factor, the spatial and temporal correlation among channel estimates, the number of channel estimates, and the use of multiple sensors in the antenna at the receiver is studied and related to the mobile subscriber positioning issue. To our knowledge, this model is the only one of its kind as a result of the relationship between the space-time diversity and the accuracy of the timing estimation.Peer ReviewedPostprint (published version

    Array signal processing for maximum likelihood direction-of-arrival estimation

    Get PDF
    Emitter Direction-of-Arrival (DOA) estimation is a fundamental problem in a variety of applications including radar, sonar, and wireless communications. The research has received considerable attention in literature and numerous methods have been proposed. Maximum Likelihood (ML) is a nearly optimal technique producing superior estimates compared to other methods especially in unfavourable conditions, and thus is of significant practical interest. This paper discusses in details the techniques for ML DOA estimation in either white Gaussian noise or unknown noise environment. Their performances are analysed and compared, and evaluated against the theoretical lower bounds
    • …
    corecore