IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i5p3595389.html
   My bibliography  Save this article

Distributed Channel-Aware Quantization Based on Maximum Mutual Information

Author

Listed:
  • Sahar Movaghati
  • Masoud Ardakani

Abstract

In distributed sensing systems with constrained communication capabilities, sensors' noisy measurements must be quantized locally before transmitting to the fusion centre. When the same parameter is observed by a number of sensors, the local quantization rules must be jointly designed to optimize a global objective function. In this work we jointly design the local quantizers by maximizing the mutual information as the optimization criterion, so that the quantized measurements carry the most information about the unknown parameter. A low-complexity iterative approach is suggested for finding the local quantization rules. Using the mutual information as the design criterion, we can easily integrate the effect of communication channels in the design and consequently design channel-aware quantization rules. We observe that the optimal design depends on both the measurement and channel noises. Moreover, our algorithm can be used to design quantizers that can be deployed in different applications. We demonstrate the success of our technique through simulating estimation and detection applications, where our method achieves estimation and detection errors as low as when designing for those special purposes.

Suggested Citation

  • Sahar Movaghati & Masoud Ardakani, 2016. "Distributed Channel-Aware Quantization Based on Maximum Mutual Information," International Journal of Distributed Sensor Networks, , vol. 12(5), pages 3595389-359, May.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:5:p:3595389
    DOI: 10.1155/2016/3595389
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/3595389
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/3595389?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:12:y:2016:i:5:p:3595389. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.