메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1772-1776

Analysis of fast sparse superposition codes

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL;

EID: 80054825877     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033853     Document Type: Conference Paper
Times cited : (6)

References (10)
  • 3
    • 77955680713 scopus 로고    scopus 로고
    • Toward fast reliable communication at rates near capacity with Gaussian noise
    • Austin, TX, June 13-18
    • A. R. Barron and A. Joseph, "Toward fast reliable communication at rates near capacity with Gaussian noise, Proc. IEEE Intern. Symp. Inform. Theory, Austin, TX, June 13-18, 2010.
    • (2010) Proc. IEEE Intern. Symp. Inform. Theory
    • Barron, A.R.1    Joseph, A.2
  • 4
    • 84867558041 scopus 로고    scopus 로고
    • Sparse superposition codes: Fast and reliable at rates approaching capacity with Gaussian noise
    • Available from
    • A. R. Barron and A. Joseph, "Sparse superposition codes: Fast and reliable at rates approaching capacity with Gaussian noise", Extended manuscript of this submission, 2011. Available from www.stat.yale.edu/?arb4/ publications.html
    • (2011) Extended Manuscript of This Submission
    • Barron, A.R.1    Joseph, A.2
  • 7
    • 0000796112 scopus 로고
    • A simple lemma for optimization in a Hilbert space, with application to projection pursuit and neural net training
    • L. Jones, "A simple lemma for optimization in a Hilbert space, with application to projection pursuit and neural net training", Annals of Statistics, vol. 20, pp. 608-613, 1992.
    • (1992) Annals of Statistics , vol.20 , pp. 608-613
    • Jones, L.1
  • 8
    • 0027842081 scopus 로고
    • Matching pursuit with time-frequency dictionaries
    • S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries. IEEE Trans. Signal Proc., vol. 41, pp. 3397-3415, 1993.
    • (1993) IEEE Trans. Signal Proc. , vol.41 , pp. 3397-3415
    • Mallat, S.1    Zhang, Z.2
  • 9
    • 33645712308 scopus 로고    scopus 로고
    • Just relax: Convex programming methods for identifying sparse signals in noise
    • Mar
    • J. Tropp, "Just relax: convex programming methods for identifying sparse signals in noise", IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.3 , pp. 1030-1051
    • Tropp, J.1
  • 10
    • 80054825017 scopus 로고    scopus 로고
    • Adaptive forward-backward greedy algorithm for learning sparse representations
    • Statistics Department, Rutgers University
    • T. Zhang, "Adaptive forward-backward greedy algorithm for learning sparse representations", Technical report, Statistics Department, Rutgers University. 2011.
    • (2011) Technical Report
    • Zhang, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.