Iterative subspace pursuit decoding of weighted Euclidean superimposed codes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a new iterative algorithm, termed subspace pursuit (SP), for decoding of weighted Euclidean superimposed codes (WESCs). WESCs allow for unique identification of small subsets of codewords based on their superposition, and therefore can be viewed as a specialization of compressive sensing schemes. Motivated by various algorithms for compressive sensing reconstruction, we propose the SP algorithm that has both small computational complexity and high decoding accuracy. Our analysis shows that accurate decoding is guaranteed as long as the codeword matrix satisfies the restricted isometry property with a constant parameter. Also presented is an upper bound on the computational complexity of the algorithm.

Original languageEnglish (US)
Title of host publication2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
Pages402-407
Number of pages6
DOIs
StatePublished - Dec 29 2008
Event2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING - Lausanne, Switzerland
Duration: Sep 1 2008Sep 5 2008

Publication series

Name2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

Other

Other2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
CountrySwitzerland
CityLausanne
Period9/1/089/5/08

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Iterative subspace pursuit decoding of weighted Euclidean superimposed codes'. Together they form a unique fingerprint.

Cite this