中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/93603
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 78852/78852 (100%)
造访人次 : 38467766      在线人数 : 2692
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/93603


    题名: 結合共軛梯度法與雅可比法之軟性輸出的巨量多輸入多輸出偵測器設計;A Design of Soft-output MMSE Detector with Joint Conjugate Gradient Jacobi for Massive MIMO Systems
    作者: 羅頡;Lo-Chieh
    贡献者: 電機工程學系
    关键词: 多輸入多輸出天線系統;MIMO system
    日期: 2024-01-22
    上传时间: 2024-03-05 17:55:11 (UTC+8)
    出版者: 國立中央大學
    摘要: 近代科技以爆炸性的速度在成長,發展出了如人工智慧(Artificial Intelligence)、5G網路(fifth Generation Mobile Networks)等等,而這些技術的資料傳輸量又更高了一些,多輸入多輸出系統已經漸漸無法負荷,於是又將天線數量向上提升形成了巨量多輸出多輸入系統(Massive MIMO system),常見的天線數有64x8、128x8 (N_r×N_t) 等等,而本論文嘗試以較為困難的128x32的天線數量進行實現,在計算最小均方誤差演算法(Minimum Mean Square Error)時,演算法中的反矩陣複雜度為O(N_t^3),故本論文以共軛梯度雅可必法(Joint Conjugate Gradient Jacobi Method)去逼近MMSE中的反矩陣,此演算法前面以共軛梯度法進行迭代後面以雅可比法進行收尾,因共軛梯度法能提供較好的收斂性,所以以它先搜尋正確的方向,後面再以複雜度較低的雅可比法進行迭代,雅可比法是透過對角矩陣和剩餘矩陣進行迭代的演算法,因Massive MIMO有著對角優勢,雅可比法的迭代也能降低系統的位元錯誤率(Bit Error Rate),所以將兩種演算法結合之後,獲得的位元錯誤率幾乎等同於所要逼近的演算法MMSE。
    而在電路架構上為了運算格拉姆矩陣(Gram matrix),將通道矩陣分為四等分並利用格拉姆矩陣的共軛性與對稱性進行平行處理最後相加以獲得更高的吞吐量(throughput),整體的電路架構以管線化(pipeline)進行設計,將其分為三個stage進行運算,晶片時做採用的是TSMC的40nm製程,核心面積為3.72mm^2,操作頻率約423MHz,功耗約為877mW,傳輸量可以達到768Mbps的速度。
    ;Modern technology is growing at an explosive rate, that developed such as AI(artificial intelligence),5G network(fifth Generation Mobile Network),etc. The data throughput of these technologies is a bit higher, MIMO systems have been gradually unable to load. Therefore, the number of antennas is increased to form a Massive MIMO system. Common antenna numbers are 64x8、128x8 and so on. However, this paper tries to implement it with the more difficult number of antennas which is 128x32. When calculating the MMSE (Minimum Mean Square Error), the complexity of the inverse matrix in the algorithm is O(N_t^3). Therefore, this paper uses the Joint Conjugate Gradient Jacobi algorithm to approximate the inverse matrix in MMSE. This algorithm uses conjugate gradient method to iterate before and ends with the Jacobi method. Because the CG method can provide better convergence, so use it to search the correct direction first. Later, iterate with the less complex Jacobi method. The Jacobi method is an iterative algorithm through the diagonal matrix and residual matrix. Because Massive MIMO has diagonal advantage, the iteration of the Jacobi method can also reduce the BER(Bit Error Rate) of the system.
    In the circuit architecture, in order to operate the Gram matrix, this paper divides the channel matrix into quarters and use the conjugation and symmetry of the Gram matrix for parallel processing and finally sum to obtain higher throughput. The overall circuit architecture is designed with pipeline and divided into three stages for operation. The chip design is implemented in TSMC 40 nm CMOS technology. The core area is 3.72 mm^2,maximum frequency is 423MHz, dynamic power consumption is 877mW, throughput can achieve 768Mbps.
    显示于类别:[電機工程研究所] 博碩士論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML74检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明