DocumentCode :
2299913
Title :
Weighted Euclidean superimposed codes for integer compressed sensing
Author :
Dai, Wei ; Milenkovic, Olgica
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL
fYear :
2008
fDate :
5-9 May 2008
Firstpage :
124
Lastpage :
128
Abstract :
We introduce a new family of codes, termed weighted Euclidean superimposed codes (WESCs). This family generalizes the class of Euclidean superimposed codes, used in multiuser identification systems. WESCs allow for discriminating bounded, integer-valued linear combinations of real-valued codewords, and can therefore also be seen as a specialization of compressed sensing schemes. We present lower and upper bounds on the largest size of a member of the WESCs family, and show how to use classical coding-theoretic and new compressed sensing analytical tools to devise low-complexity decoding algorithms for these codes.
Keywords :
codes; computational complexity; decoding; probability; signal sampling; bounded integer-valued linear combination; integer compressed sensing; low-complexity decoding algorithm; multiuser identification system; probabilistic method; real-valued codeword; signal sampling method; weighted Euclidean superimposed code; Algorithm design and analysis; Compressed sensing; Databases; Decoding; Discrete transforms; Euclidean distance; Information retrieval; RNA; Upper bound; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2008. ITW '08. IEEE
Conference_Location :
Porto
Print_ISBN :
978-1-4244-2269-2
Electronic_ISBN :
978-1-4244-2271-5
Type :
conf
DOI :
10.1109/ITW.2008.4578635
Filename :
4578635
Link To Document :
بازگشت