• DocumentCode
    74176
  • Title

    Parameter Estimation From Quantized Observations in Multiplicative Noise Environments

  • Author

    Jiang Zhu ; Xiaokang Lin ; Blum, Rick S. ; Yuantao Gu

  • Author_Institution
    Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
  • Volume
    63
  • Issue
    15
  • fYear
    2015
  • fDate
    Aug.1, 2015
  • Firstpage
    4037
  • Lastpage
    4050
  • Abstract
    The problem of distributed parameter estimation from binary quantized observations is studied when the unquantized observations are corrupted by combined multiplicative and additive Gaussian noise. These results are applicable to sensor networks where the sensors observe a parameter in combined additive and nonadditive noise and to a case where dispersed receivers are employed with analog communication over fading channels where the receivers employ binary quantization before noise-free digital communications to a fusion center. We first discuss the case in which all the quantizers use an identical threshold. The parameter identifiability condition is given, and, surprisingly, it is shown that unless the common threshold is chosen properly and the parameter lies in an open interval, the parameter will not generally be identifiable, in contrast to the additive noise case. The best achievable mean square error (MSE) performance is characterized by deriving the corresponding Cramér-Rao Lower Bound (CRLB). A closed-form expression describing the corresponding maximum likelihood (ML) estimator is presented. The stability of the performance of the ML estimators is improved when a nonidentical threshold strategy is utilized to estimate the unknown parameter. The thresholds are designed by maximizing the minimum asymptotic relative efficiency (ARE) between quantized and unquantized ML estimators. Although the ML estimation problem is nonconvex, it is shown that one can relax the optimization to make it convex. The solution to the relaxed problem is used as an initial solution in a gradient algorithm to solve the original problem. Next, the case where both the variances of the additive noise and multiplicative noise are unknown is studied. The corresponding CRLB is obtained, and the ML estimation problem is transformed to a convex optimization, which can be solved efficiently. Finally, numerical simulations are performed to substantiate the theoretical analysis.
  • Keywords
    AWGN; fading channels; maximum likelihood estimation; mean square error methods; Cramer-Rao lower bound; ML estimators; additive Gaussian noise; asymptotic relative efficiency; binary quantized observations; closed-form expression; distributed parameter estimation; fading channels; maximum likelihood estimator; mean square error; multiplicative noise; sensor networks; Additive noise; Maximum likelihood estimation; Parameter estimation; Receivers; Wireless sensor networks; CRLB; multiplicative noise; parameter estimation; quantization;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/TSP.2015.2436359
  • Filename
    7111345