Fast Sparse Superposition Codes Have Near Exponential Error Probability for R < C

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 60; no. 2; pp. 919 - 942
Main Authors:	JOSEPH, Antony, BARRON, Andrew R
Format:	Journal Article
Language:	English
Published:	New York, NY Institute of Electrical and Electronics Engineers 01.02.2014
Subjects:	Applied sciences Coding, codes Detection, estimation, filtering, equalization, prediction Exact sciences and technology Information theory Information, signal and communications theory Sampling, quantization Signal and communications theory Signal, noise Telecommunications and information theory Multiuser detection successive cancelation decoding subset selection Channel capacity Error probability error exponents greedy algorithms Gaussian channel Iterative method Adaptive decoding orthogonal matching pursuit Maximum likelihood decoding AWGN channels achieving channel capacity Selection problem Matching pursuit Greedy algorithm Fast algorithm Signal detection Compressed sensing
ISSN:	0018-9448
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!