請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/34811
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 林茂昭(Mao-Chao Lin) | |
dc.contributor.author | Chung-Li Wang | en |
dc.contributor.author | 王仲立 | zh_TW |
dc.date.accessioned | 2021-06-13T06:35:00Z | - |
dc.date.available | 2006-01-26 | |
dc.date.copyright | 2006-01-26 | |
dc.date.issued | 2006 | |
dc.date.submitted | 2006-01-17 | |
dc.identifier.citation | [1] G. J. Foschini, “Layered space-time architecture for wireless communications in a fading environment when using multi-element antennas,” Bell Labs Tech. j., vol. no. 2, pp.41-59, Autumn 1996.
[2] V. Tarokh, N. Seshadri, and A.R. Calderbank, “Space-time codes for high data rate wireless communication: Performance criterion and code construction,” IEEE Trans. Inf. Theory, vol. 44 , pp. 744-765, Mar. 1998. [3] S. M. Alamoui, “A simple transmit diversity scheme for wireless communications,” IEEE J. Sel. Areas Commun., vol. 16, pp. 1451-1458, Oct. 1998. [4] G. D. Golden, J. G. Foschini, R. A. Valeneuela, and P.W. Wolniansky, “Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture,” Electron. Lett., vol. 35, pp.14-15, Jan. 1999. [5] M. Sellathurai, and S. Haykin, “TURBO-BLAST for high-speed wireless communications,” Wireless Comm. And Network Conf. 2000, WCNC 2000, Sept. 2000, Chicago. [6] A. van Zelst, R. van Nee and G. A. Awater, “Turbo-BLAST and its performance,” Vehicular Tech. Conf, 2001. VTC 2001 Spring. IEEE VTS 53rd vol. 2, 6-9 May 2001 pp. 1282-1286 vol.2 . [7] S. ten Brink, “Convergence of Iterative Decoding,” Electron. Lett., vol. 35, no. 10, May 1999, pp. 806-808. [8] S. ten Brink, “Convergence Behavior of Iterative Decoded Parallel Concatenated Codes,” IEEE Trans. on Comm., vol. 49, no. 10, pp. 1727-1737, Oct. 2001. [9] E. Biglieri, J. Proakis, and S. Shamai, “Fading channels: In formation theoretic and communications aspects,” IEEE Trans. Inform. Theory, vol. 44, pp. 2619-2692, Oct. 1998. [10] Branka Vucetic, and Jinhong Yuan, Space-Time Coding,. [11] J. Hagenauer and P. Hoeher, “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Trans. Inf. Theory, vol. 42, no.2, March 1996. [12] B. Vucetic and J. Yuan, Turbo Codes Principles and Applications, Kluwwer publishers, 2000. [13] N. Wiberg, “Codes and decoding on general graphs,” Ph.D. dissertation, Linkőping Univ., Sweden, 1996. [14] M. Sellathurai, and S. Haykin,, “TURBO-BLAST for Wireless Communications: Theory and Experiments,” IEEE Trans. on SP., vol. 50, no. 10, Oct 2002. [15] S. ten Brink, J. Speidel and R.-H Yan, “Iterative Demapping and Decoding for Multilevel Modulation,” IEEE GLOBECOM 1998, vol. 1, Nov 1998, pp. 579-584. [16] P. Robertson, E. Villebrun and P. Hoeher, “A Comparison of Optimal and Sub-optimal MAP Decoding Algorithm in the Log Domain,” Proc. ICC ’95, June 1995, pp. 1009-1013. [17] A. van Zelst, R. van Nee and G.A. Awater, “Space Division Multiplexing (SDM) for OFDM systems,” 51st IEEE Vehicular Tech. Conf. (VTC) 2000-Spring Proc., Tokyo, May 2000, vol. 2, pp. 1070-1074. [18] G. Hellstern, “Coded Modulation with Feedback Decoding Trellis Codes,” Proc. ICC’93(Geneva, Switzerland, May 1993), pp. 1071-1075. [19] R. G. Gallager, “Low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962. [20] T. Richardson, A. Shokrollahi, and R. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001. [21] A. Ashikhmin, G. Kramer, and S. ten Brink, “Design of Low-Density Parity-Check Codes for Modulation and Detection,” IEEE Trans. on Comm., vol. 52, No. 4, April 2004. [22] R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981. [23] W.E. Ryan, “An Introduction to LDPC Codes,” in CRC Handbook for Coding and Signal Processing for Recoding Systems (B. Vasic, ed.), CRC Press, 2004. [24] A. Ashikhmin, G. Kramer, and S. ten Brink, “Extrinsic information transfer functions: A model and two properties,” in Proc. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 20-22, 2002, pp. 742-747. [25] J. Hou, P. H. Siegel, and L. B. Milstein, “Design of Multi-input Multi-output Systems Based on Low-Density Parity-Check Codes,” IEEE Trans. on Comm., vol. 53, No. 4, April 2005. [26] M. Tuchler, “Design of Serially Concatenated Systems Depending on the Block Length,” IEEE Trans. on Comm., vol. 52, No. 2, Feb 2004. [27] Y.-K. Chen, “Turbo Coded MIMO with Interblock Memory,” master thesis, Graduate Institute of Communication Engineering, National Taiwan University, 2005. [28] M.-C. Lu, “LDPC coding with inter-block memories,” master thesis, Graduate Institute of Communication Engineering, National Taiwan University, 2005. [29] Y.L. Ueng, C.J. Yeh and M.C. Lin, “A Turbo Coded Modulation Scheme Using a Delay Processor,' 2000 International Symposium on Information Theory and Its Applications, Honolulu, Hawaii, USA, Nov. 5-8, 2000. [30] S. Le Goff, A. Glavieux and C. Berrou, “Turbo codes and high spectral efficient modulation,' IEEE Int. Conf. on Communications, 1994. [31] Shu Lin and D.Costello, “Error Control Coding,” second edition, Prentice Hall. [32] MacKay’s Encyclopedia of Sparse Graph Codes, http://www.inference.phy.cam.ac.uk/mackay/codes/data.html | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/34811 | - |
dc.description.abstract | Ashikhmin等人提出了在多輸入多輸出衰變通道中運作的低密度同位檢查編碼傳輸系統,在編碼長度大於十萬個位元時可以有貼近通道容量的效能。可是,這個系統在編碼長度小於一萬個位元時變的難以運用。在陳彥凱的碩士論文中密度同位檢查編碼傳送系統加上區碼記憶的系統在某些短碼時可以超越沒有區碼記憶的系統。在這篇論文中,我們在渦輪編碼多輸入多輸出傳輸架構上使用區碼記憶。首先,我們先簡單描述如何應用區碼記憶在渦輪編碼多輸入多輸出傳輸系統。重點擺在接收端的偵測方法。雖然外部訊息圖的分析在長碼時比較準確,但我們經由分析在外部訊息圖中,反映射器的轉移特徵曲線,依然可以解釋所提出架構的優點。最後,我們用各種天線數設定之下的模擬結果證實之前的推論。模擬結果顯示當編碼長度比較小時使用這個技術可以有很大的效能提升。 | zh_TW |
dc.description.abstract | In a paper authored by Ashikhmin, et. al., a low-density parity-check (LDPC) coded transmission scheme operated on multiple-input multiple-output (MIMO) fading channel was proposed, which can achieve capacity-approaching performance in case the code length is 100000 bits. Nevertheless, this scheme is difficult to use in case the code length is shorter than 10000 bits. According to Chen’s master thesis, LDPC coded MIMO using interblock memory outperform LDPC coded MIMO without interblock memory in some short code-length conditions. In this paper, we apply interblock memory to the turbo coded MIMO transmission system. First, a short description of applying interblock memory to turbo coded MIMO transmission system is given. We focus on the detection methods for the receiver scheme. Then we can explain the advantage of the proposed turbo coded MIMO by analyzing demapper transfer characteristics in Extrinsic Information Charts (EXIT charts), although EXIT charts usually works well only in the condition of long code length. Finally, our proposed schemes are verified by simulation results for various transmission antenna settings. The simulation results show that the proposed technique provides significant advantage in case that the code is short. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T06:35:00Z (GMT). No. of bitstreams: 1 ntu-95-R92942109-1.pdf: 618097 bytes, checksum: 761ed41724772ffb2d3c1ddc27a4e2f6 (MD5) Previous issue date: 2006 | en |
dc.description.tableofcontents | 1 Introduction 1
2 Preliminaries 4 2.1 MIMO Channel Model 4 2.2 Turbo Decoding 7 2.2.1 The MAP Decoding Algorithm 7 2.2.2 The Iterative Decoding Algorithm 14 2.3 Basics of Low-density Parity-check codes 20 2.3.1 Representations of LDPC codes 20 2.3.2 Iterative Decoding Algorithm: Sum-Product Algorithm (SPA) 22 2.3.3 Log-Domain SPA Decoding 24 2.4 Extrinsic Information Transfer (EXIT) Chart 27 2.4.1 Iterative Decoder for Parallel Concatenated Codes 27 2.4.2 Transfer Characteristics of Constituent Codes 29 3 Coded MIMO 32 3.1 Transmitter Side 33 3.2 Receiver Side 34 4 Coded MIMO Using Interblock Memory 37 4.1 Transmitter Side 38 4.2 Receiver Side 39 4.2.1 Restricted Iterative Detection 39 4.2.2 Complete Iterative Detection 40 4.2.3 Forward and Backward Detection 42 4.3 EXIT Chart Analysis 45 5 Simulations 52 5.1 Forward Detection 52 5.2 Forward and Backward Detection 58 5.3 Turbo and LDPC coded MIMO 63 6 Conclusions 65 Bibliography 66 | |
dc.language.iso | en | |
dc.title | 使用區碼記憶之渦輪編碼多輸入多輸出天線系統 | zh_TW |
dc.title | Turbo Coded MIMO Using Interblock Memory | en |
dc.type | Thesis | |
dc.date.schoolyear | 94-1 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 呂忠津(Chung-Chin Lu),蘇炫榮(Hsuan-Jung Su),蘇賜麟(Szu-Lin Su),韓永祥(Yunghsiang Sam Han) | |
dc.subject.keyword | 區碼記憶,渦輪碼,多輸入多輸出,遞迴解碼, | zh_TW |
dc.subject.keyword | interblock memory,turbo codes,multiple-input multiple-output,iterative decoding, | en |
dc.relation.page | 69 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2006-01-17 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-95-1.pdf 目前未授權公開取用 | 603.61 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。