메뉴 건너뛰기




Volumn 58, Issue 8, 2012, Pages 5151-5171

Symmetric capacity of the gaussian interference channel with an out-of-band relay to within 1.15 bits

Author keywords

Approximate capacity; deterministic model; interference relay channel (IFRC); nested lattice codes; out of band relay (OBR)

Indexed keywords

APPROXIMATE CAPACITY; DETERMINISTIC MODELS; NESTED LATTICE CODES; OUT-OF-BAND; RELAY CHANNELS;

EID: 84863919670     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2197851     Document Type: Article
Times cited : (18)

References (27)
  • 1
    • 79952428988 scopus 로고    scopus 로고
    • Sum capacity of the deterministic interference channel with an out-of-band half-duplex relay
    • Control, Comput., Oct.
    • Y. Tian and A. Yener, "Sum capacity of the deterministic interference channel with an out-of-band half-duplex relay," in Proc. 48th Annu. Allerton Conf. Commun., Control, Comput., Oct. 2010, pp. 1244-1251.
    • (2010) Proc. 48th Annu. Allerton Conf. Commun. , pp. 1244-1251
    • Tian, Y.1    Yener, A.2
  • 2
    • 80052143210 scopus 로고    scopus 로고
    • Harnessing interference with an out-of-band relay: An approximate capacity result
    • Kyoto, Japan, Jun.
    • Y. Tian and A. Yener, "Harnessing interference with an out-of-band relay: An approximate capacity result," in IEEE Int. Conf. Commun., Kyoto, Japan, Jun. 2011.
    • (2011) IEEE Int. Conf. Commun.
    • Tian, Y.1    Yener, A.2
  • 3
    • 0016549557 scopus 로고
    • A case where interference does not reduce capacity
    • Sep.
    • A. Carleial, "A case where interference does not reduce capacity," IEEE Trans. Wireless Commun., vol. WC-21, no. 5, pp. 569-570, Sep. 1975.
    • (1975) IEEE Trans. Wireless Commun. , vol.WC-21 , Issue.5 , pp. 569-570
    • Carleial, A.1
  • 4
    • 0019437605 scopus 로고
    • New achievable rate region for the interference channel
    • T. Han and K. Kobayashi, "A new achievable rate region for the interference channel," IEEE Trans. Inf. Theory, vol. IT-27, no. 1, pp. 49-60, Jan. 1981. (Pubitemid 11481232)
    • (1981) IEEE Transactions on Information Theory , vol.IT-27 , Issue.1 , pp. 49-60
    • Han Te Sun1    Kobayashi Kingo2
  • 5
    • 0019635833 scopus 로고
    • Capacity of the gaussian interference channel under strong interference
    • H. Sato, "The capacity of the Gaussian interference channel under strong interference," IEEE Trans. Inf. Theory, vol. IT-27, no. 6, pp. 786-788, Nov. 1981. (Pubitemid 12447680)
    • (1981) IEEE Transactions on Information Theory , vol.IT-27 , Issue.6 , pp. 786-788
    • Sato, H.1
  • 6
    • 1842533560 scopus 로고    scopus 로고
    • Outer bounds on the capacity of Gaussian interference channels
    • Mar.
    • G. Kramer, "Outer bounds on the capacity of Gaussian interference channels," IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 581-586, Mar. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.3 , pp. 581-586
    • Kramer, G.1
  • 7
    • 57349111149 scopus 로고    scopus 로고
    • Gaussian interference channel capacity to within one bit
    • Dec.
    • R. H. Etkin,D. N. C.Tse, andH.Wang, "Gaussian interference channel capacity to within one bit," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5534-5562, Dec. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.12 , pp. 5534-5562
    • Etkin, R.H.1    Ctse, D.N.2    Wang, H.3
  • 8
    • 52349091217 scopus 로고    scopus 로고
    • New outer bounds on the capacity region of Gaussian interference channels
    • Jul.
    • X. Shang, G. Kramer, and B. Chen, "New outer bounds on the capacity region of Gaussian interference channels," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2008, pp. 245-249.
    • (2008) Proc. IEEE Int. Symp. Inf. Theory , pp. 245-249
    • Shang, X.1    Kramer, G.2    Chen, B.3
  • 9
    • 52349109087 scopus 로고    scopus 로고
    • Gaussian interference networks: Sum capacity in the low interference regime
    • Jul.
    • V. S. Annapureddy and V. Veeravalli, "Gaussian interference networks: Sum capacity in the low interference regime," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2008, pp. 255-259.
    • (2008) Proc. IEEE Int. Symp. Inf. Theory , pp. 255-259
    • Annapureddy, V.S.1    Veeravalli, V.2
  • 10
    • 0018523303 scopus 로고
    • Capacity theorems for the relay channel
    • Sep.
    • T. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inf. Theory, vol. IT-25, no. 5, pp. 572-584, Sep. 1979.
    • (1979) IEEE Trans. Inf. Theory , vol.IT-25 , Issue.5 , pp. 572-584
    • Cover, T.1    El Gamal, A.2
  • 11
    • 33645719950 scopus 로고    scopus 로고
    • Capacity bounds for cooperative diversity
    • Apr.
    • A. Host-Madsen, "Capacity bounds for cooperative diversity," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1522-1544, Apr. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.4 , pp. 1522-1544
    • Host-Madsen, A.1
  • 12
    • 35148864632 scopus 로고    scopus 로고
    • Resource allocation for wireless fading relay channels: Max-min solution
    • DOI 10.1109/TIT.2007.904996, Special issue on Models, Theory, and Codes for Relaying and Cooperation in Communication Network
    • Y. Liang, V. V. Veeravalli, and H. V. Poor, "Resource allocation for wireless fading relay channels: Max-min solution," IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3432-3453, Oct. 2007. (Pubitemid 47534507)
    • (2007) IEEE Transactions on Information Theory , vol.53 , Issue.10 , pp. 3432-3453
    • Liang, Y.1    Veeravalli, V.V.2    Poor, H.V.3
  • 15
    • 76249114609 scopus 로고    scopus 로고
    • An outer bound for the Gaussian interference channel with a relay
    • Oct.
    • I. Maric, R. Dabora, and A. Goldsmith, "An outer bound for the Gaussian interference channel with a relay," in Proc. IEEE Inf. Theory Workshop, Oct. 2009, pp. 569-573.
    • (2009) Proc. IEEE Inf. Theory Workshop , pp. 569-573
    • Maric, I.1    Dabora, R.2    Goldsmith, A.3
  • 16
    • 39349090476 scopus 로고    scopus 로고
    • Achievable rates for the Gaussian interference relay channel
    • DOI 10.1109/GLOCOM.2007.313, 4411223, IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
    • O. Sahin and E. Erkip, "Achievable rates for the Gaussian interference relay channel," in Proc. IEEE Global Telecommun. Conf., Nov. 2007, pp. 1627-1631. (Pubitemid 351259301)
    • (2007) GLOBECOM - IEEE Global Telecommunications Conference , pp. 1627-1631
    • Sahin, O.1    Erkip, E.2
  • 18
    • 79955511018 scopus 로고    scopus 로고
    • The Gaussian interference relay channel: Improved achievable rates and sum rate upperbounds using a potent relay
    • May
    • Y. Tian and A. Yener, "The Gaussian interference relay channel: Improved achievable rates and sum rate upperbounds using a potent relay," IEEE Trans. Inf. Theory (Special Issue on Interference Networks), vol. 57, no. 5, pp. 2865-2879, May 2011.
    • (2011) IEEE Trans. Inf. Theory (Special Issue on Interference Networks) , vol.57 , Issue.5 , pp. 2865-2879
    • Tian, Y.1    Yener, A.2
  • 19
    • 35148814319 scopus 로고    scopus 로고
    • Computation over multiple-access channels
    • DOI 10.1109/TIT.2007.904785, Special issue on Models, Theory, and Codes for Relaying and Cooperation in Communication Network
    • B. Nazer and M. Gastpar, "Computation over multiple-access channels," IEEE Trans. Inf. Theory (Special Issue on Models, Theory, and Codes for Relaying and Cooperation in Communication Networks"), vol. 53, no. 10, pp. 3498-3516, Oct. 2007. (Pubitemid 47534510)
    • (2007) IEEE Transactions on Information Theory , vol.53 , Issue.10 , pp. 3498-3516
    • Nazer, B.1    Gastpar, M.2
  • 20
    • 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
  • 21
    • 79955512783 scopus 로고    scopus 로고
    • Feedback capacity of the Gaussian interference channel to within 2 bits
    • May
    • C. Suh and D. Tse, "Feedback capacity of the Gaussian interference channel to within 2 bits," IEEE Trans. Inf. Theory (Special Issue on Interference Netw.), vol. 57, no. 5, pp. 2667-2685, May 2011.
    • (2011) IEEE Trans. Inf. Theory (Special Issue on Interference Netw.) , vol.57 , Issue.5 , pp. 2667-2685
    • Suh, C.1    Tse, D.2
  • 22
    • 46749106384 scopus 로고    scopus 로고
    • The two-user Gaussian interference channel: A deterministic view
    • Apr.
    • G. Bresler and D. Tse, "The two-user Gaussian interference channel: A deterministic view," Eur. Trans. Telecommun., vol. 19, pp. 333-354, Apr. 2008.
    • (2008) Eur. Trans. Telecommun. , vol.19 , pp. 333-354
    • Bresler, G.1    Tse, D.2
  • 23
    • 77950633110 scopus 로고    scopus 로고
    • Approximate capacity of the symmetric half-duplex Gaussian butterfly network
    • Oct.
    • S. Avestimehr and T. Ho, "Approximate capacity of the symmetric half-duplex Gaussian butterfly network," in Proc. IEEE Inf. Theory Workshop, Oct. 2009, pp. 311-315.
    • (2009) Proc. IEEE Inf. Theory Workshop , pp. 311-315
    • Avestimehr, S.1    Ho, T.2
  • 26
    • 26844546304 scopus 로고    scopus 로고
    • Lattices which are good for (almost) everything
    • DOI 10.1109/TIT.2005.855591
    • U. Erez, S. Litsyn, and R. Zamir, "Latticeswhich are good for (almost) everything," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3401-3416, Oct. 2005. (Pubitemid 41448587)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.10 , pp. 3401-3416
    • Erez, U.1    Litsyn, S.2    Zamir, R.3
  • 27
    • 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


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