Discrete Signal Reconstruction by Sum of Absolute Values

HANDLE オープンアクセス

この論文をさがす

説明

In this letter, we consider a problem of reconstructing an unknown discrete signal taking values in a finite alphabet from incomplete linear measurements. The difficulty of this problem is that the computational complexity of the reconstruction is exponential as it is. To overcome this difficulty, we extend the idea of compressed sensing, and propose to solve the problem by minimizing the sum of weighted absolute values. We assume that the probability distribution defined on an alphabet is known, and formulate the reconstruction problem as linear programming. Examples are shown to illustrate that the proposed method is effective.

収録刊行物

詳細情報 詳細情報について

  • CRID
    1050564285766886016
  • NII論文ID
    120005619769
  • NII書誌ID
    AA1099314X
  • ISSN
    10709908
  • HANDLE
    2433/198575
  • 本文言語コード
    en
  • 資料種別
    journal article
  • データソース種別
    • IRDB
    • CiNii Articles

問題の指摘

ページトップへ