Analog product codes decodable by linear programming

Avi Zanko*, Amir Leshem, Ephraim Zehavi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

In this paper, we present a new analog error correcting coding scheme for real valued signals that are corrupted by impulsive noise. This product code improvesDonoho's deterministic construction by using a probabilistic approach. More specifically, our construction corrects more errors than the Donoho matrices by allowing a vanishingly small probability of error (with the increase in block size). The problem of decoding the long block code is decoupled into two sets of parallel Linear Programming problems. This leads to a significant reduction in decoding complexity as compared to one-step Linear Programming decoding.

Original languageAmerican English
Article number6145516
Pages (from-to)509-518
Number of pages10
JournalIEEE Transactions on Information Theory
Volume58
Issue number2
DOIs
StatePublished - Feb 2012
Externally publishedYes

Keywords

  • Analog codes
  • Compressed sensing
  • Linear programming
  • Turbo decoding

Fingerprint

Dive into the research topics of 'Analog product codes decodable by linear programming'. Together they form a unique fingerprint.

Cite this