Responsive image
博碩士論文 etd-0811108-164936 詳細資訊
Title page for etd-0811108-164936
論文名稱
Title
應用於叢聚式之合作通訊網路中的分散式偵測與估測
Joint Distributed Detection and Estimation for Cooperative Communication in Cluster-Based Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
46
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2008-07-26
繳交日期
Date of Submission
2008-08-11
關鍵字
Keywords
最大期望、壓縮前送、合作式通訊、通道估測
compress-and-forward (CF), expectation maximization (EM), channel estimation, cooperative communication
統計
Statistics
本論文已被瀏覽 5663 次,被下載 14
The thesis/dissertation has been browsed 5663 times, has been downloaded 14 times.
中文摘要
在此篇論文中,我們以壓縮前送(Compress-and-Forward, CF)的概念為基礎之下提出了一個新的架構,此方法利用最大期望(Expectation Maximization, EM)演算法來使整體效能收斂至局部最佳解。
根據最大期望演算法的特性,當我們給定不同的初始值時,整體效能會收斂至不同的局部最佳解。在我們所提出的方法之中,目的地端會將所得到之較佳的偵測結果給回傳至中繼端,作為下一次運算的初始值,藉由所回傳之較佳的判斷值,在中繼端不斷的疊代求解出新的局部最佳解,接著再將中繼端所偵測得到之解傳送到目的地端,進而求解出最終欲得到的訊號。此方法中,我們還可以在中繼端利用最大期望演算法來估測通道,因此我們將所提出的方法稱為分散式偵測與估測。從模擬圖中我們可以明顯的看出,所提出的架構可使整體效能在疊代的過程中逐步改善,最終收斂到局部最佳解。
Abstract
In this thesis, a new scheme based on the concept of compress-and-forward (CF) technique has been proposed. And expectation maximization (EM) algorithm is utilized to attain the aim of converging to a local optimum solution. According to the characteristic of EM algorithm, destination node would feed back a better decision to the relay node to be the next initial value. After the iteration, relay node would obtain a better detection result which would converge to a local optimum performance. At last the destination node would receive the optimum detection result from each relay and make a final decision. In the new structure, channel estimation can also be made at the relay node by EM algorithm, which is the reason why it is called joint distributed detection and estimation. Simulation shows that the proposed scheme would acquire an iteration gain at both the relay and destination node.
目次 Table of Contents
Chapter 1 Introduction......................................................1
1.1 EM Algorithm..................................................................5
Chapter 2 Problem Statement and System.................8
Chapter 3 Derivation of Relay Decision Rules and Destination Rules.............................................................12
3.1 Joint Detection and Estimation at the Relay Nodes..................................................................................12
3.2 Joint Detection and Estimation at the Destination Node....................................................................................17
3.2.1 Initial Step..............................................................17
3.2.2 With Memory for Past Local Decisions............21
Chapter 4 Simulation.....................................................28
Chapter 5 Conclusion....................................................35
Abbreviation........................................................................36
References.........................................................................37
參考文獻 References
[1] T. M. Cover and A. A. E. Gamal, “Capacity theorems for the relay channel,” IEEE Transactions on Information Theory, vol. 25, no. 5, pp. 572–584, September 1979.
[2] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3062–3080, December 2004.
[3] G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems for relay networks,” IEEE Transactions on Information Theory, vol. 51, no. 9, pp. 3037–3063, September 2005.
[4] J. N. Laneman and G. W. Wornell, “Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks,” IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2415–2425, October 2003.
[5] T. E. Hunter, S. Sanayei, and A. Nosratinia, “Outage analysis of coded cooperation,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 375–391, February 2006.
[6] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity part I and part II,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1927–1948, November 2003.
[7] Y.-W. Hong, W.-J. Huang, F.-H. Chiu, and C.-C. J. Kuo, “Cooperative communications in resource-constrained wireless networks,” IEEE Signal Processing Magazine, vol. 24, no. 3, pp. 47–57, May 2007.
[8] A. Nosratinia and A. Hedayat, “Cooperative communication in wireless networks,” IEEE Communications Magazine, vol. 42, no. 10, pp. 74–80, October 2004.
[9] M. Janani, A. Hedayat, T. Hunter, and A. Nosratinia, “Coded cooperation in wireless communications: space-time transmission and iterative decoding,” IEEE Transactions on Signal Processing, vol. 52, no. 2, pp. 362–371, February 2004.
[10] A. Høst-Madsen and J. Zhang, “Capacity bounds and power allocation for wireless relay channels,” IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 2020–2040, June 2005.
[11] M. A. Khojastepour, A. Sabharwal, and B. Aazhang, “Lower bounds on the capacity of Gaussian relay channel,” in Proc. 38th Annual Conference on Information Sciences and Systems, Princeton, NJ, Mar. 2004, pp. 597–602.
[12] R. S. Blum, “Distributed detection for diversity reception of fading signals in noise,” IEEE Transactions on Information Theory, vol. 45, no. 1, pp. 158–164, January 1999.
[13] J. Hu and R. S. Blum, “Application of distributed signal detection to mulituser communication systems,” IEEE Transactions on Aerospace Electronic Systems, vol. 38, no. 4, pp. 1220–1229, October 2002.
[14] Q. Zhang, W. Ye, and P. K. Varshney, “Multiuser detection with cell diversity for DS/CDMA systems,” in Proc. IEEE Wireless Communications and Networking Conference, Chicago, Illinois, USA, September 2000, vol. 2, pp. 670–675.
[15] Q. Zhang and P. K. Varshney, “Diversity signal reception via soft decision combining,” in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing, Salt Lake City, USA, May 2001, vol. 5, pp. 2937–2940.
[16] Z. J. Hass and C.-P. Li, “The multiply-detected macrodiversity scheme for wireless cellular system,” IEEE Transactions on Vehicular Technology, vol. 47, no. 2, pp. 506–530, May 1998.
[17] J. G. Chen, N. Ansari, and Z. Siveski, “Performance analysis and realization of decision fusion for macroscopic diversity in cellular wireless systems,” in Proc. IEEE Global Telecommunications Conference, Arizona, USA, November 1997, vol. 1, pp. 424–428.
[18] R. R. Tenney and N. R. Sandell Jr., “Detection with distributed sensors,” IEEE Transactions on Aerospace Electronic Systems, vol. 17, no. 4, pp. 501–510, July 1981.
[19] Z. Chair and P. K. Varshney, “Optimal data fusion in multiple sensor detection systems,” IEEE Transactions on Aerospace Electronic Systems, vol. 22, pp. 98–101, January 1986.
[20] P. K. Varshney, Distributed Detection and Data Fusion. New York: Springer, 1997.
[21] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks, vol. 38, pp. 393–422, March 2002.
[22] M. Feder and A. Catipovic, “Algorithms for joint channel estimation and data recovery-application to equalization in underwater communications,” IEEE Journal of Oceanic Engineering, vol. 16, no. 1, pp. 42–55, January 1991.
[23] G. K. Kaleh and R. Vallet, “Joint parameter estimation and symbol detection for linear or nonlinear unknown channels,” IEEE Transactions on Communications, vol. 42, no. 7, pp. 2406–2413, July 1994.
[24] L. B. Nelson and H. V. Poor, “Iterative multiuser receivers for CDMA channels: an EM-based approach,” IEEE Transactions on Communications, vol. 44, no. 12, pp. 1700–1710, December 1996.
[25] A. Kocian and B. H. Fleury, “EM-based joint data detection and channel estimation of DS-CDMA signals,” IEEE Transactions on Communications, vol. 51, no. 10, pp. 1709–1720, October 2003.
[26] T. H. Pham, A. Nallanathan, and Y.-C. Liang, “Joint channel estimation and data detection for SIMO systems: an EM-based approach,” in IEEE International Conference on Communications, Istanbul, Turkey, June 2006, vol. 9, pp. 4285–4290.
[27] A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society. Series B, vol. 39, no. 1, pp. 1–38, 1977.
[28] T. Moon, “The expectation-maximization algorithm,” IEEE Transactions on Signal Processing, vol. 13, no. 6, pp. 47–60, November 1996.
[29] G. McLachlan and T. Krishnan, The EM Algorithm and Extensions. New York: John Wiley Sons, Inc, 1996.
[30] S. G. Krantz, Handbook of Complex Variables. Boston: Birkhäuser, 1999.
[31] J. G. Proakis, Digital Communications, 4th ed. New York: McGraw-Hill, 2001.
[32] T.-Y. Wang, L.-Y. Chang, D.-R. Duh, and J.-Y. Wu, “Fault-tolerant decision fusion via collaborative sensor fault detection in wireless sensor networks,” IEEE Transactions on Wireless Communications, vol. 7, no. 2, pp. 756–768, February 2008.
[33] S. M. Alamouti, “A simple transmit diversity technique for wireless communications, ” IEEE Journal on Select Areas in Communications, vol. 16, no. 8, pp. 1451–1458, October 1998.
[34] C. Wu, “On the convergence properties of the EM algorithm,” The Annals of Statistics, vol. 11, no. 1, pp. 95–103, 1983.
[35] R. A. Boyles, “On the convergence of the EM algorithm,” Journal of the Royal Statistical Society. Series B, vol. 45, no. 1, pp. 47–50, 1983.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 18.222.69.152
論文開放下載的時間是 校外不公開

Your IP address is 18.222.69.152
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code