中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/74941
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 42572620      線上人數 : 1394
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/74941


    題名: 多輸入多輸出前編碼系統之奇異值分解處理器設計與實現;Design and Implementation of an SVD processor for MIMO precoding systems
    作者: 吳俊弘;Wu, Chun-Hung
    貢獻者: 電機工程學系
    關鍵詞: 奇異值分解;坐標軸旋轉數位計算器;多輸入多輸出前編碼系統;Singular value decomposition;Coordinate Rotation Digital Computer;MIMO precoding systems
    日期: 2017-08-09
    上傳時間: 2017-10-27 16:12:35 (UTC+8)
    出版者: 國立中央大學
    摘要: 超大型多輸入多輸出系統(Large-scale multiple-input multiple-output system)被認為是第五代行動通訊系統的候選技術之一。在新的行動通訊系統中,基地台與使用者裝置所能使用的天線數量大幅提高,因此超大型多輸入多輸出系統相較於傳統的系統有著更高的運算複雜度。論文中主要是探討在此一系統中利用奇異質分解(singular value decomposition, SVD)求得前編碼矩陣的演算法,利用SVD可以將通道矩陣分解成數個互相不會干擾的子通道,而傳輸資料時會選擇通道增益較強的子通道進行傳輸。為了降低奇異值分解的運算複雜度,演算法分成三個階段,三個階段皆以Givens rotation為基礎,第一階段為雙對角化演算法,第二階段為Golub-Reinsch SVD演算法搭配矩陣劃分(split)和矩陣縮減(deflate)兩種機制,第三階段為位移QR演算法並搭配提前終止機制。所提出之演算法可以依照系統需求調整矩陣之收斂速度及所獲得奇異值之精確度。
    而在硬體設計方面,則以支援到8×8的多輸入輸出系統為考量,因此主要根據第一階段與第二階段演算法完成奇異值分解之硬體設計,可以支援2×2∼8×8的矩陣維度,資料流格式採用外部浮點數內部定點數型式來表示,以精準涵蓋8×8通道矩陣的奇異值分布範圍,並且使用坐標軸旋轉數位計算器(Coordinate Rotation Digital Computer, CORDIC),來實現Givens rotation的運算,CORDIC內部則有管線化(pipeline)設計,並將兩個CORDIC組成一個基礎的處理單元(processing element, PE),來完成第一階演算法及第二階演算法,完成第一階段演算法的時脈週期數為171(clock cycles),在第二階演算法其門檻值為2^(-3)的條件下,完成一個8×8的矩陣分解所需的時脈週期數313。我們透過TSMC 40nm製程將晶片設計實現,其最高時脈操作頻率為185MHz,吞吐量(Throughput)為每一秒可分解591K個矩陣(Matrix/s)。
    ;Large-scale MIMO (multiple-input multiple-output) technique is considered to be one of the promising solution in the 5th generation wireless communication system. Due to the increasing antenna number at both the transmitter and receiver sides, higher computational complexity is induced. Singular value decomposition (SVD) is a kind of decom-position scheme that is widely used to decompose the channel matrix into several spatial sub-channels. Usually the sub-channels with large channel gains (singular values) are chosen for transmission. A three-stage algorithm is used, and all can be accomplished by Givens rotation. Bi-diagonalization is employed at the first stage while Golub-Reinsch SVD with split and deflation is adopted at the second stage. We use shifted QR with early termination at the third stage. The SVD procedure can adjust the convergence speed and the accuracy according to the system requirements.
    Considering SVD in 8×8 MIMO systems, the hardware implementation is mainly based on the first-stage and the second-stage operations. Our hardware can support channel matrix dimension from 2×2 to8×8. External floating-point and internal fixed-point representations are used for the datapath. The Givens rotation is realized by Coordinate Rotation Digital Computer (CORDIC). Two CORDIC modules constitute one processing element (PE). It takes 171 clock cycles for the first-stage operation and 313 clock cycles for the entire decomposition if the threshold for split and deflation at the second stage is set to 2^(-3). The hardware is implemented by TSMC 40nm CMOS technology. The maximum operating frequency is 185MHz and the throughput is 591K matrixes per second.
    顯示於類別:[電機工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML143檢視/開啟


    在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 ©   - 隱私權政策聲明