Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/8470
標題: 有限狀態馬可夫通道之效能模型及其應用
The FSMC-based Performance Models and Their Applications
作者: 李世詠
Lee, Shi-Yong
關鍵字: FSMC;有限狀態馬可夫通道;SSPC;Cooperative communication;單一步階功率控制;合作式通訊
出版社: 電機工程學系所
引用: [1] P. Sadeghi, R. Kennedy, P. Rapajic, and R. Shams, “Finite-state Markov modeling of fading channels - a survey of principles and applications,” IEEE Signal Processing Mag., vol. 25, no. 5, pp. 57-80, Sept. 2008. [2] S. Ariyavisitakul, “SIR-based power control in a CDMA system,” in Proc. IEEE GLOBECOM, Dec. 1992, pp. 868-873. [3] L. C. Wang and C. W. Chang, “Error statistics of closed-loop power control in multirate DS-CDMA cellular systems,” in Proc. IEEE WCNC2002, Mar. 2002, pp. 712-716. [4] S. Gunarate, S. Nourizadeh, T. Jeans, and R. Tafazolli, “Performance of SIRbased power control for UMTS,” in Proc. IEEE 3G Mobile Communication Technologies, Mar. 2001, pp. 16-20. [5] A. Chockalingam and L. Milstein, “Closed-loop power control performance in a cellular CDMA system,” in Proc. IEEE Signals, Systems and Computers, Nov. 1995, pp. 362-366. [6] L. Song, N. B. Mandayam, and Z. Gajic, “Analysis of an up/down power control algorithm for the CDMA reverse link under fading,” IEEE J. Select. Areas Commun., vol. 19, pp. 227-286, Feb. 2001. [7] S. Nourizadeh, T. Jeans, and R. Tafazolli, “Analytical performance of closed loop power control quanized under fast fading for CDMA techniques,” in Proc. IEEE VTC2003, Oct. 2003, pp. 952-956. [8] P. A. Dighe, R. K. Mallik, and S. S. Jamuar, “Analysis of Transmit-Receivediversity in Rayleigh fading,” IEEE Trans. Commun., vol. 51, pp. 694-703, Apr. 2003. [9] M. Kang and M.-S. Alouini, “Largest eigenvalue of complex Wishart matrices and performance analysis of MIMO MRC systems,” IEEE J. Select. Areas Commun., vol. 21, pp. 418-426, Apr. 2003. [10] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity- part I: System description,” IEEE Trans. Commun., vol. 51, pp. 1927-1938, Nov. 2003. [11] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” IEEE Trans. Inform. Theory, vol. 50, pp. 3062-3079, Dec. 2004. [12] W. Su, A. K. Sadek, and K. J. R. Liu, “SER performance analysis and optimum power allocation for decode-and-forward cooperation protocol in wireless networks,” in Proc. IEEE WCNC05, Mar. 2005, pp. 984-989. [13] Z. Han and H. V. Poor, “Lifetime improvement of wireless sensor networks by collaborative beamforming and cooperative transmission,” in Proc. IEEE ICC07, June 2007, pp. 3954 - 3958. [14] A. K. Sadek, Z. Han, and K. J. R. Liu, “An efficient cooperation protocol to extend coverage area in cellular networks,” in Proc. IEEE WCNC06, Mar. 2006, pp. 1687 - 1692. [15] X. Qiu and K. Chawla, “On the performance of adaptive modulation in cellular systems,” IEEE Trans. Commun., vol. 47, pp. 884-895, 1999. [16] H. Chen and M. H. Ahmed, “Throughput enhancement in cooperative diversity wireless networks using adaptive modulation,” in CCECE2008, May 2008, pp. 527-530. [17] E. Yazdian and M. R. Pakravan, “Adaptive modulation technique for cooperative diversity in wireless fading channel,” in Proc. IEEE PIMRC06, Sept. 2006, pp. 1-5. [18] M. O. Hasna, “On the capacity of cooperative diversity systems with adaptive modulation,” in Proc. IEEE WOCN05, Mar. 2005, pp. 432 - 436. [19] K.-S. Hwang, Y.-C. Ko, and M.-S. Alouini, “A study of multi-hop cooperative diversity system,” in Proc. IEEE APCC06, Aug. 2006, pp. 1 - 5. [20] M. Elfituri, W. Hamouda, and A. Ghrayed, “Performance analysis of a new transmission scheme for multi-relay channels,” in Proc. IEEE SIPS06, Oct. 2006, pp. 34 - 38. [21] D. Chen and J. N. Laneman, “Cooperative diversity for wireless fading channels without channel state information,” in Proc. IEEE ACSSC04, Nov. 2004, pp. 1307 - 1312. [22] A. H. Madsen, “Capacity bounds for cooperative diversity,” IEEE Trans. Inform. Theory, vol. 52, pp. 1522-1544, Apr. 2006. [23] F. A. Onat, A. Adinoyi, Y. Fan, H. Yanikomeroglu, and H. Yanikomeroglu,“Optimum threshold for SNR-based selective digital relaying schemes in cooperative wireless networks,” in Proc. IEEE WCNC07, Mar. 2007, pp. 969-974. [24] K.-S. Hwang and Y.-C. Ko, “An efficient relay selection algorithm for cooperative networks,” in Proc. IEEE VETECF07, Sept. 2007, pp. 81-85. [25] K. Tourki, M.-S. Alouini, and L. Deneire, “Blind cooperative diversity with multiple relays,” in Proc. IEEE ISWPC08, May 2008, pp. 731-735. [26] S. Nam, M. Vu, and V. Tarokh, “Relay selection methods for wireless cooperative communications,” in Proc. IEEE CISS08, Mar. 2008, pp. 859-864. [27] A. Muller and J. Speidel, “Adaptive modulation for wireless multihop systems with regenerative relays,” in Proc. IEEE VTC2008, Sept. 2008, pp. 1-5. [28] S. Hares, H. Yanikomeroglu, and B. Hashem, “Diversity-and AMC (adaptive modulation and coding)-aware routing in TDMA multihop networks,” in Proc. IEEE GLOBECOM'03, Dec. 2003, pp. 458-463. [29] M. Mardani, J. S. Harsini, F. Lahouti, and B. Eliasi, “Joint adaptive modulation-coding and cooperative ARQ for wireless relay networks,” in Proc. IEEE ISWCS'08, Oct. 2008, pp. 319-323. [30] K.-S. Hwang, Y.-C. Ko, and M.-S. Alouini, “Low complexity cooperative communication with switched relay selection and adaptive modulation,” in Proc. IEEE VTC2009, Apr. 2009, pp. 1-5. [31] T. Tang, C.-B. Chae, J. RobertW. Heath, and S. Cho, “LTomlinson-Harashima precoding with adaptive modulation for fixed relay networks,” in Proc. IEEE SPAWC'06, July 2006, pp. 1-5. [32] H. Wang, C. Xiong, and V. B. Iversen, “Uplink capacity of multi-class IEEE 802.16j relay networks with adaptive modulation and coding,” in Proc. IEEE ICC'09, June 2009, pp. 1-6. [33] P. Kalansuriya and C. Tellambura, “Performance analysis of decode-andforward relay network under adaptive M-QAM,” in Proc. IEEE ICC2009, June 2009. [34] T. Nechiporenko, P. Kalansuriya, and C. Tellambura, “Performance of optimum switching adaptive M-QAM for amplify-and-forward relays,” IEEE Trans. Veh. Technol., vol. 58, no. 5, pp. 2258-2268, June 2009. [35] E. Gilbert, “Capacity of a burst-noise channel,” Bell Syst. Tech. J., vol. 39, no. 9, pp. 1253-1265, Sept. 1960. [36] E. Elliott, “Estimates of error rates for codes on burst-noise channels,” Bell Syst. Tech. J., vol. 42, no. 5, pp. 1977-1997, Sept. 1963. [37] R. McCullough, “The binary regenerative channel,” Bell Syst. Tech. J., vol. 47, pp. 1713-1735, Oct. 1968. [38] B. Fritchman, “A binary channel characterization using partitioned Markov chains,” IEEE Trans. Inform. Theory, vol. IT-13, no. 2, pp. 221-227, Apr. 1967. [39] J. Garcia-Frias and J. Villasenor, “Turbo decoding of Gilbert-Elliott channels,”IEEE Trans. Commun., vol. 50, no. 3, pp. 357-363, Mar. 2002. [40] ——, “Decoding of low-density parity-check codes over finite-state binary Markov channels,” IEEE Trans. Commun., vol. 52, no. 11, pp. 1840-1843, Nov. 2004. [41] L. Rabiner, “A tutorial on hidden Markov models and selected application in speech recognition,” in Proc. IEEE, Feb. 1989, pp. 257-286. [42] W. C. Jakes, Microwave Mobile Communications. John Wiley and Sons, 1975. [43] C. Tan and N. Beaulieu, “On first-order Markov modeling for the Rayleigh fading channel,” IEEE Trans. Commun., vol. 48, no. 12, pp. 2032-2040, Dec. 2000. [44] F. Babich, O. Kelly, and G. Lombardi, “Generalized Markov modeling for flat fading,” IEEE Trans. Commun., vol. 48, no. 4, pp. 547-551, Apr. 2000. [45] M. Chu, D. Goeckel, andW. Stark, “On the design of Markov models for fading channal,” in Proc. IEEE VTC, Sept. 1999, pp. 2372-2376. [46] A. Chockalingam, M. Zorzi, L. Milstein, and P. Venkataram, “erformance of a wireless access protocol on correlated Rayleigh-fading channels with capture,” IEEE Trans. Commun., vol. 46, no. 5, pp. 644-655, May 1998. [47] W. Turin and R. van Nobelen, “Hidden Markov modeling of flat fading channels,” IEEE J. Select. Areas Commun., vol. 16, no. 9, pp. 1809-1817, Dec. 1998. [48] C. Iskander and P. Mathiopoulos, “Fast simulation of diversity Nakagami fading channels using finite-state Markov models,” IEEE Trans. Broadcast., vol. 49, no. 3, pp. 269-277, Sept. 2003. [49] M. Zorzi, R. Rao, and L. Milstein, “ARQ error control for fading mobile radio channels,” IEEE Trans. Veh. Technol., vol. 46, no. 2, pp. 445-455, May 1997. [50] C. Pimentel, T. Falk, and L. Lisboa, “Finite-state Markov modeling of correlated rician-fading channels,” IEEE Trans. Veh. Technol., vol. 53, no. 5, pp. 1491-1501, Sept. 2004. [51] H. Wang and N. Moayeri, “Finite-state Markov channel - a useful model for radio communication channels,” IEEE Trans. Veh. Technol., vol. 44, no. 1, pp. 163-171, Feb. 1995. [52] Y. Guan and L. Turner, “Generalised FSMC model for radio channels with correlated fading,” in Proc. Inst. Elect. Eng. Commun., vol. 146, no. 2, Apr. 1999, pp. 133-137. [53] Q. Zhang and S. Kassam, “Finite-state Markov model for Rayleigh fading channels,” IEEE Trans. Commun., vol. 46, no. 11, pp. 1688-1692, Nov. 1999. [54] J. Arauz and P. Krishnamurthy, “A study of different partitioning schemes in first order Markovian models for Rayleigh fading channels,” in Proc. IEEE Int. Symp. Wireless, Personal, and Multimedia Commun., Oct. 2002, pp. 277-281. [55] F. Babich and G. Lombardi, “A Markov model for the mobile propagation channel,” IEEE Trans. Veh. Technol., vol. 49, no. 1, pp. 63-73, Jan. 2000. [56] M. Chang and S. Lee, “Modeling of single-step power control scheme in finitestate Markov channel and its impact on queuing performance,” IEEE Trans. Veh. Technol., vol. 58, no. 4, pp. 1711-1721, May 2009. [57] A. Goldsmith and P. Varaiya, “Capacity, mutual information, and coding for finite-state Markov channels,” IEEE Trans. Inform. Theory, vol. 42, no. 3, pp. 868-886, May 1996. [58] L. Li and A. Goldsmith, “Low-complexity maximum-likelihood detection of coded signals sent over finite-state Markov channels,” IEEE Trans. Commun., vol. 50, no. 4, pp. 524-531, Apr. 2002. [59] Z. Krusevac, R. Kennedy, and P. Rapajic, “Optimal implicit channel estimation for finite state Markov communication channels,” in Proc. IEEE ISIT, July 2006, pp. 2657-2661. [60] A. Eckford, F. Kschischang, and S. Pasupathy, “Analysis of low-density paritycheck codes for the gilbert-elliott channel,” IEEE Trans. Inform. Theory, vol. 51, no. 11, pp. 3872-3889, Nov. 2005. [61] T. Li, X. Jin, and O. Collins, “Successive decoding for finite state Markov modelled flat fading channels,” in Proc. IEEE ISIT, July 2006, pp. 11-15. [62] E. Ratzer, “Low-density parity-check codes on Markov channels,” in Proc. 2nd IMA Conf. Mathematics in Communications, Dec. 2002. [63] M. Riediger and E. Shwedyk, “Communication receivers based on Markov models of the fading channel,” in Proc. Inst. Elect. Eng. Commun., Aug. 2003, pp. 275-279. [64] C. Komninakis and R. Wesel, “Joint iterative channel estimation and decoding in flat correlated Rayleigh fading,” IEEE J. Select. Areas Commun., vol. 19, no. 9, pp. 1706-1717, Sept. 2001. [65] P. Sadeghi, V. Trajkovic, and P. Rapajic, “Implicit and explicit receiver training in flat fading channels modeled as finite state Markov processes,” in Proc. IEEE ISIT, June 2003, p. 95. [66] D. Djonin and V. Krishnamurthy, “V-BLAST power and rate control under delay constraints in markovian fading channels - Optimality of monotonic policies,” in Proc. IEEE ISIT, July 2006, pp. 2099-2103. [67] A. Hoang and M. Motani, “Buffer and channel adaptive transmission over fading channels with imperfect channel state information,” in Proc. IEEE WCNC, Mar. 2004, pp. 1891-1896. [68] A. Karmokar, D. Djonin, and V. Bhargava, “Optimal and suboptimal packet scheduling over correlated time varying flat fading channels,” IEEE Trans. Wireless Commun., vol. 5, no. 2, pp. 446-456, Feb. 2006. [69] H. Wang and N. Mandayam, “Opportunistic file transfer over a fading channel under energy and delay constraints,” IEEE Trans. Commun., vol. 53, no. 4, pp. 632-644, Apr. 2005. [70] L. Johnston and V. Krishnamurthy, “Opportunistic file transfer over a fading channel: A POMDP search theory formulation with optimal threshold policies,” IEEE Trans. Wireless Commun., vol. 5, no. 2, pp. 394-405, Feb. 2006. [71] A. Karmokar, D. Djonin, and V. Bhargava, “POMDP-based coding rate adaptation for type-I hybrid ARQ systems over fading channels with memory,” IEEE Trans. Wireless Commun., vol. 5, no. 12, pp. 3512-3523, Dec. 2006. [72] J. G. Proakis, Digital Communication, 4th ed. McGraw-Hill, 2000. [73] C. Tan and N. Beaulieu, “Infinite series representations of the bivariate Rayleigh and Nakagami-m distributions,” IEEE Trans. Commun., vol. 45. [74] R. B. Cooper, Introduction to Queueing Theory, 2nd ed. Oxford, 1981. [75] M. L. Sim and H. T. Chuah, “Received signal statistics in DS-CDMA channels with flat Rayleigh fading and fast closed-loop power control,” IEEE Trans. Commun., vol. 51, pp. 1040-1045, July 2003. [76] K. S. Ahn, R. W. H. Jr., and H. K. Baik, “Shannon capacity and symbol error rate of space-time block codes in MIMO Rayleigh channels with channel estimation error,” IEEE Trans. Wireless Commun., vol. 7, pp. 324-333, Jan. 2008. [77] W. Siriwongpairat, T. Himsoon, W. Su, and K. J. R. Liu, “Optimum thresholdselection relaying for decode-and-forward cooperation protocol,” in Proc. IEEE WCNC2006, Apr. 2006, pp. 1015-1020. [78] T. S. Rappaport, Wireless Communication Priciples and Practice, 1st ed. Prentice-Hall, 1996. [79] T. M. Cover and J. A. Thomast, Elements of Information Theory, 1st ed. John Wiley and Sons, 1991. [80] P. Ivanis, D. Drajic, and B. Vucetic, “Performance evaluation of adaptive MIMO-MRC systems with imperfect CSI by a Markov model,” in Proc. IEEE VTC2007, Apr. 2007, pp. 1496-1500.
摘要: 
本論文主要探討使用有限狀態馬可夫通道於不同通訊系統中的系統效能模型及其應用。此研究分為兩個部份,其一我們提出在理想反饋通道下單一步階功率控制系統的效能分析及模型,此分析協助我們建立其佇列變動模型。藉此,系統可以在同時維持單一步階功率控制效能及溢位機率之條件下,決定最佳緩衝器容量。再者我們亦研究於非理想反饋通道下單一步階功率控制系統之效能模型,此研究包含三種非理想反饋通道,其一造成反饋命令錯誤,其二導致反饋命令遺失,其三產生反饋命令延遲。此研究中提出的模型將協助我們瞭解單一步階功率控制系統之特性。
本論文研究的第二個部份,我們將有限狀態馬可夫通道應用於使用適應性調變之解碼後轉傳合作通訊系統,並提出兩種模型。其一為調變模式變動模型,其二為每一中繼點之解碼行為模型。在此研究的開端我們藉由研究一理想協定以了解此系統之最佳效能,接著提出兩種中繼點選擇協定,其中最佳化協定需參考即時通道狀態資訊,而次佳化協定則需利用通道分佈資訊。最後亦有延伸的模擬實驗以驗證所提出模型之正確性,並展示所提協定之可用性。

