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

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 60; H. 2; S. 919 - 942
Hauptverfasser:	JOSEPH, Antony, BARRON, Andrew R
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY Institute of Electrical and Electronics Engineers 01.02.2014
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!