Responsive image
博碩士論文 etd-0719110-174552 詳細資訊
Title page for etd-0719110-174552
論文名稱
Title
在相關性通道之合作式通訊下使用最大期望值演算法的分散式偵測與估測
Joint Detection and Estimation in Cooperative Communication Systems with Correlated Channels Using EM Algorithm
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
36
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2010-06-11
繳交日期
Date of Submission
2010-07-19
關鍵字
Keywords
放大前送、最大期望值演算法、結合式偵測與估測
EM Algorithm, joint detection and estimation, Amplify-and-Forward
統計
Statistics
本論文已被瀏覽 5671 次,被下載 3
The thesis/dissertation has been browsed 5671 times, has been downloaded 3 times.
中文摘要
在此篇論文中,我們是考慮當通道係數未知,以放大前送(Amplify-and-Forward)為概念為基礎之下,在合作式通訊網路中分散式偵測的問題。因為通道係數對於系統而言是未知的,所以結合式偵測與估測被考慮在本論文中。在論文中所提出來的方案不同於現存的分散式偵測與估測,它是利用節點之前的合作來達到更好的效能。然而對照現有的估測與偵測問題,本篇論文是基於假設在訊號端與中繼端之間的通道是相關性的。我們是使用最大期望值演算(EM Algorithm)法來解決我們所假設的問題。從模擬圖中我們可以明顯看出,所提出的架構會有一個不錯的效能改善。而且得到的結果顯示出疊代斂速度快速,這意味著此
架構可以在即時工作上應用。
Abstract
In this thesis, we consider the problem of distributed detection problem in cooperative communication networks when the channel state information (CSI) is unknown. The amplify-and-forward relay strategy is considered in this thesis. Since the CSI is assumed
to be unknown to the system, the joint detection and estimation approach is considered in this work. The proposed scheme in this work differs from existing joint detection and estimation schemes in that it utilizes a distributed approach, which exploits node
cooperation and achieves a better system performance in cooperative communication networks.
Moreover, by contrast to the existing channel estimation and symbol detection schemes, the proposed scheme is mainly developed based on the assumption that the data communication from the source to each relay node is to undergo a correlated fading channel. We derive the joint detection and estimation rules for our problem using the expectation-maximum (EM) algorithm. Simulation results show that the proposed scheme can perform well. Moreover, the obtained results show that the proposed iteration algorithm converges very fast, which implies the proposed scheme can work well in
real-time applications.
目次 Table of Contents
1 Introduction 1
2 Review of EM Algorithm 5
3 System Model and Problem Formulation 9
4 Derivation of Relay and Destination Rules 13
4.1 Estimation at the Relay Nodes . . . . . . . . . . . . . . . . . . . . . . . . . 13
4.2 Joint Detection and Estimation at the Destination Nodes . . . . . . . . . . 15
5 Simulation results 19
6 Conclusion 26
參考文獻 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 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.
[3] 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.
[4] 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.
[5] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity-part I: System
description,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1927–1938,
November 2003.
[6] ——, “User cooperation diversity-part II: Implementation aspects and performance
analysis,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1939–1948,
November 2003.
[7] A. Nosratinia, T. E. Hunter, and A. Hedayat, “Cooperative communication in wireless
networks,” IEEE Communications Magazine, vol. 42, no. 10, pp. 74–80, October
2004.
[8] 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, pp. 47–57, May 2007.
[9] M. A. Khojastepour, A. Sabharwal, and B. Aazhang, “Lower bounds on the capacity
of gaussian relay channel,” Proc. 38th Annual Conference on Information Sciences
and Systems, vol. 21, pp. 597–602, March 2004.
[10] Y. Song, H. Shin, and E. K. Hong, “MIMO cooperative diversity with scalargain
amplify-and-forward relaying,” IEEE Transactions on Communications, vol. 57,
no. 7, pp. 1932–1938, July 2009.
[11] O. Canpolat, M. Uysal, and M. M. Fareed, “Analysis and design of distributed
space-time trellis codes with amplify-and-forward relaying,” IEEE Transactions on
Vehicular Technology, vol. 56, no. 4, pp. 1649–1660, July 2007.
[12] C. S. Patel and G. L. St‥uber, “Channel estimation for amplify and forward relay based
cooperation diversity systems,” IEEE Transactions on Wireless Communications,
vol. 6, no. 6, pp. 2348–2356, June 2007.
[13] F. Gao, T. Cui, and A. Nallanathan, “On channel estimation and optimal training
design for amplify and forward relay networks,” IEEE Transactions on Wireless
Communications, vol. 7, no. 5, pp. 1907–1916, May 2008.
[14] ——, “Optimal training design for channel estimation in decode-and-forward relay
networks with individual and total power constraints,” IEEE Transactions on Signal
Processing, vol. 56, no. 12, pp. 5937–5949, December 2008.
[15] L. Tong, B. M. Sadler, and M. Dong, “Pilot-assisted wireless transmissions: general
model, design criteria, and signal processing,” Signal Processing Magazine, vol. 21,
no. 6, pp. 12–25, November 2004.
[16] T.-Y. Wang, J.-W. Pu, and C.-P. Li, “Joint detection and estimation for cooperative
communications in cluster-based networks,” in Proc. 2009 IEEE International
Conference on Communications, pp. 1–5, June 2009.
[17] T. H. Pham, A. Nallanathan, and Y. C. Liang, “Joint channel estimation and data
detection for SIMO systems: An em-based approach,” in Proc. 2006 IEEE International
Conference on Communications, vol. 9, pp. 4285–4290, June 2006.
[18] R. D. Nowak, “Distributed em algorithms for density estimation and clustering in
sensor networks,” IEEE Transactions on Signal Processing, vol. 51, no. 8, pp. 2245–
2253, August 2003.
[19] 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.
[20] 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.
[21] 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, December 1977.
[22] T. Moon, “The expectation-maximization algorithm,” IEEE Transactions on Signal
Processing, vol. 13, no. 6, pp. 47–60, November 1996.
[23] G. McLachlan and T. Krishnan, The EM Algorithm and Extensions, New York, June
1996.
[24] S. G. Krantz, Handbook of Complex Variables, Boston, June 1999.
[25] G. G. Golub and C. F. V. Loan, Matrix Computations, New York, June 1995.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

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

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

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

QR Code