메뉴 건너뛰기




Volumn 59, Issue 9, 2013, Pages 5227-5243

Compute-and-forward strategies for cooperative distributed antenna systems

Author keywords

Compute and forward; distributed antenna systems; lattice codes; multicell cooperation; reverse compute and forward

Indexed keywords

COMPETITIVE PERFORMANCE; COMPUTE AND FORWARDS; DISTRIBUTED ANTENNA SYSTEM; INFORMATION THEORETIC TECHNIQUES; LATTICE CODES; MULTI-CELL COOPERATIONS; NEAR-OPTIMAL PERFORMANCE; SYSTEM OPTIMIZATIONS;

EID: 84882743933     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2265695     Document Type: Article
Times cited : (150)

References (45)
  • 3
    • 77952212830 scopus 로고    scopus 로고
    • Wireless network cloud: Architecture and system requirements
    • Y. Lin, L. Shao, Z. Zhu, Q. Wang, and R. K. Sabhikhi, "Wireless network cloud: Architecture and system requirements," IBM J. Res. Develop., vol. 54, pp. 41-412, 2010.
    • (2010) IBM J. Res. Develop , vol.54 , pp. 41-412
    • Lin, Y.1    Shao, L.2    Zhu, Z.3    Wang, Q.4    Sabhikhi, R.K.5
  • 6
    • 79952852802 scopus 로고    scopus 로고
    • Wireless network information flow: A deterministic approach
    • Apr.
    • S. Avestimehr, S. Diggavi, and D. Tse, "Wireless network information flow: A deterministic approach," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1872-1905, Apr. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.4 , pp. 1872-1905
    • Avestimehr, S.1    Diggavi, S.2    Tse, D.3
  • 8
    • 77955691962 scopus 로고    scopus 로고
    • Approximately achieving Gaussian relay network capacity with lattice codes
    • Mar. [Online]
    • A. Ozgur and S. Diggavi, "Approximately achieving Gaussian relay network capacity with lattice codes," IEEE Trans. Inf. Theory Mar. 2010 [Online]. Available: http://arXiv:1005.1284.
    • (2010) IEEE Trans. Inf. Theory
    • Ozgur, A.1    Diggavi, S.2
  • 10
    • 84869461242 scopus 로고    scopus 로고
    • Approximately optimal wireless broadcasting
    • Dec.
    • S. Kannan, A. Raja, and P. Viswanath, "Approximately optimal wireless broadcasting," IEEE Trans. Inf. Theory, vol. 58, no. 12, pp. 7154-7167, Dec. 2012.
    • (2012) IEEE Trans. Inf. Theory , vol.58 , Issue.12 , pp. 7154-7167
    • Kannan, S.1    Raja, A.2    Viswanath, P.3
  • 11
    • 0018467629 scopus 로고
    • Coding theorem for the discrete memoryless broadcast channel
    • K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inf. Theory, vol. 25, no. 3, pp. 306-311, May 1979. (Pubitemid 9450752)
    • (1979) IEEE Trans Inf Theory , vol.IT-25 , Issue.3 , pp. 306-311
    • Marton, K.1
  • 12
    • 68249154931 scopus 로고    scopus 로고
    • Uplink macro diversity of limited backhaul cellular network
    • Aug.
    • A. Sanderovich, O. Somekh, H. V. Poor, and S. S. Shamai, "Uplink macro diversity of limited backhaul cellular network," IEEE Trans. Inf. Theory, vol. 55, no. 8, pp. 3457-3478, Aug. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.8 , pp. 3457-3478
    • Sanderovich, A.1    Somekh, O.2    Poor, H.V.3    Shamai, S.S.4
  • 14
    • 79960678507 scopus 로고    scopus 로고
    • Compute-and-forward: Harnessing interference through structured codes
    • Oct.
    • B. Nazer andM. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6463-6486, Oct. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.10 , pp. 6463-6486
    • Nazer, B.1    Gastpar, M.2
  • 16
    • 0028550750 scopus 로고
    • Shannon-theoretic approach to a Gaussian cellular multiple-access channel
    • Nov.
    • A. D. Wyner, "Shannon-theoretic approach to a Gaussian cellular multiple-access channel," IEEE Trans. Inf. Theory, vol. 40, no. 6, pp. 1713-1727, Nov. 1994.
    • (1994) IEEE Trans. Inf. Theory , vol.40 , Issue.6 , pp. 1713-1727
    • Wyner, A.D.1
  • 17
    • 0032632072 scopus 로고    scopus 로고
    • Analog-to-Digital converter survey and analysis
    • Apr.
    • R. Walden, "Analog-to-Digital converter survey and analysis," IEEE J. Select. Areas Commun., vol. 17, no. 4, pp. 539-550, Apr. 1999.
    • (1999) IEEE J. Select. Areas Commun , vol.17 , Issue.4 , pp. 539-550
    • Walden, R.1
  • 19
    • 83655202670 scopus 로고    scopus 로고
    • Quantized compute and forward: A lowcomplexity architecture for distributed antenna systems
    • Oct.
    • S.-N. Hong and G. Caire, "Quantized compute and forward: A lowcomplexity architecture for distributed antenna systems," in IEEE Information Theory Workshop, Paraty, Brazil, Oct. 2011, pp. 420-424.
    • (2011) IEEE Information Theory Workshop, Paraty, Brazil , pp. 420-424
    • Hong, S.-N.1    Caire, G.2
  • 23
    • 5144221013 scopus 로고    scopus 로고
    • Achieving on the AWGN channel with lattice encoding and decoding
    • Oct.
    • U. Erez and R. Zamir, "Achieving on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.10 , pp. 2293-2314
    • Erez, U.1    Zamir, R.2
  • 24
    • 0036611624 scopus 로고    scopus 로고
    • Nested linear/lattice codes for structured multiterminal binning
    • DOI 10.1109/TIT.2002.1003821, PII S0018944802048022
    • R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002. (Pubitemid 34759844)
    • (2002) IEEE Transactions on Information Theory , vol.48 , Issue.6 , pp. 1250-1276
    • Zamir, R.1    Shamai, S.2    Erez, U.3
  • 25
    • 0242365586 scopus 로고    scopus 로고
    • On maximum-likelihood detection and the search for the closest lattice point
    • Oct.
    • M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389-2401, Oct. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.10 , pp. 2389-2401
    • Damen, M.O.1    Gamal, H.E.2    Caire, G.3
  • 27
    • 34250244723 scopus 로고
    • Factoring polynomials with rational coefficients
    • A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515-534, 1982.
    • (1982) Mathematische Annalen , vol.261 , pp. 515-534
    • Lenstra, A.K.1    Lenstra, H.W.2    Lovasz, L.3
  • 28
    • 85009851951 scopus 로고    scopus 로고
    • A generalization of the LLL-algorithm over Euclidean rings or orders
    • H. Napias, "A generalization of the LLL-algorithm over Euclidean rings or orders," J. de Theorie des de Bordeaux, vol. 8, pp. 387-396, 1996.
    • (1996) J. De Theorie des de Bordeaux , vol.8 , pp. 387-396
    • Napias, H.1
  • 30
    • 0034188157 scopus 로고    scopus 로고
    • Sphere-bound-achieving coset codes and multilevel coset codes
    • May
    • G. D. Forney, M. D. Trott, and S.-Y. Chung, "Sphere-bound-achieving coset codes and multilevel coset codes," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 820-850, May 2000.
    • (2000) IEEE Trans. Inf. Theory , vol.46 , Issue.3 , pp. 820-850
    • Forney, G.D.1    Trott, M.D.2    Chung, S.-Y.3
  • 31
    • 18944374518 scopus 로고    scopus 로고
    • The modulo-lattice channel: The key feature in precoding schemes
    • DOI 10.1016/j.aeue.2004.11.028, PII S1434841104000548
    • R.F.H. Fischer, "The modulo-lattice channel: The key feature in precoding schemes," Int. J. Electron. Commun., vol. 59, pp. 244-253, Jun. 2005. (Pubitemid 40701785)
    • (2005) AEU - International Journal of Electronics and Communications , vol.59 , Issue.4 , pp. 244-253
    • Fischer, R.F.H.1
  • 32
    • 35148843474 scopus 로고
    • Asymptotic optimality of group and systematic codes for some channels
    • R. L. Dobrushin, "Asymptotic optimality of group and systematic codes for some channels," Theory Probabil. Appl., vol. 8, pp. 47-59, 1963.
    • (1963) Theory Probabil. Appl , vol.8 , pp. 47-59
    • Dobrushin, R.L.1
  • 33
    • 0015033920 scopus 로고
    • New automatic equalizer employing modulo arithmetic
    • Mar.
    • M. Tomlinson, "New automatic equalizer employing modulo arithmetic," Electronic Lett., vol. 7, pp. 138-139, Mar. 1971.
    • (1971) Electronic Lett , vol.7 , pp. 138-139
    • Tomlinson, M.1
  • 34
    • 0015387804 scopus 로고
    • Matched-transmission technique for channels with intersymbol interference
    • Aug.
    • H. Harashima and H. Miyakawa, "Matched-transmission technique for channels with intersymbol interference," IEEE Trans. Commun., vol. COM-20, no. 4, pp. 774-780, Aug. 1972.
    • (1972) IEEE Trans. Commun , vol.COM-20 , Issue.4 , pp. 774-780
    • Harashima, H.1    Miyakawa, H.2
  • 37
    • 33750592667 scopus 로고    scopus 로고
    • Precoding schemes for the MIMO-GBC
    • DOI 10.1109/IZS.2006.1649066, 1649066, IEEE 2006 International Zurich Seminar on Digital Communications - Proceedings
    • F. Boccardi, F. Tosato, and G. Caire, "Precoding schemes for the MIMO-GBC," in Proc. Int. Zurich Semin. Commun., Zurich, Switzerland, Feb. 2006, pp. 10-13. (Pubitemid 44930126)
    • (2006) International Zurich Seminar on Digital Communications , vol.2006 , pp. 10-13
    • Boccardi, F.1    Tosato, F.2    Caire, G.3
  • 39
    • 70349622772 scopus 로고    scopus 로고
    • Distributed MIMO receiver- Achievable rates and upper bounds
    • Oct.
    • A. Sanderovich, S. Shamai, and Y. Steinberg, "Distributed MIMO receiver- Achievable rates and upper bounds," IEEE Trans. Inf. Theory, vol. 55, no. 10, pp. 4419-4438, Oct. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.10 , pp. 4419-4438
    • Sanderovich, A.1    Shamai, S.2    Steinberg, Y.3
  • 41
    • 84963043395 scopus 로고
    • Note on independence functions
    • R. Rado, "Note on independence functions," in Proc. Lond.Math. Soc., 1957, vol. s3-s7, pp. 300-320.
    • (1957) Proc. Lond.Math. Soc. , vol.S3S7 , pp. 300-320
    • Rado, R.1
  • 42
    • 27744567233 scopus 로고
    • Matroids and the greedy algorithm
    • J. Edmonds, "Matroids and the greedy algorithm," Math. Programming, vol. 1, pp. 127-136, 1971.
    • (1971) Math. Programming , vol.1 , pp. 127-136
    • Edmonds, J.1
  • 43
    • 33644984960 scopus 로고    scopus 로고
    • On the optimality ofmultiantenna broadcast scheduling using zero-forcing beamforming
    • Mar.
    • T. Yoo and A. Goldsmith, "On the optimality ofmultiantenna broadcast scheduling using zero-forcing beamforming," IEEE J. Select. Areas Commun., vol. 24, no. 3, pp. 528-541, Mar. 2006.
    • (2006) IEEE J. Select. Areas Commun , vol.24 , Issue.3 , pp. 528-541
    • Yoo, T.1    Goldsmith, A.2
  • 44
    • 27844471971 scopus 로고    scopus 로고
    • On downlink beamforming with greedy user selection: Performance analysis and a simple new algorithm
    • DOI 10.1109/TSP.2005.855401
    • G. Dimic and N. D. Sidiropoulosm, "On downlink beamforming with greedy user selection: Performance analysis and a simple new algorithm," IEEE Trans. Signal Process., vol. 53, no. 10, pp. 3857-3868, Oct. 2005. (Pubitemid 41645623)
    • (2005) IEEE Transactions on Signal Processing , vol.53 , Issue.I10 , pp. 3857-3868
    • Dimic, G.1    Sidiropoulos, N.D.2


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