Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電信工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/58063
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor蘇炫榮(Hsuan-Jung Su)
dc.contributor.authorTzu-Yueh Tsengen
dc.contributor.author曾子岳zh_TW
dc.date.accessioned2021-06-16T08:05:19Z-
dc.date.available2016-07-16
dc.date.copyright2014-07-16
dc.date.issued2014
dc.date.submitted2014-06-25
dc.identifier.citation[1] C.-P. Lee, S.-C. Lin, H.-J. Su, and H. V. Poor, “Multi-user lattice coding
for the multiple-access relay channel,” IEEE Trans. Wireless Commun.,
to appear.
[2] D. Tse and P. Viswanath, Fundamentals of Wireless Communication.
Cambridge University Press, 2005.
[3] J. N. Laneman, D.N. C. Tse, andG.W. Wornell, “Cooperative diversity
in wireless networks: Efficient protocols and outage behavior,” IEEE
Trans. Inform. Theory, vol. 50, no. 12, pp. 3062–3080, Dec. 2004.
[4] G. Kramer and A. J. vanWijngaarden, “On the white gaussian multipleaccess
relay channel,” in Proc. IEEE Int. Symp. Inform. Theory, Sorrento,
Italy, June 2000, p. 40.
[5] L. Sankaranarayanan, G. Kramer, and N. B. Mandayam, “Capacity theorems
for the multiple-access relay channel,” in Proc. Allerton Conf.
Communications, Control, and Computing, 2004.
[6] ——, “Hierarchical sensor networks: Capacity theorems and cooperative
strategies using the multiple-access relay channelmodel,” in Proc. First
IEEE Conference on Sensor and Ad Hoc Communications and Networks,
Santa Clara, CA, Oct. 2004.
[7] K. Azarian, H. El Gamal, and P. Schniter, “On the optimality of arqddf
protocols,” IEEE Trans. Inform. Theory, vol. 54, no. 4, pp. 1718–
1724, Apr. 2008.
[8] B. Nazer and M. Gastpar, “Compute-and-forward: Harnessing interference
through structured codes,” IEEE Trans. Inform. Theory, vol. 57,
no. 10, pp. 6463 – 6486, Oct. 2011.
[9] J. Zhan, B. Nazer, M. Gastpar, and U. Erez, “MIMO compute-andforward.”
in Proc. IEEE Int. Symp. Inform.Theory, Seoul, South Korea,
Jun. 2009, pp. 2848–2852.
[10] M. E. Soussi, A. Zaidi, and L. Vandendorpe, “Compute-and-forward on
a multiaccess relay channel: Coding and sum-rate optimization,” IEEE
Trans. Wireless Commun., to appear.
[11] Y. Song and N. Devroye., “Lattice Codes for the Gaussian Relay Channel:
Decode-and-Forward and Compress-and-Forward,” IEEE Trans.
Inform. Theory, vol. 59, no. 8, pp. 2848–2852, Aug. 2013.
[12] M. O. Damen, H. El Gamal, and G. Caire, “On maximum-likelihood
detection and the search for the closest lattice point,” IEEE Trans.
Inform. Theory, vol. 49, no. 10, pp. 2389–2402, Oct. 2003.
[13] Y. Nam and H. El Gamal, “On the optimality of lattice coding and
decoding in multiple access channels,” in Proc. IEEE Int. Symp. Inform.
Theory, Nice, France, 2007.
[14] R. Zamir, S. Shamai, and U. Erez, “Nested linear/lattice codes for structured
multiterminal binning,” IEEE Trans. Inform. Theory, vol. 48,
no. 6, pp. 1250–1276, June 2002.
[15] U. Erez and R. Zamir, “Achieving log 1
2 log(1 + SNR) on the AWGN
channel with lattice encoding and decoding,” IEEE Trans. Inform. Theory,
vol. 50, no. 10, pp. 2293–2314, Oct. 2004.
[16] K. M. Anstreicher, “On convex relaxations for quadratically constrained
quadratic programming,” Mathematical Programming, vol. 136, pp. 233–
251, Dec. 2012.
[17] C. A. Floudas, Nonlinear and Mixed-Integer Optimization. Oxford
University Press, 1995.
[18] P. Bonami, J. Lee, S. Leyffer, and A.Wachter, “More branch-and-bound
experiments in convex nonlinear integer programming,” Preprint Argonne
National Laboratory, Mathematics and Computer Science Division.,
pp. 1949–0911, 2011.
[19] D. Chen, K. Azarian, and J. N. Laneman, “A case for amplify-forward
relaying in the block-fading multiaccess channel,” IEEE Trans. Inform.
Theory, vol. 54, no. 8, pp. 3728–3733, Aug. 2008.
[20] M. Yuksel and E. Erkip, “Multiple-antenna cooperative wireless systems:
A diversity-multiplexing tradeoff perspective,” IEEE Trans. Inform.
Theory, vol. 53, no. 10, pp. 3371–3393, Oct. 2007.
[21] S. H. Lim, Y.-H. Kim, A. E. Gamal, and S.-Y. Chung, “Noisy network
coding,” IEEE Trans. Inform. Theory, vol. 57, no. 5, May 2011.
[22] U. Erez, S. Litsyn, and R. Zamir, “Lattices which are good for (almost)
everything,” IEEE Trans. Inform. Theory, vol. 51, no. 10, pp. 3401–
3416, Oct. 2005.
[23] H.-A. Loeliger, “Averaging bounds for lattices and linear codes,” IEEE
Trans. Inform. Theory, vol. 43, no. 6, pp. 1767–1773, Nov. 1997.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/58063-
dc.description.abstract我們考慮兩個使用者的多重擷取中繼通道系統。在此系統中,兩個使用者用一個半工的中繼器來幫助傳送訊息到一個共同的目的端。在我們之前的研究中顯示,解碼後傳送之晶格碼在多重擷取中繼通道系統中是有效的[1]。然而,當使用者到中繼器這段連線比較差時,解碼後傳送的協定在中繼端可能無法解出所有使用者的訊號。為了解決這個問題,我們提出了一個新的晶格編碼方式,在中繼端只要解出整數加權的使用者編碼,再用餘數對應器對應,再傳送相對的編碼。
雖然在中繼端的解碼方式類似於正交計算後傳送協定,我們放寬了之前研究中使用者不能傳送資料當中繼器正在傳送以避免干擾的限制。主要的內容是在目的端的聯合多個使用者之晶格解碼。此種聯合解碼不僅複雜了相對應的碼的設計,也使的錯誤分析更為複雜。為了在中繼端找到適合的整數加權的使用者編碼,我們藉由轉換和放寬限制解決了一個非凸的整數問題。我們也發展了控制使用者和中繼站能量的策略。模擬結果顯示我們提出的非正交晶格碼可以在多種通道下好過一些現行的架構。
zh_TW
dc.description.abstractWe consider the two-user multiple access relay channel(MARC), in which two users transmit messages to a common destination with the assistance of a half-duplex relay. The decode-and-forward (DF) based lattice coding was shown to be effective for the MARC in our previous work [1]. However when the links from the users to the relay are weak, DF protocol may fail to decode all users at the relay. Aiming to solve this problem, we propose a new lattice coding where the relay only needs to decode an integer-weighted-sum of users' lattice codewords, re-maps it with a modulo-based mapper and then forwards the corresponding codeword. Although the decoding at the relay is akin to the orthogonal compute-and-forward protocol, we relax the restriction imposed by previous works that the users have to be silent when the relay is transmitting to avoid interference. The key ingredient is the joint multi-user lattice decoding performed at the destination. This jointly decoding strategy not only complicates the corresponding code design but also the error analysis. To find the proper integer-weighted-sum at the relay for the destination's joint decoder, we also solve a non-convex integer programming by carefully transforming and relaxing it to a convex one. Also, we develop the power allocation policy to control users' and relay's power. Simulation results show that the proposed non-orthogonal lattice coding can outperform existing schemes in a variety of channel settings.en
dc.description.provenanceMade available in DSpace on 2021-06-16T08:05:19Z (GMT). No. of bitstreams: 1
ntu-103-R01942075-1.pdf: 1569154 bytes, checksum: ae0cb3c8c5a5a4cb10a6de09707e4d91 (MD5)
Previous issue date: 2014
en
dc.description.tableofcontents1. Introduction(1)
1.1 Background(1)
1.2 Notations(3)
2. System Model and Problem Formulation(5)
3. Proposed non-orthogonal lattice coding with modulo-sum computation(9)
3.1 Encoding Process for the users(9)
3.2 Decoding and mapping at the relay(11)
3.3 Two-stage Joint Coset Decoder at the Destination(12)
4. Achievable rates and the rate optimization(17)
4.1 Achievable rates(17)
4.2 Sum rate optimization(20)
4.3 Formula reformulation(25)
4.4 Power allocation policy(27)
5. Simulation Results and Comparison(31)
6. Conclusion(43)
7. Proof of the theorem(44)
7.1 Achievable rate at first stage(44)
7.1.1 Part A(48)
7.1.2 Part B(50)
7.1.3 Part C(52)
7.2 Achievable rate at second stage(54)
Bibliography(58)
dc.language.isoen
dc.subject多重擷取中繼通道系統zh_TW
dc.subject和餘計算zh_TW
dc.subject聯合解碼zh_TW
dc.subject非凸的整數問題zh_TW
dc.subject能量控制策略zh_TW
dc.subjectPower allocation policyen
dc.subjectNon-convex integer programmingen
dc.subjectJoint lattice decodingen
dc.subjectMultiple-access relay channelen
dc.subjectModulo-sum computationen
dc.title具和餘計算和聯合解碼多重擷取中繼通道系統之晶格碼zh_TW
dc.titleLattice codes with modulo-sum computation and joint lattice decoding for the multiple-access relay channelen
dc.typeThesis
dc.date.schoolyear102-2
dc.description.degree碩士
dc.contributor.oralexamcommittee蘇柏青(Borching Su),林士駿(Shih-Chun Lin)
dc.subject.keyword多重擷取中繼通道系統,和餘計算,聯合解碼,非凸的整數問題,能量控制策略,zh_TW
dc.subject.keywordMultiple-access relay channel,Modulo-sum computation,Joint lattice decoding,Non-convex integer programming,Power allocation policy,en
dc.relation.page61
dc.rights.note有償授權
dc.date.accepted2014-06-26
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-103-1.pdf
  未授權公開取用
1.53 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved