Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電信工程學研究所
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/90550
Title: 干涉通道下有限區塊長度速率和最大化之混和單調性分析
Monotonicity in Sum Rate Maximization for Finite Blocklength Interference Channel
Authors: 胡安儀
An-Yi Hu
Advisor: 林士駿
Shih-Chun Lin
Keyword: 干涉通道,有限區塊長度,速率最大化,混合單調性最佳化法,超可靠低延遲通訊,
interference channel,finite block length,rate maximization,mixed monotone programming,ultra-reliable low-latency communication,
Publication Year : 2023
Degree: 碩士
Abstract: 本文針對複數干擾信道下的有限長度正態近似的速率和優化問題。它使用干擾作為噪聲的解碼器來減少延遲,並取得高於傳統高斯碼本(球形高斯碼本)的 速率。它給出了兩種可實現的速率,分別是分開解碼(SD)和聯合解碼(JD)。 使用非凸函數優化工具——混合單調程序,本文在K個用戶的情況下提出了混合 單調函數。它提供了較低的SD速率和較低的JD速率,在多用戶情況下可以找到 不同混合單調函數的可實現速率。模擬結果表明,上述三個混合單調函數,其中 一個是用於較低JD速率,兩個是用於較低SD速率,在K個用戶的情況下可以取得非常相似的最大速率總和。本文還討論了不同可實現速率的不同混合單調性函數的迭代次數不同的問題。
This paper addresses the rate and optimization problems of the finite block length normal approximation under complex interference channels. It uses an interference-as-noise decoder to reduce the delay and achieve higher than the traditional Gaussian codebook— the spherical Gaussian codebook of the rate. It gives two achievable rate, the rate with separate decoding (SD) and the one with joint decoding (JD). And using the non-convex function optimization tool - mixed monotonic programming, this paper proposes mixed monotonic functions in the cases of K users for this optimization tool. It offers a lower SD rate and a lower JD rate, and the achievable rates can be found for different mixed monotonic functions in the case of multiple users. Simulations show that the above three mixed monotonic functions, one is for lower JD rate and two are for lower SD rate, can achieve very similar maximum rate sums in the case of K users. This paper also discusses the problem that the number of iterations of different mixed monotonicity functions of the proposed achievable rates differs.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/90550
DOI: 10.6342/NTU202302322
Fulltext Rights: 同意授權(全球公開)
metadata.dc.date.embargo-lift: 2028-07-28
Appears in Collections:電信工程學研究所

Files in This Item:
File SizeFormat 
ntu-111-2.pdf
  Until 2028-07-28
550.09 kBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
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