請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/31234
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 闕志達(Tzi-Dar Chiueh) | |
dc.contributor.author | Tsung-Hsueh Lee | en |
dc.contributor.author | 李宗學 | zh_TW |
dc.date.accessioned | 2021-06-13T02:37:28Z | - |
dc.date.available | 2008-01-24 | |
dc.date.copyright | 2007-01-24 | |
dc.date.issued | 2006 | |
dc.date.submitted | 2007-01-16 | |
dc.identifier.citation | [1] 財團法人國家實驗研究院科技政策研究與資訊中心,科技產業資訊室, “產業市場報導” no. 151, Jan. 6, 2006
[2] 財團法人國家實驗研究院科技政策研究與資訊中心,科技產業資訊室, “產業市場報導” no. 183, Aug. 25, 2006 [3] 財團法人國家實驗研究院科技政策研究與資訊中心,科技產業資訊室, “產業市場報導” no. 195, Nov. 17, 2006 [4] Digital Times, July 17, 2006. [5] L. C. Wang and W. C. Liu, “Performance of Pulse Position Modulated Signals over the Ultra-Wideband Channel with Multiple Transmit and Receive Antennas,” in Proc. IEEE VTC 2004 , vol. 2, Sep. 2004. pp. 26-29 [6] J. P. Lien, “Design of a MIMO OFDM Baseband Transceiver for Cognitive Radio System,” MS Thesis, NTU, 2005. [7] J. G. Proakis, Digital Communications, 4th Edition. McGraw-Hill Publisher, 2001. [8] G. J. Foschini and M. J. Gans, ”On the limits of Wireless Communication in a Fading Environment When Using Multiple Antennas,” in Proc. Wireless Pers. Commun, pp.315-335, Mar. 1998. [9] A. Paulraj, R. Nabar and D. Core, Introduction to Space-Time Wireless Communications. Cambridge University Press, 2003. [10] B. Vucetic and J. Yuan, Space–Time Coding. New York: Wiley, 2003. [11] J. Wang and B. Daneshrad, “A Comparative Study of MIMO Detection Algorithms for Wideband Spatial Multiplexing Systems,” in Proc. IEEE Communications Society/WCNC, Mar. 2005, pp. 408-413. [12] P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, “V-BLAST: An Architecture for Realizing Very High Data Rates Over the Rich-Scattering Wireless Channel,” in Proc. URSI ISSSE98, Sept. 1998. pp. 295–300. [13] H. Artés, D. Seethaler and F. Hlawatsch, “Efficient Detection Algorithms for MIMO Channels: A Geometrical Approach to Approximate ML Detection,” IEEE Trans. Signal Process., vol. 51, no. 11, pp. 2808-2820, November 2003 [14] M. Pohst, “On the computation of lattice vectors of minimal length, successive minima and reduced basis with applications,” in Proc. ACM SIGSAM, vol. 15, pp. 37–44, 1981. [15] U. Fincke and M. Pohst, “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis,” Math. Computation, vol. 44, pp. 463–471, Apr. 1985. [16] C. P. Schnorr and M. Euchner, “Lattice basis reduction: Improved practical algorithms and solving subset sum problems,” Math. Programming, vol. 66, pp. 181–191, 1994. [17] J. Luo, K. R. Pattipati, P. Willett, and G. M. Levchuk, “Fast Optimal and Suboptimal Any-Time Algorithms for CDMA Multiuser Detection Based on Branch and Bound,” IEEE Trans. Commun., vol. 52, no. 4, pp. 632-641, Apr. 2004. [18] E. Viterbo and J. Boutros, “A universal lattice code decoder for fading channels,” IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639–1642, Jul. 1999. [19] O. Damen, A. Chkeif, and J.C. Belfiore, “Lattice Code Decoder for Space-Time Codes,” IEEE Commun. Lett., vol.4, no. 5, pp. 161-163, May 2000. [20] B. M. Hochwald and S. T. Brink, “Achieving Near-Capacity on a Multiple-Antenna Channel,” IEEE Trans. Commun., vol. 51, no. 3, pp. 389-399, Mar. 2003. [21] W. Zhao and G. B. Giannakis, “Sphere Decoding Algorithms With Improved Radius Search,” IEEE Trans. Commun., vol. 53, no. 7, pp. 1104-1109, July 2005. [22] H. G. Han, S. K. Oh, S. J. Lee, and D. S. Kwon, “Computational Complexities of Sphere Decoding according to Initial Radius Selection Schemes and an Efficient Initial Radius Reduction Scheme,” in Proc. IEEE GLOBECOM, vol. 4, Nov. 2005. pp. 2354-2358. [23] D. Garrett, L. Davis, S. T. Brink, B. Hochwald and G. Knagge, “Silicon Complexity for Maximum Likelihood MIMO Detection Using Spherical Decoding,” IEEE Journal of Solid-State Circuits, vol. 39, no. 9, pp. 1544-1552, Sept. 2004 [24] E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, “Closest point search in lattices,” IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201–2214, Aug. 2002. [25] Z. Guo and P. Nilsson, “Algorithm and Implementation of the K-Best Sphere Decoding for MIMO Detection,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, pp. 491-503, Mar. 2006. [26] S. Chen, T. Zhang and Y. Xin, “Breadth-First Tree Search MIMO Signal Detector Design and VLSI Implementation,” in Proc. IEEE MILCOM, vol. 3, Oct. 2005, pp. 1470-1476. [27] D. Pham, K. R. Pattipati, P. K. Willett, and J. Luo, “An Improved Complex Sphere Decoder for V-BLAST Systems,” IEEE Signal Process. Lett., vol.11, no.9, pp. 748-751, Sept. 2004. [28] A. D. Murugan, H. E. Gamal, M. O. Damen, and G. Caire, “A Unified Framework for Tree Search Decoding: Rediscovering the Sequential Decoder,” IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 933-953, Mar. 2006. [29] K. K. Wong and A. Paulraj, “On the Decoding Order of MIMO Maximum-Likelihood Sphere Decoder: Linear and Non-Linear Receivers,” in Proc. IEEE VTC Spring 2004, vol. 2, May 2004, pp. 698-702. [30]Y. Wang and K. Roy, “A New Reduced-Complexity Sphere Decoder with True Lattice-Boundary-Awareness for Multi-Antenna Systems,” in Proc. IEEE ISCAS 2005, vol. 5, May 2005, pp. 4963-4966. [31] S. M. Razavizadeh, and V. T. Vakili, “A New Faster Sphere Decoder for MIMO Systems,” in Proc. IEEE ISSPIT, Dec. 2003, pp. 86-89. [32] M. O. Damen, H. El Gamal, and G. Caire, “On maximum-likelihood detection and the search for the closest lattice point,” IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389–2401, Oct. 2003. [33] A. Burg, M. Borgmann, M. Wenk, M. Zellweger, W. Fichtner and H. Bölcskei, “VLSI Implementation of MIMO Detection Using the Sphere Decoding Algorithm,” IEEE Journal of Solid-State Circuits, vol. 40, no. 7, pp. 1566-1577, July 2005 [34] C. Liu, Z. Wu, and W. Zheng, “A Complex Sphere Decoder for Space-Time Codes,” in Proc. IEEE MWSCAS, vol. 2, July 2004. pp. II657-II660 [35] A. Burg, M. Borgmann, C. Simon, M. Wenk, M. Zellweger, and W. Fichtner, “Performance tradeoffs in the VLSI implementation of the sphere decoding algorithm,” in Proc. IEE 3G Mobile Communication Conf., London, U.K., Oct. 2004, pp. 93–97. [36] K. Su and I. Wassel, “A New Ordering for Efficient Sphere Decoding,” in Proc. IEEE ICC, vol. 3, May 2005. pp. 1906-1910 [37] Y. Wang and K. Roy, “Reduced-Complexity Sphere Decoding via Detection Ordering for Linear Multi-Input Multi-Output Channels,” in Proc. IEEE Workshop on SIPS, 2004, pp. 30-35. [38] J. Tang, A. H. Tewfik and K. K. Parhi, “High Performance Solution for Interfering UWB Piconets with Reduced Complexity Sphere Decoding,” in Proc. IEEE ISCAS 2004, vol. 5, May 2004. pp. 377-380. [39] J. Jaldén, and B. Ottersten, “On the Complexity of Sphere Decoding in Digital Communications,” IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005. [40] B. Hassibi and H. Vikalo, “On the Sphere Decoding Algorithm I. Expected Complexity,” IEEE Trans. Signal Process, vol. 53, no. 8, pp. 2806-2818, August 2005 [41] L. Schumacher, “Matlab program,” http://www.info.fundp.ac.be/ ~lsc/Research/IEEE_80211_HTSG_CMSC/distribution_terms.html and lsc@info.fundp.ac.be [42] T. Manabe, “Effects of Antenna Directivity and Polarization on Indoor Multipath Propagation Characteristics at 60GHz,” IEEE Journal on Selected Areas In Communications, vol. 14, Issue 3, pp. 441 – 448, April 1996 [43] A. Burg, M. Wenk, M. Zellweger, M. Wegmueller, N. Felber, and W. Fichtner, “VLSI implementation of the sphere decoding algorithm,” in Proc. ESSCIRC-2004, Leuven, Belgium, Sept. 2004, pp. 303–306. [44] K.Wong, C. Tsui, R.-K. Cheng, and W. Mow, “A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels,” in Proc. IEEE ISCAS’02, vol. 3, 2002, pp. 273–276. [45] Z. Guo and P. Nilsson, “A VLSI architecture of the Schnorr-Euchner decoder for MIMO systems,” in Proc. IEEE CAS Symp. Emerging Technologies, June 2004, pp. 65–68. [46] K. H. Chen and T. D. Chiueh, “A Low-Power Digit-Based Reconfigurable FIR Filter,” IEEE Trans. Circuits Syst. II, vol. 53, no. 8, pp. 617-621, Aug. 2006 [47] S. Bäro, J. Hagenauer, and M. Witzke, “Iterative detection of MIMO transmission using a list-sequential (liss) detector,” in Proc. IEEE Int. Conf. Commun., 2003, pp. 2653-2657 [48] R. Wang, G. B. Giannakis, “Approaching MIMO Channel Capacity With Soft Detection Based on Hard Sphere Decoding,” IEEE Trans. on Communications, vol. 54, no.4, pp. 587-590, Appril 2006 [49] K. Sumii, T. Nishimura, T. Ohgane and Y. Ogawa, “A simplified iterative processing of soft MIMO detector and turbo decoder in a spatially multiplexed system,” in Proc. IEEE VTC, vol. 2, 2005, pp. 882-886 | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/31234 | - |
dc.description.abstract | 下世代無線區域網路將提供越來越多樣化的服務,包括線上收看各種視訊影片、高畫質電視(High Definition TV, HDTV)、網路互動式遊戲等,因此對於傳輸速度還有品質的要求越來越高,再加上頻寬使用的限制,讓我們不得不尋找更有效使用有限頻寬提高傳輸速度以及品質的方法。繼正交分頻多工(OFDM)被廣泛使用在各通訊系統,並且成為各種規格採用的核心技術後,多輸入多輸出也因為可以有效提高頻帶使用效能漸漸成為一個被大量採用的技術。
為了進一步提高多輸入多輸出技術的優點,我們需要增加傳輸與接收天線數目,但也隨之而來多輸入多輸出信號解碼的困難。球面演算法(Sphere Algorithm)原為解決柵欄最短向量(shortest vector in lattice)而被提出,後來被採用於通訊系統中處理多輸入多輸出信號最大相似等化(Maximum Likelihood Equalization)的問題,在可接受的複雜度下可以達到最大相似的錯誤率表現。 本論文研讀了球面解碼器的相關文獻,並且實現了一新式複數球面解碼器,採用深度優先(depth first)的最近點優先(closest point first)搜尋順序,直接操作於複數信號系統,並且提出表列舉(List Enumeration)演算法解決複數球面解碼器最近點優先搜尋的列舉困難,包括統一表(Unified List)與個別表(Individual List)兩種方式實現,進一步提出兩種可以配合使用的演算法降低計算量,控制返回階層(Backward-Layer Controlled)演算法與降低維度(Diminished Dimensionality)演算法。最後以平行正反向搜尋(Parallel Forward/Backward Search)還有單計算單元(Single Calculation Unit)硬體架構實作此演算法,提供傳輸率(throughput)與硬體面積和功率的交換(tradeoff),而且本論文的硬體架構可以支援許多天線組合還有不同星座圖的系統。軟體模擬結果還有硬體實作數據都顯現本論文提出之演算法與硬體架構優於目前文獻中提出的方法。 | zh_TW |
dc.description.abstract | More and more services are provided in the next generation wireless communicaiton systems, including on-line videos, high definition TV (HDTV), interactive games and so on. The demand for throughput and QoS is getting higher. However, the bandwidth is limited. OFDM is widely adopted in many communication systems and has become a main modulation technique of many standards. MIMO will be the next widely accepted technique because of its provision for diversity and/or spectrum efficiency.
To apply the MIMO techniques, the number of transmitting and receiving antennas needs be more than one. Among spatial multiplexing MIMO detection, sphere decoding algorithm is the first that was proposed to do maximum-likelihood equalization’detection with acceptable complexity. In the thesis, sphere decoder related literatures are surveyed and a new complex-plane sphere decoder is designed and implemented. Depth-first search with closest point first order is introduced directly on complex-valued signals. List-Enumeration algorithm is proposed to overcome the problem of enumeration in complex-plane sphere decoder. The list can be implemented by either an unified list and several individual lists. In addition, backward-Layer controlled algorithm and diminished dimensionality algorithm are proposed to further reduce the hardware complexity. Two architectures, parallel forward/backward search and single calculation unit, are proposed to implement the new algorithm. The tradeoffs of these two versions are between area, power, and throughput. The hardware can support different constellations and numbers of antennas. Simulation and implementation results indicate the proposed algorithm and architecture outperform other solutions and form a solid foundation for future wireless communication systems that adopt MIMO processing. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T02:37:28Z (GMT). No. of bitstreams: 1 ntu-95-R93943091-1.pdf: 1991792 bytes, checksum: d1f7062f44c8d8be0f4f5e20908bb3da (MD5) Previous issue date: 2006 | en |
dc.description.tableofcontents | 目錄
圖示列表 表格列表 第一章 緒論 1 1.1 背景 1 1.2 動機 3 1.3 研究簡介 5 1.4 論文組織介紹 6 第二章 多輸入多輸出(MIMO)系統介紹 7 2.1 本章介紹 7 2.2 多輸入多輸出(MIMO)系統 7 2.2.1 系統簡介 7 2.2.2 信號模型 8 2.2.3 通道容量(Channel Capacity) 10 2.2.4 時空編碼(Space-Time Coding) 11 2.3 多輸入多輸出信號解碼(MIMO DECODING) 13 2.3.1 線性解碼(Linear Decoding) 13 2.3.2 非線性解碼(Non-linear Decoding) 14 2.3.3線性適應多輸入多輸出訊號偵測(Linear Adaptive MIMO Decoding) 16 2.4 發展現況(STATE OF THE ART) 18 第三章 球面解碼(Sphere Decoding) 21 3.1 本章介紹 21 3.2 球面演算法(SPHERE ALGORITHM) 21 3.2.1 簡介 22 3.2.2 球面限制(Sphere Constraint) 23 3.2.3 樹狀搜尋(Tree Search) 26 3.2.3 列舉(Enumeration) 34 3.3 複數球面解碼器(COMPLEX SPHERE DECODER) 36 3.3.1 複數系統 37 3.3.2 複數球面解碼的列舉(Enumeration) 38 3.3.3 優缺點 42 3.4 前置處理(PREPROCESSING) 43 第四章 簡化複雜度球面解碼 45 4.1 本章介紹 45 4.2 降低複雜度動機 45 4.3 表列舉複數球面解碼器(LIST-ENUMERATION COMPLEX SPHERE DECODER) 46 4.3.1 最大相似標準 47 4.3.2 深度優先搜尋 48 4.3.3 複數球面解碼 49 4.3.4 通道行能量排序(Channel Column Power Ordering) 50 4.3.5 表列舉 51 4.4 控制返回階層球面解碼器(BACKWARD-LAYER CONTROLLED SPHERE DECODER, BLCSD) 60 4.4.1 控制返回階層(BLC)演算法 61 4.4.2 限制門檻(threshold)的選取 62 4.5 降低維度球面解碼器(DIMINISHED DIMENSIONALITY SPHERE DECODER, DDSD) 65 4.5.1 如何降低維度 65 4.5.2 估計複雜度(Expected Complexity) 66 4.6 模擬結果 73 第五章 硬體實現 97 5.1 本章介紹 97 5.2 設計流程簡介 97 5.3 定點數模擬(FIXED-POINT SIMULATION) 98 5.3.1 模擬目的 98 5.3.2 模擬原則 98 5.3.3定點數模擬結果 98 5.4 硬體架構設計 101 5.4.1 硬體特色 101 5.4.2 平行正反向搜尋(Parallel Forward/Backward Search) 101 5.4.3 單計算單元(Single Calculation Unit) 107 5.5 實現結果 111 第六章 結論與展望 117 參考資料 121 | |
dc.language.iso | zh-TW | |
dc.title | 新式多輸入多輸出信號偵測用複數球面解碼器之設計與實作 | zh_TW |
dc.title | Design and Implementation of a New Complex Sphere Decoder for MIMO Detection | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-1 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 李學智(Hsueh-Jyh Li),馬席彬(Hsi-Pin Ma),蘇炫榮(Hsuan-Jung Su) | |
dc.subject.keyword | 多輸入多輸出,球面解碼,表列舉,最大相似,返回階層控制, | zh_TW |
dc.subject.keyword | MIMO,sphere decoding,list enumeration,maximum likelihood,backward-layer controlled, | en |
dc.relation.page | 120 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-01-17 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電子工程學研究所 | zh_TW |
顯示於系所單位: | 電子工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-95-1.pdf 目前未授權公開取用 | 1.95 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。