• DocumentCode
    3118507
  • Title

    Number of compressed measurements needed for noisy distributed compressed sensing

  • Author

    Park, Sangjun ; Lee, Heung-No

  • Author_Institution
    Sch. of Inf. & Commun., Gwangju Inst. of Sci. & Technol., Gwangju, South Korea
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    1648
  • Lastpage
    1651
  • Abstract
    In this paper, we consider a data collection network (DCN) system where sensors take samples and transmit them to a Fusion Center (FC). Signal correlation is modeled with signal sparseness. The number of compressed measurements which allows correct signal recovery at FC is investigated. This is done by studying the probability of signal recovery failure. The joint typical decoder (JT decoder) similar to the one proposed by Akcakaya and Tarokh is used to avoid dependence on particular choice of recovery routines. The following interesting results have been obtained: 1) The detection failure probability linearly converges to zero as the number of sensors increases. 2) The number of compressed measurements per sensor (PSM) needed for successful recovery converges to sparsity as the number of sensors increases.
  • Keywords
    codecs; compressed sensing; sensors; source coding; compressed measurements per sensor; data collection network system; decoder; detection failure probability; fusion center; noisy distributed compressed sensing; signal correlation; signal recovery failure; signal sparseness; Compressed sensing; Correlation; Decoding; Joints; Noise; Sensors; Upper bound; Compressed Sensing; Distributed Compressed Sensing; Distributed Source Coding; Joint Typicality;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6283555
  • Filename
    6283555