基于速率分裂的干扰信道容量及传输策略研究
|
摘要
提高网络信息容量,一方面需要增加网络的覆盖及提高信息的传输速率,另一方面用户密度的增加要求能有效解决干扰问题。近年来,MIMO、空时编码、机会调度、现代信道编码(Turbo码、LDPC码和Rateless码)、中继协作等技术的出现,在解决了第一类问题的同时加剧了小区内、小区间和网络间的干扰。因此,干扰日益成为制约提升通信系统性能的瓶颈,如何消除干扰带来的影响成为无线通信网络的研究重点。本文针对干扰信道的容量和传输策略问题进行研究,主要成果可概括如下：
1)针对高斯干扰信道,提出了一种基于最大最小公平性的译码次序新算法。结合该算法,推导出和速率近似最大的速率分裂层数表达式。通过该译码次序新算法得到的和速率较已有贪婪算法得到的和速率有明显提高,并随着干扰强度的增加,其和速率逼近Sason提出的和速率内界。
2)基于以上提出的译码次序算法,针对两用户高斯干扰信道提出了基于速率分裂的固定功率最优化分配算法。该系统中,每个发射端将所要传输的信息分成多层并行信息,通过固定功率最优化分配算法对每层信息赋予相应的功率,并将其叠加后进行传输；每个接收端采用之前提出的译码次序新算法对接收到的每层信息(包含有用信息和干扰信息)进行译码。两种算法的结合能够在不牺牲任何用户速率下提高系统的吞吐量,并在理想情况下能够进一步逼近Sason的和速率内界。
3)通过分析Han-Kobayashi (HK)策略在多用户对称循环高斯干扰信道中的应用,提出了一种自适应奇偶对称速率分裂方案。具有低复杂度的该方案针对不同的信道条件设计出相应最优分裂系数和速率分裂方案。在高信噪比和一般信噪比环境下,自适应奇偶对称速率分裂方案得到的和速率在较大范围内明显大于由对称速率分裂方案和Etkin等人提出的速率分裂方案所得到的和速率,且在一般信噪比下能够逼近HK和速率内界。
4)通过提出可达速率的内界和外界,进一步研究了HK策略在级联高斯Z干扰信道中的性能。通过增加级联高斯Z干扰信道的约束条件得出该信道的速率内界；参考Etkin等人针对两用户干扰信道提出的两种精灵辅助方案,得出级联高斯Z干扰信道的两条速率外界。通过推导速率内外界之差得出,在级联高斯Z干扰信道中利用HK策略所得到的速率内界距离信道容量约1bit。
Two aspects are involved in increasing the capacity of network:one is to improvethe coverage of network as well as boost the data communication rate, and the other isto reduce the interference due to the high density of users. With the advent of MIMOtechnique, space-time code technique, opportunistic scheduling, modern channel coding(Turbo code, LDPC code and Rateless code) and relay cooperation technique, the frstproblem can be solved while aggravating the interference exiting in inter-cell, intra-cell andnetworks. Therefore, interference becomes the bottleneck of improving the property ofcommunication system. How to eliminate the impact of interference is the focus of wirelesscommunication research. This dissertation investigates the capacity and transmissionscheme of interference channel. The main results are summarized as follows:
1) A novel algorithm for determination of decoding order for the Gaussian interferencechannel (GIC) is proposed based on max-min fairness. Based on the proposedalgorithm, an expression of the number of rate-splitting is derived for the sum-rate toapproach the maximum value. The proposed decoding order algorithm signifcantlyimproves the performance over the greedy algorithm on the two-user symmetricalGIC within a wide range of channel coefcients, and the sum-rate of the proposedscheme can approach the inner bound of Sason as increasing the interference factor.
2) Based on the above decoding order algorithm, an optimal power allocation algo-rithm for two-user Gaussian symmetrical interference channel is proposed. In thissystem, each transmitter splits its information into multiple layers assigned withthe power which determined by optimal power allocation algorithm and transmitsthe superposition of those layers, and each receiver decodes the message from alllayers of the two users by the proposed decoding order algorithm. Combining thetwo algorithms can improve the sum-rate of the two-user interference channel with-out sacrifcing the rate of either user, and make a signifcant improvement of theperformance over that of equal power allocation. In the ideal case, the sum-rateeven approaches the inner bound of Sason.
3) By analysing the performance of Han-Kobayashi (HK) strategy in multi-user sym-metric Gaussian cyclic interference channel, an adaptive odd-even symmetric rate-splitting scheme is proposed. With low complexity, the proposed scheme designsthe optimal split ratio and the rate-splitting’s scheme according to various channelconditions. In a large range of transmitted power and interference factor, the sum-rate achieved using the proposed scheme is higher than that using the symmetric scheme and the scheme proposed by Etkin et al. in high SNR and general SNRregimes. The sum-rate of the proposed scheme can also approach the inner boundof HK scheme in general SNR regimes.
4) The HK strategy is further studied on cascade Gaussian Z interference channel byproposing a new inner bound and two new outer bounds of achievable rate. The newinner bound is proposed by adding some constraints on this channel. According tothe method proposed by Etkin et al, the new outer bounds are proposed by givingextra side information to the receivers. We show that a very simple and explicitHK type scheme can achieve to about a single bit per second per hertz (bit/s/Hz)of the capacity for all values of the channel parameters.
1)针对高斯干扰信道,提出了一种基于最大最小公平性的译码次序新算法。结合该算法,推导出和速率近似最大的速率分裂层数表达式。通过该译码次序新算法得到的和速率较已有贪婪算法得到的和速率有明显提高,并随着干扰强度的增加,其和速率逼近Sason提出的和速率内界。
2)基于以上提出的译码次序算法,针对两用户高斯干扰信道提出了基于速率分裂的固定功率最优化分配算法。该系统中,每个发射端将所要传输的信息分成多层并行信息,通过固定功率最优化分配算法对每层信息赋予相应的功率,并将其叠加后进行传输；每个接收端采用之前提出的译码次序新算法对接收到的每层信息(包含有用信息和干扰信息)进行译码。两种算法的结合能够在不牺牲任何用户速率下提高系统的吞吐量,并在理想情况下能够进一步逼近Sason的和速率内界。
3)通过分析Han-Kobayashi (HK)策略在多用户对称循环高斯干扰信道中的应用,提出了一种自适应奇偶对称速率分裂方案。具有低复杂度的该方案针对不同的信道条件设计出相应最优分裂系数和速率分裂方案。在高信噪比和一般信噪比环境下,自适应奇偶对称速率分裂方案得到的和速率在较大范围内明显大于由对称速率分裂方案和Etkin等人提出的速率分裂方案所得到的和速率,且在一般信噪比下能够逼近HK和速率内界。
4)通过提出可达速率的内界和外界,进一步研究了HK策略在级联高斯Z干扰信道中的性能。通过增加级联高斯Z干扰信道的约束条件得出该信道的速率内界；参考Etkin等人针对两用户干扰信道提出的两种精灵辅助方案,得出级联高斯Z干扰信道的两条速率外界。通过推导速率内外界之差得出,在级联高斯Z干扰信道中利用HK策略所得到的速率内界距离信道容量约1bit。
Two aspects are involved in increasing the capacity of network:one is to improvethe coverage of network as well as boost the data communication rate, and the other isto reduce the interference due to the high density of users. With the advent of MIMOtechnique, space-time code technique, opportunistic scheduling, modern channel coding(Turbo code, LDPC code and Rateless code) and relay cooperation technique, the frstproblem can be solved while aggravating the interference exiting in inter-cell, intra-cell andnetworks. Therefore, interference becomes the bottleneck of improving the property ofcommunication system. How to eliminate the impact of interference is the focus of wirelesscommunication research. This dissertation investigates the capacity and transmissionscheme of interference channel. The main results are summarized as follows:
1) A novel algorithm for determination of decoding order for the Gaussian interferencechannel (GIC) is proposed based on max-min fairness. Based on the proposedalgorithm, an expression of the number of rate-splitting is derived for the sum-rate toapproach the maximum value. The proposed decoding order algorithm signifcantlyimproves the performance over the greedy algorithm on the two-user symmetricalGIC within a wide range of channel coefcients, and the sum-rate of the proposedscheme can approach the inner bound of Sason as increasing the interference factor.
2) Based on the above decoding order algorithm, an optimal power allocation algo-rithm for two-user Gaussian symmetrical interference channel is proposed. In thissystem, each transmitter splits its information into multiple layers assigned withthe power which determined by optimal power allocation algorithm and transmitsthe superposition of those layers, and each receiver decodes the message from alllayers of the two users by the proposed decoding order algorithm. Combining thetwo algorithms can improve the sum-rate of the two-user interference channel with-out sacrifcing the rate of either user, and make a signifcant improvement of theperformance over that of equal power allocation. In the ideal case, the sum-rateeven approaches the inner bound of Sason.
3) By analysing the performance of Han-Kobayashi (HK) strategy in multi-user sym-metric Gaussian cyclic interference channel, an adaptive odd-even symmetric rate-splitting scheme is proposed. With low complexity, the proposed scheme designsthe optimal split ratio and the rate-splitting’s scheme according to various channelconditions. In a large range of transmitted power and interference factor, the sum-rate achieved using the proposed scheme is higher than that using the symmetric scheme and the scheme proposed by Etkin et al. in high SNR and general SNRregimes. The sum-rate of the proposed scheme can also approach the inner boundof HK scheme in general SNR regimes.
4) The HK strategy is further studied on cascade Gaussian Z interference channel byproposing a new inner bound and two new outer bounds of achievable rate. The newinner bound is proposed by adding some constraints on this channel. According tothe method proposed by Etkin et al, the new outer bounds are proposed by givingextra side information to the receivers. We show that a very simple and explicitHK type scheme can achieve to about a single bit per second per hertz (bit/s/Hz)of the capacity for all values of the channel parameters.
引文
[1] C. E. Shannon,“Two-way communication channels,” in Proc.4th Berkeley Symp. on Math.Stat. and Prob., vol.1, Berkeley and Los Angeles, University of California Press, USA,1961, pp.611–644.
[2] R. Ahlswede,“The capacity region of a channel with two senders and two receivers,” TheAnnals of Probability, vol.2, no.5, pp.805–814, Oct.1974.
[3] A. D. Wyner,“Shannon-theoretic approach to a Gaussian cellular multiple-access chan-nel,” IEEE Trans. Inf. Theory, vol.40, no.6, pp.1713–1727, Nov.1994.
[4] O. Somekh, B. M. Zaidel, and S. Shamai,“Sum rate characterization of joint multiplecell-site processing,” IEEE Trans. Inf. Theory, vol.53, no.12, pp.4473–4497, Dec.2007.
[5] Y. Liu and E. Erkip,“On the sum capacity of k-user cascade Gaussian Z-interferencechannel,” in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia,2011, pp.1382–1386.
[6] H. Sato,“On the capacity region of a discrete two-user channel for strong interference,”IEEE Trans. Inf. Theory, vol.24, no.3, pp.377–379, May1978.
[7] M. H. M. Costa and A. A. E. Gamal,“The capacity region of the discrete memorylessinterference channel with strong interference,” IEEE Trans. Inf. Theory, vol.33, no.5, pp.710–711, Sep.1987.
[8] A. B. Carleial,“A case where interference does not reduce capacity,” IEEE Trans. Inf.Theory, vol.21, no.5, pp.569–570, Sep.1975.
[9] A. A. E. Gamal and M. H. M. Costa,“The capacity region of a class of deterministicinterference channels,” IEEE Trans. Inf. Theory, vol.28, no.2, pp.343–346, Mar.1982.
[10] N. Liu and S. Ulukus,“The capacity region of a class of discrete degraded interferencechannels,” IEEE Trans. Inf. Theory, vol.54, no.9, pp.4372–4378, Sep.2008.
[11] R. Benzel,“The capacity region of a class of discrete additive degraded interference chan-nels,” IEEE Trans. Inf. Theory, vol.25, no.2, pp.228–231, Mar.1979.
[12] J. Jiang, Y. Xin, and H. Garg,“Discrete memoryless interference channels with feedback,”in Proc.41st Annual Conference on Information Sciences and Systems, Baltimore, MD,USA, Mar.2007, pp.225–226.
[13] L. Zhang, J. Jiang, and S. Cui,“Achievable rate regions for discrete memoryless interfer-ence channel with state information,” in Proc. IEEE International Conference on Com-munications, Kyoto, Japan, Jun.2011, pp.1–5.
[14] T. Han and K. Kobayashi,“A new achievable rate region for the interference channel,”IEEE Trans. Inf. Theory, vol.27, no.11, pp.49–60, Jan.1981.
[15] H. Sato,“The capacity of the Gaussian interference channel under strong interference,”IEEE Trans. Inf. Theory, vol.27, no.6, pp.786–788, Nov.1981.
[16] X. H. Shang, G. Kramer, and B. Chen,“A new outer bound and the noisy-interferencesum-rate capacity for Gaussian interference channels,” IEEE Trans. Inf. Theory, vol.55,no.2, pp.689–699, Feb.2009.
[17] A. S. Motahari and A. K. Khandani,“A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels,” IEEE Trans. Inf. Theory, vol.55, no.2,pp.620–643, Feb.2009.
[18] V. S. Annapureddy and V. V. Veeravalli,“Gaussian interference networks: sum capacityin the low-interference regime and new outer bounds on the capacity region,” IEEE Trans.Inf. Theory, vol.55, no.7, pp.620–643, Jul.2009.
[19] D. Tuninetti and Y. Weng,“On the Han-Kobayashi achievable region for Gaussian inter-ference channels,” in Proc. IEEE Int. Symp. Inf. Theory, Toronto, Canada, Jul.2008, pp.240–244.
[20] I. Sason,“On achievable rate regions for the Gaussian interference channel,” IEEE Trans.Inf. Theory, vol.50, no.6, pp.1345–1356, Jun.2004.
[21] R. Etkin, D. N. C. Tse, and H. Wang,“Gaussian interference channel capacity to withinone bit,” IEEE Trans. Inf. Theory, vol.54, no.12, pp.5534–5562, Dec.2008.
[22] G. Kramer,“Outer bounds on the capacity of Gaussian interference channels,” IEEETrans. Inf. Theory, vol.50, no.3, pp.581–586, Mar.2004.
[23] G. Bresler, A. Parekh, and D. N. C. Tse,“The approximate capacity of the many-to-oneand one-to-many Gaussian interference channel,” IEEE Trans. Inf. Theory, vol.56, no.9,pp.4566–4592, Sep.2010.
[24] T. Gou and S. A. Jafar,“Degrees of freedom of the K user,” IEEE Trans. Inf. Theory, vol.56, no.12, pp.6040–6057MIMO interferencechannel, Dec.2008.
[25] C. Gong, A. Tajer, and X. Wang,“Interference channel with constrained partial groupdecoding,” IEEE Trans. on Commun., vol.59, no.11, pp.3059–3071, Nov.2011.
[26] V. Cadambe and S. A. Jafar,“Interference alignment and degrees of freedom of the K-userinterference channel,” IEEE Trans. Inf. Theory, vol.54, no.8, pp.3425–3441, Aug.2008.
[27] M. A. Maddah-Ali, A. S. Motahari, and A. K. Khandani,“Communication over MIMO Xchannels: Interference alignment, decomposition, and performance analysis,” IEEE Trans.Inf. Theory, vol.54, no.8, pp.3457–3470, Aug.2008.
[28] V. Cadambe, S. A. Jafar, and S. Shamai,“Interference alignment on the deterministicchannel and application to fully connected Gaussian interference channel,” IEEE Trans.Inf. Theory, vol.55, no.1, pp.269–274, Jan.2009.
[29] A. Ghasemi, A. S. Motahari, and A. K. Khandani,“Interference alignment for the K userMIMO interference channel,” IEEE Trans. Inf. Theory, vol.56, no.12, pp.6040–6057,Dec.2008.
[30] B. Nazer, M. Gastpar, S. A. Jafar, and S. Vi,“Near shannon limit error-correcting codingand decoding: Turbo-codes,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun.2009, pp.1769–1773.
[31] S. A. Jafar and S. Vishwanath,“Generalized degrees of freedom of the symmetric K userGaussian interference channel,” IEEE Trans. Inf. Theory, vol.56, no.7, pp.3297–3303,Jul.2010.
[32] B. Bandemer, G. Vazquez-Vilar, and A. E. Gamal,“On the sum capacity of a class ofcyclically symmetric deterministic interference channels,” in Proc. IEEE Int. Symp. Inf.Theory, Seoul, Korea, Jun./Jul.2009, pp.2622–2626.
[33] A. Jovicic, H. Wang, and P. Viswanath,“On network interference management,” IEEETrans. Inf. Theory, vol.56, no.10, pp.4941–4955, Oct.2010.
[34] B. Bandemer and A. E. Gamal,“Interference decoding for deterministic channels,” IEEETrans. Inf. Theory, vol.57, no.5, pp.2966–2975, May2011.
[35] A. Padakandla, A. Sahebi, and S. Pradhan,“A new achievable rate region for the3-user discrete memoryless interference channel,” in Proc. IEEE Int. Symp. Inf. Theory,Cambridge, MA, USA, Jul.2012, pp.2256–2260.
[36] X. H. Shang, B. C. G. Kramer, and H. V. Poor,“Capacity regions and sum-rate capacitiesof vector Gaussian interference channels,” IEEE Trans. Inf. Theory, vol.56, no.10, pp.5030–5044, Oct.2010.
[37] S. T. Chung, S. J. Kim, J. Lee, and J. M. Ciof,“A game-theoretic approach to powerallocation in frequency-selective Gaussian interference channels,” in Proc. IEEE Int. Symp.Inf. Theory, St. Petersburg, Russia, Jun.2011, pp.316–316.
[38] C. U. Saraydar, N. B. Mandayam, and D. Goodman,“Efcient power control via pricingin wireless data networks,” IEEE Trans. on Commun., vol.50, no.2, pp.291–303, Feb.2002.
[39] J. Huang, R. A. Berry, and M. L. Honig,“Distributed interference compensation for wire-less networks,” IEEE Trans. on Commun., vol.24, no.5, pp.1074–1084, May2006.
[40] F. Wang, M. Krunz, and S. Cui,“Price-based spectrum management in cognitive radionetworks,” IEEE Journal of Selected Topics in Signal Processing, vol.2, no.1, pp.74–87,Feb.2008.
[41] W. Yu, G. Ginis, and J. M. Ciof,“Distributed multiuser power control for digital sub-scriber lines,” IEEE Journal on Selected areas in Communications, vol.20, no.5, pp.1105–1115, Jun.2002.
[42] K. K. Leung, C. W. Sung, and K. W. Shum,“Iterative waterflling for parallel Gaus-sian interference channels,” in Proc. IEEE International Conference on Communications,Istanbul, Turkey, Jun.2006, pp.5491–5494.
[43] G. Scutari, D. P. Palomar, and S. Barbarossa,“Simultaneous iterative water-flling forGaussian frequency-selective interference channels,” in Proc. IEEE Int. Symp. Inf. Theory,Seattle, USA, Jul.2006, pp.600–604.
[44]——,“Asynchronous iterative waterflling for Gaussian frequency-selective interferencechannels: A unifed framework,” in Proc. Information Theory and Applications Workshop,La Jolla, CA, USA, Jan.2007, pp.349–358.
[45] R. Cendrillon, M. M. W. Yu, J. Verliden, and T. Bostoen,“Optimal multiuser spectrumbalancing for digital subscriber lines,” IEEE Trans. on Commun., vol.54, no.5, pp.922–933, Jun.2006.
[46] R. Cendrillon, J. Huang, and C. Mung,“Autonomous spectrum balancing for digital sub-scriber lines,” IEEE Trans. on Signal Processing, vol.55, no.8, pp.4241–4257, Aug.2007.
[47] I. Maric, R. Dabora, and A. Goldsmith,“An outer bound for the Gaussian interferencechannel with a relay,” in Proc. IEEE Information Theory Workshop, Taormina, Italy, Oct.2009, pp.569–573.
[48] Y. Tian and A. Yener,“The Gaussian interference relay channel with a potent relay,” inProc. IEEE Global Telecommunications Conference Globecom, Honolulu, USA, Nov.2009,pp.1–6.
[49] O. Sahin and E. Erkip,“Achievable rates for the Gaussian interference relay channel,”in Proc. Global Telecommunications Conference, Washington, D.C., USA, Nov.2007, pp.1627–1631.
[50] A. Chaaban and A. Sezgin,“On the transmit strategy for the interference MIMO relaychannel in the low power regime,” in Proc.8th Int. ITG Conf. on Source and ChannelCoding, Siegen, Germany, Jan.2010, pp.1–6.
[51] S. Sridharan, S. Vishwanath, S. A. Jafar, and S. Shamai,“On the capacity of cognitive relayassisted Gaussian interference channel,” in Proc. IEEE Int. Symp. Inf. Theory, Toronto,Ontario, Canada, Jul.2008, pp.549–553.
[52] S. Rini, D. Tuninetti, and N. Devroye,“A new capacity result for the Z-Gaussian cognitiveinterference channel,” in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul.2011, pp.2403–2407.
[53] H. Charmchi, G. Hodtani, and M. Nasiri-Kenari,“A new outer bound for a class of in-terference channels with a cognitive relay and a certain capacity result,” IEEE Commun.Letters, vol.17, no.2, pp.241–244, Feb.2013.
[54] E. Sasoglu,“Successive cancellation for cyclic interference channels,” in Proc. InformationTheory Workshop, Porto, Portugal, May2008, pp.36–40.
[55] L. Zhou and W. Yu,“On the capacity of the K-user cyclic Gaussian interference channel,”in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul.2011, pp.1171–1175.
[56] A. Chaaban and A. Sezgin,“On the capacity of a class of multi-user interference channels,”in Proc. International ITG Workshop on Smart Antennas, Aachen, Germany, Feb.2011,pp.1–5.
[57] R. Tandon and H. V. Poor,“On the symmetric feedback capacity of the K-user cyclicinterference channel,” in Proc.14th Annual Allerton Conference Allerton House, UIUC,Illinois, USA, Sep.2011, pp.28–30.
[58] N. Liu and S. Ulukus,“On the capacity region of the Gaussian Z-channel,” in Proc. IEEEGlobal Telecommunications Conference, Dallas, TX, USA, Nov.2004, pp.415–419.
[59] M. Mirmohseni, B. Akhbari, and M. Aref,“Capacity bounds for the three-user cognitiveZ-interference channel,” in Proc. Canadian Workshop on Information Theory, Kelowna,BC, Canada, May2011, pp.34–37.
[60] J. Mao, J. Gao, and a. G. X. Y.N. Liu,“On the ergodic capacity of fading cognitive radioMIMO Z-interference channel,” IEEE Commun. Letters, vol.15, no.11, pp.1166–1168,Nov.2011.
[61] M. Vaezi and V. Mai,“On the capacity of the cognitive Z-interference channel,” in Proc.Canadian Workshop on Information Theory, Kelowna, BC, Canada, May2011, pp.30–33.
[62] J. Jiang, I. Maric, A. Goldsmith, S. Shamai, and S. Cui,“On the capacity of a class ofcognitive Z-interference channels,” in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg,Russia, Jun.2011, pp.1–6.
[63] E. Stathakis, M.Skoglund, and L. Rasmussen,“On combined beamforming and OSTBCover the cognitive radio z-channel with partial CSI,” in Proc. IEEE International Confer-ence on Communications, Ottawa, Canada, Jun.2012, pp.2380–2384.
[64] N. Liu, I. I. Maric, A. Goldsmith, and S. Shamai,“Capacity bounds and exact results forthe cognitive Z-interference channel,” IEEE Trans. Inf. Theory, vol.59, no.2, pp.886–893,Feb.2013.
[65] F. Khan, T. Ratnarajah, and S. Prakriya,“Outage performance of causal cognitive radioZ-interference fading channel with cognitive relaying,” in Proc. International Conferenceon Signal Processing and Communications, Bangalore, India, Jul.2010, pp.1–5.
[66] S. Mohajer, S. Diggavi, C. Fragouli, and D. Tse,“Approximate capacity of a class ofGaussian interference-relay networks,” IEEE Trans. Inf. Theory, vol.57, no.2, pp.2837–2864, May2011.
[67] L. Zhou and W. Yu,“Gaussian Z-interference channel with a relay link: Achievabilityregion and asymptotic sum capacity,” IEEE Trans. Inf. Theory, vol.58, no.4, pp.2413–2426, Apr.2012.
[68] R. Sirigina, A. Madhukumar, and Q. Li,“Performance analysis of Z-channel with relay un-der rayleigh fading and discrete constellations,” in Proc. IEEE Wireless Communicationsand Networking Conference, Shanghai, China, Apr.2012, pp.92–96.
[69] A. Leshem and E. Zehavi,“Cooperative game theory and the Gaussian interference chan-nel,” IEEE Journal on Selected Areas in Communications, vol.26, no.7, pp.1078–1088,Sep.2008.
[70] J. E. Suris, L. A. Dasilva, Z. Han, and A. B. MacKenzie,“Cooperative game theory fordistributed spectrum sharing,” in Proc. the IEEE International Conference on Communi-cations, Glasgow, UK, Jun.2007, pp.5282–5287.
[71] A. Laufer, A. Leshem, and H. Messer,“Game theoretic aspects of distributed spectralcoordination with application to DSL networks,”2006, http://arxiv.org/abs/cs/0602014.
[72] Z. Q. Luo and J. S. Pang,“Analysis of iterative water flling algorithm for multiuser powercontrol in digital subscriber lines,” EURASIP Journal on Applied Signal Processing, pp.1–10,2006.
[73] K. W. Shum, K. K. Leung, and C. W. Sung,“Convergence of iterative waterflling algo-rithm for Gaussian interference channels,” IEEE Journal on Selected areas in Communi-cations, vol.25, no.6, pp.1091–1100, Aug.2007.
[74] R. Cendrillon, W. Yu, and M. Marc,“Optimal multi-user spectrum management for digitalsubscriber lines,” in Proc. IEEE International Conference on Communications, Paris,France, Jun.2004, pp.1–5.
[75] R. Cendrillon and M. Moonen,“Iterative spectrum balancing for digital subscriber lines,”in Proc. IEEE International Conference on Communications, Seoul, South Korea, May2005, pp.1937–1941.
[76] P. Tsiafakis, M. Diehl, and M. Moonen,“Distributed spectrum management algorithmsfor multiuser DSL networks,” IEEE Trans. on Signal Processing, vol.56, no.10, pp.4825–4843, Oct.2008.
[77] R. Etkin, A. Parekh, and D. N. C. Tse,“Spectrum sharing for unlicensed bands,” IEEEJournal on Selected Areas in Communications, vol.25, no.3, pp.517–528, Apr.2007.
[78] Y. Su and M. van der Schaar,“A new look at multi-user power control games,” in Proc.IEEE International Conference on Communications, Beijing, China, May2008, pp.1072–1076.
[79]——,“A new perspective on multi-user power control games in interference channels,”IEEE Trans. on Wirel. Commun., vol.8, no.6, pp.2910–2919, Jun.2009.
[80] B. Babadi and V. Tarokh,“Distributed dynamic frequency allocation in wireless networksunder time-varying user activities,” in Proc. IEEE Sarnof Symposium, NJ, USA, Apr.2008, pp.1–5.
[81] J. K. Chen, G. de Veciana, and T. S. Rappaport,“Improved measurement-based frequencyallocation algorithms for wireless networks,” in Proc. IEEE Global TelecommunicationsConference, Washington, D.C., USA, Nov.2007, pp.4790–4795.
[82] B. Babadi and V. Tarokh,“A distributed dynamic frequency allocation algorithm,”2007,arxiv.org/abs/0711.3247.
[83] J. C. Koo, W. Wu, and G. John,“Delay-rate tradeof for ergodic interference alignmentin the Gaussian case,” in48th Annual Allerton Conference on Communication, Control,and Computing, Allerton, USA,2010, pp.1069–1075.
[84] K. Gomadam, V. R. Cadambe, and S. A. Jafar,“Approaching the capacity of wirelessnetworks through distributed interference alignment,” in Proc. IEEE Global Telecommu-nications Conference, New Orleans, LA, USA, Dec.2008, pp.4260–4265.
[85] S. W. Peters and R. W. Heath,“Interference alignment via alternating minimization,”in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing-Proceedings, Taipei, Taiwan, Apr.2009, pp.2445–2448.
[86] C. M. Yetis, T. Gou, S. A. Jafar, and A. H. Kayran,“Feasibility conditions for interferencealignment,” in Proc. IEEE Global Telecommunications Conference, Honolulu, USA, Nov.2009, pp.1–6.
[87] C. X. Shi, D. A. Schmidt, R. A. Berry, M. L. Honig, and W. Utschick,“Distributed in-terference pricing for the MIMO interference channel,” in Proc. the IEEE InternationalConference on Communications, Dresden, Germany, Jun.2009, pp.1–5.
[88] L. H. Grokop, D. N. C. Tse, and R. D. Yates,“Interference alignment for line-of-sightchannels,” IEEE Trans. Inf. Theory, vol.57, no.9, pp.5820–5839, Sep.2011.
[89] W. C. Sang, S. A. Jafar, and S. Chung,“On the beamforming design for efcient interfer-ence alignment,” IEEE Commun. Letters, vol.11, no.13, pp.847–849, Nov.2008.
[90] C. Suh, M. Ho, and D. N. C. Tse,“Downlink interference alignment,” IEEE Tran. onCommun., vol.59, no.9, pp.2616–2626, Sep.2010.
[91] Z. K. M. Ho and D. Gesbert,“Balancing egoism and altruism on interference channel: theMIMO case,” in Proc. IEEE International Conference on Communications, Cape Town,S.africa, May2010, pp.1–5.
[92] F. Negro, S. P. Shenoy, D. T. M. Slock, and I. Ghauri,“Interference alignment limits for K-user frequency-fat MIMO interference channels,” in Proc.17th European Signal ProcessingConference, Glasgow, UK, Aug.2009, pp.2445–2449.
[93] R. Zakhour and D. Gesbert,“Coordination on the MISO interference channel using thevirtual SINR framework,” in Proc. WSA’09, International ITG Workshop on Smart An-tennas, Berlin, Germany, Feb.2009, pp.1–7.
[94] S. A. Jafar and M. J. Fakhereddin,“Degrees of freedom for the MIMO interference chan-nel,” IEEE Trans. Inf. Theory, vol.53, no.7, pp.2637–2642, Jul.2007.
[95] E. Chiu, V. K. N. Lau, H. Huang, T. Wu, and S. Liu,“Robust transceiver design for K-pairs quasi-static MIMO interference channels via semi-defnite relaxation,” IEEE Trans.on Wirel. Commun., vol.9, no.12, pp.3762–3769, Dec.2010.
[96] A. S. Motahari, S. O. Gharan, M. A. Maddah-Ali, and A. K. Khandani,“Realinterference alignment: Exploring the potential of single antenna systems,”2009,arxiv.org/abs/0908.2282.
[97] A. Ghasemi, A. S. Motahari, and A. K. Khandani,“Interference alignment for the K userMIMO interference channel,” in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, USA,Jun.2010, pp.360–364.
[98] R. Tresch, M. Guillaud, and E. Riegler,“On the achievability of interference alignment inthe K-user constant MIMO interference channel,” in Proc. IEEE workshop on Stat. SignalProcessing, Cardif, UK, Aug.2009, pp.277–280.
[99] C. Huang, V. Cadambe, and S. A. Jafar,“Interference alignment and the generalizeddegrees of freedom of the X channel,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea,Jun./Jul.2009, pp.1929–1933.
[100] O. E. Ayach, S. W. Peters, and J. R. W. Heath,“Real world feasibility of interferencealignment using MIMO-OFDM channel measurements,” in Proc. IEEE Conf. MilitaryCommun., Boston, MA, USA, Oct.2009, pp.1–6.
[101] S. A. Jafar and S. Shamai,“Degrees of freedom region of the MIMO X channel,” IEEETrans. Inf. Theory, vol.54, no.1, pp.151–170, Jan.2009.
[102] S. Peters and R. H. Jr,“Orthogonalization to reduce overhead in MIMO interferencechannels,” in Proc. Int. Zurich Semin. Commun., Zurich, Switzerland, Mar.2010, pp.126–129.
[103] R. Tresch and M. Guillaud,“Cellular interference alignment with imperfect channel knowl-edge,” in Proc. IEEE Int. Conf. Commun. Workshops, Dresden, Germany, Jun.2009, pp.1–5.
[104] S. Perlaza, M. Debbah, S. Lasaulce, and J.-M. Chaufray,“Opportunistic interference align-ment in MIMO interference channels,” in Proc. IEEE Int. Symp. Pers., Indr. and Mob.Radio Commun., Cannes, France, Sep.2009, pp.1–5.
[105] A. Khandani, S. Motahari, and B. Nourani,“Relay-aided interference alignment for thequasi-static X channel,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun.2009,pp.1764–1768.
[106] R. Tresch and M. Guillaud,“Clustered interference alignment in large cellular networks,”in Proc. IEEE Int. Symp. Pers. Indr. Mob. Radio Commun., Cannes, France, Sep.2009,pp.1024–1028.
[107] O. E. Ayach, S. W. Peters, and J. R. W. Heath,“The feasibility of interference alignmentover measured MIMO-OFDM channels,” IEEE Trans. Veh. Technol., vol.59, no.9, pp.4309–4321, Nov.2010.
[108] Motorola,“CoMP operation based on spatial covariance feedback and performance resultsof coordinated SU/MU beamforing,”3GPP TSG-RAN WG157, Los Angeles, Tech. Rep.R1-092634,2009.
[109] Y. J. Ma,“Interference alignment and its application in modern wirelss communicationsystems,” Ph.D. dissertation, Xidian University,2012.
[110] W. Noh, H. H. Choi, W. Shin, and C. Y. Shin,“A QoS base low complex rate-split scheme inheterogeneous cellular networks,” in Proc. Global Telecommunications Conference, Miami,FL, USA, Dec.2010, pp.1–6.
[111] L. Electronics,“Multi-layer rate control for SIC-based CoMP,”3GPP TSG-RAN WG1,Tech. Rep. R1-094178,2009.
[112] M. Riemensberger, I. Abdelghani, J. Lenz, and W. Utschick,“Weighted sum rate maxi-mization on two user Gaussian interference channels with rate splitting,” in Proc.43rdAsilomar Conference on Signals, Systems and Computers, Pacifc Grove, CA, USA, Nov.2009, pp.1115–1119.
[113] G. Zhou, G.Bauch, and J. Berkmann,“Weighted sum rate maximization on two user Gaus-sian interference channels with rate splitting,” in Proc. IEEE7th International Conferenceon Wireless and Mobile Computing Networking and Communications, Wuhan, China, Oct.2011, pp.214–221.
[114] G. Zhou, W. Xu, and G.Bauch,“Interference mitigation with rate splitting in multi-cellwireless networks,” in Proc. IEEE8th International Conference on Wireless and MobileComputing, Networking and Communications, Barcelona, Spain, Oct.2012, pp.219–224.
[115] M. A. Maddah-ali, H. Mahdavi-doost, and A. K. Khandani,“Optimal order of decoding forMax-Min fairness in K-user memoryless interference channels,” in Proc. IEEE Int. Symp.Inf. Theory, Glasgow, UK, Jun.2007, pp.2866–2870.
[116] J. M. Jafe,“Bottleneck fow control,” IEEE Trans. on Commu., vol.40, no.4, pp.746–753,1992.
[117] O. Mehanna, J. Marcos, and N. Jindal,“On achievable rates of the two-user symmetricGaussian interference channel,” in Proc.48th Annual Allerton Conference on Communi-cation, Control, and Computing, Allerton, IL, USA, Sep.2010, pp.1273–1279.
[2] R. Ahlswede,“The capacity region of a channel with two senders and two receivers,” TheAnnals of Probability, vol.2, no.5, pp.805–814, Oct.1974.
[3] A. D. Wyner,“Shannon-theoretic approach to a Gaussian cellular multiple-access chan-nel,” IEEE Trans. Inf. Theory, vol.40, no.6, pp.1713–1727, Nov.1994.
[4] O. Somekh, B. M. Zaidel, and S. Shamai,“Sum rate characterization of joint multiplecell-site processing,” IEEE Trans. Inf. Theory, vol.53, no.12, pp.4473–4497, Dec.2007.
[5] Y. Liu and E. Erkip,“On the sum capacity of k-user cascade Gaussian Z-interferencechannel,” in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia,2011, pp.1382–1386.
[6] H. Sato,“On the capacity region of a discrete two-user channel for strong interference,”IEEE Trans. Inf. Theory, vol.24, no.3, pp.377–379, May1978.
[7] M. H. M. Costa and A. A. E. Gamal,“The capacity region of the discrete memorylessinterference channel with strong interference,” IEEE Trans. Inf. Theory, vol.33, no.5, pp.710–711, Sep.1987.
[8] A. B. Carleial,“A case where interference does not reduce capacity,” IEEE Trans. Inf.Theory, vol.21, no.5, pp.569–570, Sep.1975.
[9] A. A. E. Gamal and M. H. M. Costa,“The capacity region of a class of deterministicinterference channels,” IEEE Trans. Inf. Theory, vol.28, no.2, pp.343–346, Mar.1982.
[10] N. Liu and S. Ulukus,“The capacity region of a class of discrete degraded interferencechannels,” IEEE Trans. Inf. Theory, vol.54, no.9, pp.4372–4378, Sep.2008.
[11] R. Benzel,“The capacity region of a class of discrete additive degraded interference chan-nels,” IEEE Trans. Inf. Theory, vol.25, no.2, pp.228–231, Mar.1979.
[12] J. Jiang, Y. Xin, and H. Garg,“Discrete memoryless interference channels with feedback,”in Proc.41st Annual Conference on Information Sciences and Systems, Baltimore, MD,USA, Mar.2007, pp.225–226.
[13] L. Zhang, J. Jiang, and S. Cui,“Achievable rate regions for discrete memoryless interfer-ence channel with state information,” in Proc. IEEE International Conference on Com-munications, Kyoto, Japan, Jun.2011, pp.1–5.
[14] T. Han and K. Kobayashi,“A new achievable rate region for the interference channel,”IEEE Trans. Inf. Theory, vol.27, no.11, pp.49–60, Jan.1981.
[15] H. Sato,“The capacity of the Gaussian interference channel under strong interference,”IEEE Trans. Inf. Theory, vol.27, no.6, pp.786–788, Nov.1981.
[16] X. H. Shang, G. Kramer, and B. Chen,“A new outer bound and the noisy-interferencesum-rate capacity for Gaussian interference channels,” IEEE Trans. Inf. Theory, vol.55,no.2, pp.689–699, Feb.2009.
[17] A. S. Motahari and A. K. Khandani,“A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels,” IEEE Trans. Inf. Theory, vol.55, no.2,pp.620–643, Feb.2009.
[18] V. S. Annapureddy and V. V. Veeravalli,“Gaussian interference networks: sum capacityin the low-interference regime and new outer bounds on the capacity region,” IEEE Trans.Inf. Theory, vol.55, no.7, pp.620–643, Jul.2009.
[19] D. Tuninetti and Y. Weng,“On the Han-Kobayashi achievable region for Gaussian inter-ference channels,” in Proc. IEEE Int. Symp. Inf. Theory, Toronto, Canada, Jul.2008, pp.240–244.
[20] I. Sason,“On achievable rate regions for the Gaussian interference channel,” IEEE Trans.Inf. Theory, vol.50, no.6, pp.1345–1356, Jun.2004.
[21] R. Etkin, D. N. C. Tse, and H. Wang,“Gaussian interference channel capacity to withinone bit,” IEEE Trans. Inf. Theory, vol.54, no.12, pp.5534–5562, Dec.2008.
[22] G. Kramer,“Outer bounds on the capacity of Gaussian interference channels,” IEEETrans. Inf. Theory, vol.50, no.3, pp.581–586, Mar.2004.
[23] G. Bresler, A. Parekh, and D. N. C. Tse,“The approximate capacity of the many-to-oneand one-to-many Gaussian interference channel,” IEEE Trans. Inf. Theory, vol.56, no.9,pp.4566–4592, Sep.2010.
[24] T. Gou and S. A. Jafar,“Degrees of freedom of the K user,” IEEE Trans. Inf. Theory, vol.56, no.12, pp.6040–6057MIMO interferencechannel, Dec.2008.
[25] C. Gong, A. Tajer, and X. Wang,“Interference channel with constrained partial groupdecoding,” IEEE Trans. on Commun., vol.59, no.11, pp.3059–3071, Nov.2011.
[26] V. Cadambe and S. A. Jafar,“Interference alignment and degrees of freedom of the K-userinterference channel,” IEEE Trans. Inf. Theory, vol.54, no.8, pp.3425–3441, Aug.2008.
[27] M. A. Maddah-Ali, A. S. Motahari, and A. K. Khandani,“Communication over MIMO Xchannels: Interference alignment, decomposition, and performance analysis,” IEEE Trans.Inf. Theory, vol.54, no.8, pp.3457–3470, Aug.2008.
[28] V. Cadambe, S. A. Jafar, and S. Shamai,“Interference alignment on the deterministicchannel and application to fully connected Gaussian interference channel,” IEEE Trans.Inf. Theory, vol.55, no.1, pp.269–274, Jan.2009.
[29] A. Ghasemi, A. S. Motahari, and A. K. Khandani,“Interference alignment for the K userMIMO interference channel,” IEEE Trans. Inf. Theory, vol.56, no.12, pp.6040–6057,Dec.2008.
[30] B. Nazer, M. Gastpar, S. A. Jafar, and S. Vi,“Near shannon limit error-correcting codingand decoding: Turbo-codes,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun.2009, pp.1769–1773.
[31] S. A. Jafar and S. Vishwanath,“Generalized degrees of freedom of the symmetric K userGaussian interference channel,” IEEE Trans. Inf. Theory, vol.56, no.7, pp.3297–3303,Jul.2010.
[32] B. Bandemer, G. Vazquez-Vilar, and A. E. Gamal,“On the sum capacity of a class ofcyclically symmetric deterministic interference channels,” in Proc. IEEE Int. Symp. Inf.Theory, Seoul, Korea, Jun./Jul.2009, pp.2622–2626.
[33] A. Jovicic, H. Wang, and P. Viswanath,“On network interference management,” IEEETrans. Inf. Theory, vol.56, no.10, pp.4941–4955, Oct.2010.
[34] B. Bandemer and A. E. Gamal,“Interference decoding for deterministic channels,” IEEETrans. Inf. Theory, vol.57, no.5, pp.2966–2975, May2011.
[35] A. Padakandla, A. Sahebi, and S. Pradhan,“A new achievable rate region for the3-user discrete memoryless interference channel,” in Proc. IEEE Int. Symp. Inf. Theory,Cambridge, MA, USA, Jul.2012, pp.2256–2260.
[36] X. H. Shang, B. C. G. Kramer, and H. V. Poor,“Capacity regions and sum-rate capacitiesof vector Gaussian interference channels,” IEEE Trans. Inf. Theory, vol.56, no.10, pp.5030–5044, Oct.2010.
[37] S. T. Chung, S. J. Kim, J. Lee, and J. M. Ciof,“A game-theoretic approach to powerallocation in frequency-selective Gaussian interference channels,” in Proc. IEEE Int. Symp.Inf. Theory, St. Petersburg, Russia, Jun.2011, pp.316–316.
[38] C. U. Saraydar, N. B. Mandayam, and D. Goodman,“Efcient power control via pricingin wireless data networks,” IEEE Trans. on Commun., vol.50, no.2, pp.291–303, Feb.2002.
[39] J. Huang, R. A. Berry, and M. L. Honig,“Distributed interference compensation for wire-less networks,” IEEE Trans. on Commun., vol.24, no.5, pp.1074–1084, May2006.
[40] F. Wang, M. Krunz, and S. Cui,“Price-based spectrum management in cognitive radionetworks,” IEEE Journal of Selected Topics in Signal Processing, vol.2, no.1, pp.74–87,Feb.2008.
[41] W. Yu, G. Ginis, and J. M. Ciof,“Distributed multiuser power control for digital sub-scriber lines,” IEEE Journal on Selected areas in Communications, vol.20, no.5, pp.1105–1115, Jun.2002.
[42] K. K. Leung, C. W. Sung, and K. W. Shum,“Iterative waterflling for parallel Gaus-sian interference channels,” in Proc. IEEE International Conference on Communications,Istanbul, Turkey, Jun.2006, pp.5491–5494.
[43] G. Scutari, D. P. Palomar, and S. Barbarossa,“Simultaneous iterative water-flling forGaussian frequency-selective interference channels,” in Proc. IEEE Int. Symp. Inf. Theory,Seattle, USA, Jul.2006, pp.600–604.
[44]——,“Asynchronous iterative waterflling for Gaussian frequency-selective interferencechannels: A unifed framework,” in Proc. Information Theory and Applications Workshop,La Jolla, CA, USA, Jan.2007, pp.349–358.
[45] R. Cendrillon, M. M. W. Yu, J. Verliden, and T. Bostoen,“Optimal multiuser spectrumbalancing for digital subscriber lines,” IEEE Trans. on Commun., vol.54, no.5, pp.922–933, Jun.2006.
[46] R. Cendrillon, J. Huang, and C. Mung,“Autonomous spectrum balancing for digital sub-scriber lines,” IEEE Trans. on Signal Processing, vol.55, no.8, pp.4241–4257, Aug.2007.
[47] I. Maric, R. Dabora, and A. Goldsmith,“An outer bound for the Gaussian interferencechannel with a relay,” in Proc. IEEE Information Theory Workshop, Taormina, Italy, Oct.2009, pp.569–573.
[48] Y. Tian and A. Yener,“The Gaussian interference relay channel with a potent relay,” inProc. IEEE Global Telecommunications Conference Globecom, Honolulu, USA, Nov.2009,pp.1–6.
[49] O. Sahin and E. Erkip,“Achievable rates for the Gaussian interference relay channel,”in Proc. Global Telecommunications Conference, Washington, D.C., USA, Nov.2007, pp.1627–1631.
[50] A. Chaaban and A. Sezgin,“On the transmit strategy for the interference MIMO relaychannel in the low power regime,” in Proc.8th Int. ITG Conf. on Source and ChannelCoding, Siegen, Germany, Jan.2010, pp.1–6.
[51] S. Sridharan, S. Vishwanath, S. A. Jafar, and S. Shamai,“On the capacity of cognitive relayassisted Gaussian interference channel,” in Proc. IEEE Int. Symp. Inf. Theory, Toronto,Ontario, Canada, Jul.2008, pp.549–553.
[52] S. Rini, D. Tuninetti, and N. Devroye,“A new capacity result for the Z-Gaussian cognitiveinterference channel,” in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul.2011, pp.2403–2407.
[53] H. Charmchi, G. Hodtani, and M. Nasiri-Kenari,“A new outer bound for a class of in-terference channels with a cognitive relay and a certain capacity result,” IEEE Commun.Letters, vol.17, no.2, pp.241–244, Feb.2013.
[54] E. Sasoglu,“Successive cancellation for cyclic interference channels,” in Proc. InformationTheory Workshop, Porto, Portugal, May2008, pp.36–40.
[55] L. Zhou and W. Yu,“On the capacity of the K-user cyclic Gaussian interference channel,”in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul.2011, pp.1171–1175.
[56] A. Chaaban and A. Sezgin,“On the capacity of a class of multi-user interference channels,”in Proc. International ITG Workshop on Smart Antennas, Aachen, Germany, Feb.2011,pp.1–5.
[57] R. Tandon and H. V. Poor,“On the symmetric feedback capacity of the K-user cyclicinterference channel,” in Proc.14th Annual Allerton Conference Allerton House, UIUC,Illinois, USA, Sep.2011, pp.28–30.
[58] N. Liu and S. Ulukus,“On the capacity region of the Gaussian Z-channel,” in Proc. IEEEGlobal Telecommunications Conference, Dallas, TX, USA, Nov.2004, pp.415–419.
[59] M. Mirmohseni, B. Akhbari, and M. Aref,“Capacity bounds for the three-user cognitiveZ-interference channel,” in Proc. Canadian Workshop on Information Theory, Kelowna,BC, Canada, May2011, pp.34–37.
[60] J. Mao, J. Gao, and a. G. X. Y.N. Liu,“On the ergodic capacity of fading cognitive radioMIMO Z-interference channel,” IEEE Commun. Letters, vol.15, no.11, pp.1166–1168,Nov.2011.
[61] M. Vaezi and V. Mai,“On the capacity of the cognitive Z-interference channel,” in Proc.Canadian Workshop on Information Theory, Kelowna, BC, Canada, May2011, pp.30–33.
[62] J. Jiang, I. Maric, A. Goldsmith, S. Shamai, and S. Cui,“On the capacity of a class ofcognitive Z-interference channels,” in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg,Russia, Jun.2011, pp.1–6.
[63] E. Stathakis, M.Skoglund, and L. Rasmussen,“On combined beamforming and OSTBCover the cognitive radio z-channel with partial CSI,” in Proc. IEEE International Confer-ence on Communications, Ottawa, Canada, Jun.2012, pp.2380–2384.
[64] N. Liu, I. I. Maric, A. Goldsmith, and S. Shamai,“Capacity bounds and exact results forthe cognitive Z-interference channel,” IEEE Trans. Inf. Theory, vol.59, no.2, pp.886–893,Feb.2013.
[65] F. Khan, T. Ratnarajah, and S. Prakriya,“Outage performance of causal cognitive radioZ-interference fading channel with cognitive relaying,” in Proc. International Conferenceon Signal Processing and Communications, Bangalore, India, Jul.2010, pp.1–5.
[66] S. Mohajer, S. Diggavi, C. Fragouli, and D. Tse,“Approximate capacity of a class ofGaussian interference-relay networks,” IEEE Trans. Inf. Theory, vol.57, no.2, pp.2837–2864, May2011.
[67] L. Zhou and W. Yu,“Gaussian Z-interference channel with a relay link: Achievabilityregion and asymptotic sum capacity,” IEEE Trans. Inf. Theory, vol.58, no.4, pp.2413–2426, Apr.2012.
[68] R. Sirigina, A. Madhukumar, and Q. Li,“Performance analysis of Z-channel with relay un-der rayleigh fading and discrete constellations,” in Proc. IEEE Wireless Communicationsand Networking Conference, Shanghai, China, Apr.2012, pp.92–96.
[69] A. Leshem and E. Zehavi,“Cooperative game theory and the Gaussian interference chan-nel,” IEEE Journal on Selected Areas in Communications, vol.26, no.7, pp.1078–1088,Sep.2008.
[70] J. E. Suris, L. A. Dasilva, Z. Han, and A. B. MacKenzie,“Cooperative game theory fordistributed spectrum sharing,” in Proc. the IEEE International Conference on Communi-cations, Glasgow, UK, Jun.2007, pp.5282–5287.
[71] A. Laufer, A. Leshem, and H. Messer,“Game theoretic aspects of distributed spectralcoordination with application to DSL networks,”2006, http://arxiv.org/abs/cs/0602014.
[72] Z. Q. Luo and J. S. Pang,“Analysis of iterative water flling algorithm for multiuser powercontrol in digital subscriber lines,” EURASIP Journal on Applied Signal Processing, pp.1–10,2006.
[73] K. W. Shum, K. K. Leung, and C. W. Sung,“Convergence of iterative waterflling algo-rithm for Gaussian interference channels,” IEEE Journal on Selected areas in Communi-cations, vol.25, no.6, pp.1091–1100, Aug.2007.
[74] R. Cendrillon, W. Yu, and M. Marc,“Optimal multi-user spectrum management for digitalsubscriber lines,” in Proc. IEEE International Conference on Communications, Paris,France, Jun.2004, pp.1–5.
[75] R. Cendrillon and M. Moonen,“Iterative spectrum balancing for digital subscriber lines,”in Proc. IEEE International Conference on Communications, Seoul, South Korea, May2005, pp.1937–1941.
[76] P. Tsiafakis, M. Diehl, and M. Moonen,“Distributed spectrum management algorithmsfor multiuser DSL networks,” IEEE Trans. on Signal Processing, vol.56, no.10, pp.4825–4843, Oct.2008.
[77] R. Etkin, A. Parekh, and D. N. C. Tse,“Spectrum sharing for unlicensed bands,” IEEEJournal on Selected Areas in Communications, vol.25, no.3, pp.517–528, Apr.2007.
[78] Y. Su and M. van der Schaar,“A new look at multi-user power control games,” in Proc.IEEE International Conference on Communications, Beijing, China, May2008, pp.1072–1076.
[79]——,“A new perspective on multi-user power control games in interference channels,”IEEE Trans. on Wirel. Commun., vol.8, no.6, pp.2910–2919, Jun.2009.
[80] B. Babadi and V. Tarokh,“Distributed dynamic frequency allocation in wireless networksunder time-varying user activities,” in Proc. IEEE Sarnof Symposium, NJ, USA, Apr.2008, pp.1–5.
[81] J. K. Chen, G. de Veciana, and T. S. Rappaport,“Improved measurement-based frequencyallocation algorithms for wireless networks,” in Proc. IEEE Global TelecommunicationsConference, Washington, D.C., USA, Nov.2007, pp.4790–4795.
[82] B. Babadi and V. Tarokh,“A distributed dynamic frequency allocation algorithm,”2007,arxiv.org/abs/0711.3247.
[83] J. C. Koo, W. Wu, and G. John,“Delay-rate tradeof for ergodic interference alignmentin the Gaussian case,” in48th Annual Allerton Conference on Communication, Control,and Computing, Allerton, USA,2010, pp.1069–1075.
[84] K. Gomadam, V. R. Cadambe, and S. A. Jafar,“Approaching the capacity of wirelessnetworks through distributed interference alignment,” in Proc. IEEE Global Telecommu-nications Conference, New Orleans, LA, USA, Dec.2008, pp.4260–4265.
[85] S. W. Peters and R. W. Heath,“Interference alignment via alternating minimization,”in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing-Proceedings, Taipei, Taiwan, Apr.2009, pp.2445–2448.
[86] C. M. Yetis, T. Gou, S. A. Jafar, and A. H. Kayran,“Feasibility conditions for interferencealignment,” in Proc. IEEE Global Telecommunications Conference, Honolulu, USA, Nov.2009, pp.1–6.
[87] C. X. Shi, D. A. Schmidt, R. A. Berry, M. L. Honig, and W. Utschick,“Distributed in-terference pricing for the MIMO interference channel,” in Proc. the IEEE InternationalConference on Communications, Dresden, Germany, Jun.2009, pp.1–5.
[88] L. H. Grokop, D. N. C. Tse, and R. D. Yates,“Interference alignment for line-of-sightchannels,” IEEE Trans. Inf. Theory, vol.57, no.9, pp.5820–5839, Sep.2011.
[89] W. C. Sang, S. A. Jafar, and S. Chung,“On the beamforming design for efcient interfer-ence alignment,” IEEE Commun. Letters, vol.11, no.13, pp.847–849, Nov.2008.
[90] C. Suh, M. Ho, and D. N. C. Tse,“Downlink interference alignment,” IEEE Tran. onCommun., vol.59, no.9, pp.2616–2626, Sep.2010.
[91] Z. K. M. Ho and D. Gesbert,“Balancing egoism and altruism on interference channel: theMIMO case,” in Proc. IEEE International Conference on Communications, Cape Town,S.africa, May2010, pp.1–5.
[92] F. Negro, S. P. Shenoy, D. T. M. Slock, and I. Ghauri,“Interference alignment limits for K-user frequency-fat MIMO interference channels,” in Proc.17th European Signal ProcessingConference, Glasgow, UK, Aug.2009, pp.2445–2449.
[93] R. Zakhour and D. Gesbert,“Coordination on the MISO interference channel using thevirtual SINR framework,” in Proc. WSA’09, International ITG Workshop on Smart An-tennas, Berlin, Germany, Feb.2009, pp.1–7.
[94] S. A. Jafar and M. J. Fakhereddin,“Degrees of freedom for the MIMO interference chan-nel,” IEEE Trans. Inf. Theory, vol.53, no.7, pp.2637–2642, Jul.2007.
[95] E. Chiu, V. K. N. Lau, H. Huang, T. Wu, and S. Liu,“Robust transceiver design for K-pairs quasi-static MIMO interference channels via semi-defnite relaxation,” IEEE Trans.on Wirel. Commun., vol.9, no.12, pp.3762–3769, Dec.2010.
[96] A. S. Motahari, S. O. Gharan, M. A. Maddah-Ali, and A. K. Khandani,“Realinterference alignment: Exploring the potential of single antenna systems,”2009,arxiv.org/abs/0908.2282.
[97] A. Ghasemi, A. S. Motahari, and A. K. Khandani,“Interference alignment for the K userMIMO interference channel,” in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, USA,Jun.2010, pp.360–364.
[98] R. Tresch, M. Guillaud, and E. Riegler,“On the achievability of interference alignment inthe K-user constant MIMO interference channel,” in Proc. IEEE workshop on Stat. SignalProcessing, Cardif, UK, Aug.2009, pp.277–280.
[99] C. Huang, V. Cadambe, and S. A. Jafar,“Interference alignment and the generalizeddegrees of freedom of the X channel,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea,Jun./Jul.2009, pp.1929–1933.
[100] O. E. Ayach, S. W. Peters, and J. R. W. Heath,“Real world feasibility of interferencealignment using MIMO-OFDM channel measurements,” in Proc. IEEE Conf. MilitaryCommun., Boston, MA, USA, Oct.2009, pp.1–6.
[101] S. A. Jafar and S. Shamai,“Degrees of freedom region of the MIMO X channel,” IEEETrans. Inf. Theory, vol.54, no.1, pp.151–170, Jan.2009.
[102] S. Peters and R. H. Jr,“Orthogonalization to reduce overhead in MIMO interferencechannels,” in Proc. Int. Zurich Semin. Commun., Zurich, Switzerland, Mar.2010, pp.126–129.
[103] R. Tresch and M. Guillaud,“Cellular interference alignment with imperfect channel knowl-edge,” in Proc. IEEE Int. Conf. Commun. Workshops, Dresden, Germany, Jun.2009, pp.1–5.
[104] S. Perlaza, M. Debbah, S. Lasaulce, and J.-M. Chaufray,“Opportunistic interference align-ment in MIMO interference channels,” in Proc. IEEE Int. Symp. Pers., Indr. and Mob.Radio Commun., Cannes, France, Sep.2009, pp.1–5.
[105] A. Khandani, S. Motahari, and B. Nourani,“Relay-aided interference alignment for thequasi-static X channel,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun.2009,pp.1764–1768.
[106] R. Tresch and M. Guillaud,“Clustered interference alignment in large cellular networks,”in Proc. IEEE Int. Symp. Pers. Indr. Mob. Radio Commun., Cannes, France, Sep.2009,pp.1024–1028.
[107] O. E. Ayach, S. W. Peters, and J. R. W. Heath,“The feasibility of interference alignmentover measured MIMO-OFDM channels,” IEEE Trans. Veh. Technol., vol.59, no.9, pp.4309–4321, Nov.2010.
[108] Motorola,“CoMP operation based on spatial covariance feedback and performance resultsof coordinated SU/MU beamforing,”3GPP TSG-RAN WG157, Los Angeles, Tech. Rep.R1-092634,2009.
[109] Y. J. Ma,“Interference alignment and its application in modern wirelss communicationsystems,” Ph.D. dissertation, Xidian University,2012.
[110] W. Noh, H. H. Choi, W. Shin, and C. Y. Shin,“A QoS base low complex rate-split scheme inheterogeneous cellular networks,” in Proc. Global Telecommunications Conference, Miami,FL, USA, Dec.2010, pp.1–6.
[111] L. Electronics,“Multi-layer rate control for SIC-based CoMP,”3GPP TSG-RAN WG1,Tech. Rep. R1-094178,2009.
[112] M. Riemensberger, I. Abdelghani, J. Lenz, and W. Utschick,“Weighted sum rate maxi-mization on two user Gaussian interference channels with rate splitting,” in Proc.43rdAsilomar Conference on Signals, Systems and Computers, Pacifc Grove, CA, USA, Nov.2009, pp.1115–1119.
[113] G. Zhou, G.Bauch, and J. Berkmann,“Weighted sum rate maximization on two user Gaus-sian interference channels with rate splitting,” in Proc. IEEE7th International Conferenceon Wireless and Mobile Computing Networking and Communications, Wuhan, China, Oct.2011, pp.214–221.
[114] G. Zhou, W. Xu, and G.Bauch,“Interference mitigation with rate splitting in multi-cellwireless networks,” in Proc. IEEE8th International Conference on Wireless and MobileComputing, Networking and Communications, Barcelona, Spain, Oct.2012, pp.219–224.
[115] M. A. Maddah-ali, H. Mahdavi-doost, and A. K. Khandani,“Optimal order of decoding forMax-Min fairness in K-user memoryless interference channels,” in Proc. IEEE Int. Symp.Inf. Theory, Glasgow, UK, Jun.2007, pp.2866–2870.
[116] J. M. Jafe,“Bottleneck fow control,” IEEE Trans. on Commu., vol.40, no.4, pp.746–753,1992.
[117] O. Mehanna, J. Marcos, and N. Jindal,“On achievable rates of the two-user symmetricGaussian interference channel,” in Proc.48th Annual Allerton Conference on Communi-cation, Control, and Computing, Allerton, IL, USA, Sep.2010, pp.1273–1279.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |