本論文中我們首先提出一種壓縮轉傳機制(compress-and-forward)應用於全雙工(full-duplex)的合作式通訊系統(cooperative communication)上，此外我們把遞迴式偵測(iterative detection)的方法加入此機制中，然而我們發現，當壓縮轉傳機制在中繼站(relay)接近終端(destination)時，其解碼效益會比解碼轉傳機制(decode-and-forward)要來得好，因此這兩種機制各有其適合的通道狀況。由於合作式通訊系統中，通道的狀況隨著來源端(source)、中繼站與終端的相對位置改變而變化，我們因而提出一種可調適性的結合機制，中繼站在變化的通道狀況中可選擇其所適合的機制來達到最佳的效益。在本論文中我們選擇速龍馬(raptor codes)作為編碼，無碼率(rateless)的碼字像是速龍馬應用於合作式通訊系統可充分發揮其碼字特性。我們在模擬結果可發現，壓縮轉傳機制在上述的環境中解碼效益比解碼轉傳機制來得好外，遞迴式偵測也可幫助其解碼效益，可調適性結合機制也可於不同的通道環境中使用適合的傳送機制。
I

[1] T. M. Cover and A. A. El Gamal, \Capacity theorems for the relay chan-
nel," IEEE Trans. Inform. Theory, vol. IT-25, pp. 572{584, Sept. 1979.
[2] A. Sendonaris, E. Erkip, and B. Aazhang, \User cooperation diversity-
part I: system description," IEEE Trans. on Commun., vol. 51, pp.1927-
1948 Nov. 2003.
[3] A. Sendonaris, E. Erkip, and B. Aazhang, \User cooperation diversity-
part II: implementation aspects and performance analysis," IEEE
Trans.on Commun., vol. 51, pp. 1939-1948, Nov. 2003.
[4] R. Hu and J. Li, \Practical compress-forward in user cooperation: Wyner-
Ziv cooperation," Proc. ISIT-2006, Seattle, WA, Jul. 2006.
[5] J. Castura and Y. Mao, \Rateless coding for wireless relay channels,"
IEEE Trans. on Wireless Commun., vol. 6, pp. 1638-1642. May 2007.
[6] A. F. Molisch, N. B. Mehta, J. S. Yedidia, and J. Zhang, \Performance of
Fountain codes in collaborative relay networks," IEEE Trans.on Wireless
Commun., vol. 6, pp. 4108-4119, Nov. 2007.
[7] A. Chakrabarti, A. de Baynast, A. Sabharwal, \Low density parity-check
codes for the relay channel," IEEE J. Sel. Areas Commun., vol. 25, no.
2, pp. 280-291, Feb. 2007.
[8] R. Nikjah, and N. C. Beaulieu, \Achievable rates and fairness in rateless
coded relaying schemes," IEEE Trans. Wireless Commun., vol. 7, no. 11,
pp.599-618, Nov. 2008.
[9] N. Bonello, R. Zhang, S. Chen, and L. Hanzo, \Recongurable rateless
codes," IEEE Trans. Wireless Commun., vol. 8, no. 11, pp. 5592{5600,
Nov. 2009.
[10] M. Uppal, Z. Liu, V. Stankovic, and Z. Xiong, \Compress forward coding
with BPSK modulation for the half-duplex Gaussian relay channel," in
IEEE Trans. Signal Process., vol. 57, pp. 4467-4481, Nov. 2009.
[11] M. Uppal, G. Yue, X. Wang, and Z. Xiong, \A Rateless coded protocol
for half-duplex wireless relay channels," IEEE Trans. Signal Process., vol.
59, no 1, pp209-222, Jan. 2011.
[12] R. G. Gallager, \Low-density parity check codes," IRE Trans. Inf. The-
ory, vol. 39, no. 1, pp. 37-45, Jan. 1962.
[13] M.Luby, \LT codes," Proc. 43rd Annu. IEEE Symp. Foundations of
Computer Science (FOCS), Vancouver, BC, Canada, Nov. 2002, pp. 271-
280.
[14] A. Shokrollahi, \Raptor codes," Proc. IEEE Int. Symp. Information
Theory, Chicago, IL, Jun./Jul. 2004, pp. 36.
[15] O. Etesami and A. Shokrollahi, \Raptor codes on binary memory-
less symmetric channels," IEEE Trans. Inform. Theory, vol. 52, no. 5,
pp. 2033-2051, May 2006.
[16] T. J. Richardson and R. L. Urbanke \The Capacity of Low-Density
Parity-Check Codes Under Message-Passing Decoding,"IEEE Trans. In-
form. Theory, vol. 47, no. 2, Feb 2001
[17] R. Palanki ,and J. S. Yedidia, \Rateless codes on noisy channels," Proc.
IEEE ISIT-2004, Chicago, USA, June 27-July 2, 2004.
[18] O. Etesami and A. Shokrollahi, \Raptor codes on binary memoryless
symmetric channels," IEEE Trans. Inf. Theory, vol. 52, pp. 2033-2051,
May 2006.