請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/84833完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 林士駿(Shih-Chun Lin) | |
| dc.contributor.author | Yu-Chien Chen | en |
| dc.contributor.author | 陳宇謙 | zh_TW |
| dc.date.accessioned | 2023-03-19T22:28:01Z | - |
| dc.date.copyright | 2022-09-02 | |
| dc.date.issued | 2022 | |
| dc.date.submitted | 2022-08-30 | |
| dc.identifier.citation | [1] S.-C. Lin, T.-H. Chang, E. Jorswieck, and P.-H. Lin, Information Theory, Mathematical Optimization, and Their Crossroads in 6G System Design. Springer Singapore, 2023. [2] Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307–2359, 2010. [3] B. Matthiesen, C. Hellings, E. A. Jorswieck, and W. Utschick, “Mixed monotonic programming for fast global optimization,” IEEE Transactions on Signal Processing, vol. 68, pp. 2529–2544, 2020. [4] C. She, C. Yang, and T. Q. S. Quek, “Radio resource management for ultra-reliable and low-latency communications,” IEEE Communications Magazine, vol. 55, no. 6, pp. 72–78, 2017. [5] X. Shang, “On the capacity of gaussian interference channels,” PhD Thesis, 2008. [6] J. Scarlett, V. Y. F. Tan, and G. Durisi, “The dispersion of nearest-neighbor decoding for additive non-gaussian channels,” IEEE Transactions on Information Theory, vol. 63, no. 1, pp. 81–92, 2017. [7] T.-C. Liu, “Sum rate optimization in 2-user interference channel using spherical codebook in finite block-length regime,” Master Thesis, 2022. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/84833 | - |
| dc.description.abstract | 有鑑於超可靠低延遲通訊是第五代行動通訊的核心目標，因此本篇論文研究以 有限區塊長度將干涉通道之速率合最大化。本文使用混合單調性最佳化法來解決 此非凸函數最佳化問題。 本篇論文提出一個尋找複雜函數的混合單調性表示式之方法，此方法透過尋找 並組合較簡易的混合單調性函數來達成目的。此外，也對於混合單調性最佳化法 進行討論，並分析所得之目標問題的最佳化結果。最後，本文提出一個可行的改 善混合單調性最佳化法之想法作為未來方向。 | zh_TW |
| dc.description.abstract | In view of the goal of ultra-reliable low-latency communication (URLLC) in the 5G communication system, we investigate the weighted sum rates maximization in the K-user interference channel in the finite blocklength (FBL) regime. Mixed monotonic programming (MMP) is applied to solve these non-convex optimization problems. We propose a method to find the MMP representations of complex functions by composing multiple mixed monotonic functions, which are easier to find. Some discussions on MMP and weighted sum rates maximization results are also provided. We state a possible modification of MMP as future work. | en |
| dc.description.provenance | Made available in DSpace on 2023-03-19T22:28:01Z (GMT). No. of bitstreams: 1 U0001-2208202215435500.pdf: 1588968 bytes, checksum: 970a70058167817d685258b3bbdc06e7 (MD5) Previous issue date: 2022 | en |
| dc.description.tableofcontents | 中文摘要 i Abstract ii Contents iii List of Figures v List of Tables vi 1 Introduction 1 1.1 Review of Channel Capacity 1 1.1.1 Gaussian Codebooks 1 1.1.2 Channel Coding Rate in the Finite Blocklength Regime 2 1.2 Review of Mixed Monotonic Programming (MMP) 3 1.3 Thesis Motivation, Overview, and Contributions 4 1.4 Notations 6 2 Discussion of MMP 7 2.1 Properties of Mixed Monotonic Functions 7 2.2 Explanation of Its Branch-and-Bound Algorithm 8 2.3 Feasible Set Workarounds 9 3 Interference Channel in the Finite Blocklength Regime 10 3.1 System Model 10 3.2 Weighted Sum Rates Maximization 11 3.2.1 Specific Results 11 3.3 Dispersion Terms 12 3.3.1 Comparison between Codebooks 13 3.3.2 Conjecture: Specific Results 14 4 Sum Rates Maximization: Achievable Rates Lower Bound 15 4.1 Achievable Rates Lower Bound 15 4.1.1 Method: Calculating the Partial Derivatives 16 4.1.2 Proposed Method: Composing Multiple Functions 17 4.1.3 Difference between Two Methods 18 4.2 Simulation Results 19 5 Future Work: Modification of MMP 22 5.1 Sum Rates Maximization: Achievable Rates with Shell Codes 22 5.1.1 MMP Representations with K=2 Users 23 5.1.2 MMP Representations with Constraints 23 5.2 Proposed Idea of A Possible Solution 25 6 Conclusion 27 Bibliography 28 | |
| dc.language.iso | en | |
| dc.subject | 速率合最大化 | zh_TW |
| dc.subject | 干涉通道 | zh_TW |
| dc.subject | 超可靠低延遲通訊 | zh_TW |
| dc.subject | 混合單調性最佳化法 | zh_TW |
| dc.subject | 有限區塊長度 | zh_TW |
| dc.subject | URLLC | en |
| dc.subject | Interference Channel | en |
| dc.subject | FBL Regime | en |
| dc.subject | Sum Rates Maximization | en |
| dc.subject | Mixed Monotonic Programming | en |
| dc.title | 干涉通道以有限區塊長度之速率合最大化 | zh_TW |
| dc.title | Sum Rates Maximization of the Interference Channel in the Finite Blocklength Regime | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 110-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 黃昱智(Yu-Chih Huang),張縱輝(Tsung-Hui Chang) | |
| dc.subject.keyword | 干涉通道,有限區塊長度,速率合最大化,混合單調性最佳化法,超可靠低延遲通訊, | zh_TW |
| dc.subject.keyword | Interference Channel,FBL Regime,Sum Rates Maximization,Mixed Monotonic Programming,URLLC, | en |
| dc.relation.page | 28 | |
| dc.identifier.doi | 10.6342/NTU202202654 | |
| dc.rights.note | 同意授權(限校園內公開) | |
| dc.date.accepted | 2022-08-30 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
| dc.date.embargo-lift | 2022-09-02 | - |
| 顯示於系所單位： | 電信工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| U0001-2208202215435500.pdf 授權僅限NTU校內IP使用（校園外請利用VPN校外連線服務） | 1.55 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。