메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1147-1151

Reverse compute and forward: A low-complexity architecture for downlink distributed antenna systems

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNA TERMINALS; CENTRAL PROCESSORS; DISTRIBUTED ANTENNA SYSTEM; FINITE CAPACITY; LOW-COMPLEXITY ARCHITECTURE; MULTIPLE ACCESS; PRECODING SCHEME; RANK DEFICIENCY; RELAY NETWORK; SYSTEM MATRICES; SYSTEM MODELS; USER SELECTION; USER TERMINALS;

EID: 84867502452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283033     Document Type: Conference Paper
Times cited : (24)

References (11)
  • 3
    • 26844530579 scopus 로고    scopus 로고
    • A close-to-capacity dirty paper coding scheme
    • October
    • U. Erez and S. Ten Brink, "A close-to-capacity dirty paper coding scheme," IEEE Trans. on Inform. Theory, vol. 51, no. 10, pp. 3417-3432, October 2005.
    • (2005) IEEE Trans. on Inform. Theory , vol.51 , Issue.10 , pp. 3417-3432
    • Erez, U.1    Ten Brink, S.2
  • 4
    • 33646065637 scopus 로고    scopus 로고
    • Superposition coding for side-information channels
    • Shitz, October
    • A. Bennatan, D. Burshtein, G. Caire, and S. Shamai (Shitz), "Superposition coding for side-information channels," IEEE Trans. on Inform. Theory, vol. 52, no. 5, pp. 1872-1889, October 2006.
    • (2006) IEEE Trans. on Inform. Theory , vol.52 , Issue.5 , pp. 1872-1889
    • Bennatan, A.1    Burshtein, D.2    Caire, G.3    Shamai, S.4
  • 5
    • 79960678507 scopus 로고    scopus 로고
    • Compute-and-forward: Harnessing interference through structured codes
    • October
    • B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. on Inform. Theory, vol. 57, no. 10, pp. 6463-6486, October 2011.
    • (2011) IEEE Trans. on Inform. Theory , vol.57 , Issue.10 , pp. 6463-6486
    • Nazer, B.1    Gastpar, M.2
  • 7
    • 34250244723 scopus 로고
    • Factoring polynomials with rational coefficients
    • A. K. Lenstra, H.W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Math. Ann., Vol. 261, pp. 515.534, 1982.
    • (1982) Math. Ann. , vol.261
    • Lenstra, A.K.1    Lenstra, H.W.2    Lovasz, L.3
  • 8
    • 33846200465 scopus 로고
    • Lattice basis reduction: Improved practical algorithms and solving subset sum problems
    • C. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Mathematical programming, vol. 66, no. 1, pp. 181-199, 1994.
    • (1994) Mathematical Programming , vol.66 , Issue.1 , pp. 181-199
    • Schnorr, C.1    Euchner, M.2
  • 9
    • 84867535970 scopus 로고    scopus 로고
    • Integer-Forcing Linear Receivers
    • submitted to Jan. [Online] Available
    • J. Zhan, B. Nazer, U. Erez, and M. Gastpar, "Integer-Forcing Linear Receivers," submitted to IEEE Trans. Inform. Theory, Jan. 2012. [Online] Available: http://arXiv:1003.5966
    • (2012) IEEE Trans. Inform. Theory
    • Zhan, J.1    Nazer, B.2    Erez, U.3    Gastpar, M.4
  • 11
    • 27744567233 scopus 로고
    • Matroids and the greedy algorithm
    • J. Edmonds, "Matroids and the greedy algorithm," Mathematical Programming, pp. 127-136, 1971.
    • (1971) Mathematical Programming , pp. 127-136
    • Edmonds, J.1


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