In this dissertation, we primarily study the performance models of different communication protocols and their applications when the finite-state Markov channel (FSMC) model is adopted as the channel variation model. This work is divided into two parts. In the first part of this work, the performance modeling for a single step power control (SSPC) system is proposed under the situation that the feedback channel is perfect. This understanding helps us construct a queuing variation model. This queuing variation model can determine the optimal buffer size of the system while maintaining the performance of SSPC and the probability of overflow.
Furthermore, the performance modeling of SSPC under imperfect feedback channel is also investigated. Three scenarios of imperfect feedback channel are considered in
this part. One is the feedback channel introduces error to the feedback command. The other is the feedback channel erases the feedback command. Another is the feedback channel induces the transmission delay to the feedback command. The proposed four performance models help us understand the behavior of SSPC.
The second part in this work is to make use of FSMC in a decode-and-forward (DF) cooperative communication system with adaptive modulation (AM), in where two models are proposed. One is the model of modulation mode variation and
the other is the model of the decoding behavior at each relay. In the beginning of this part, an ideal protocol is studied in order to access the ideal performance of the DF cooperative communication system with AM. Then two relay selection protocols are proposed based on the instantaneous channel state information and channel distribution information, which are referred to the optimal protocol and the suboptimal protocol, respectively. Followed by them are the extensive simulations, which are conducted to validate the proposed models and to show the workability of the proposed protocols in this work.
URI: http://hdl.handle.net/11455/8470
其他識別: U0005-1201201020060600
Appears in Collections:電機工程學系所

Show full item record
 

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.