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

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 60; číslo 2; s. 919 - 942
Hlavní autoři: JOSEPH, Antony, BARRON, Andrew R
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY Institute of Electrical and Electronics Engineers 01.02.2014
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
ISSN:0018-9448
DOI:10.1109/TIT.2013.2289865