Responsive image
博碩士論文 etd-0907104-161309 詳細資訊
Title page for etd-0907104-161309
論文名稱
Title
低功率渦輪碼解碼器之設計與實現
Design and Implementation of Low Power Turbo Code Decoder
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
42
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2004-07-09
繳交日期
Date of Submission
2004-09-07
關鍵字
Keywords
低功率、渦輪碼
turbo code, low power
統計
Statistics
本論文已被瀏覽 5647 次,被下載 3574
The thesis/dissertation has been browsed 5647 times, has been downloaded 3574 times.
中文摘要
渦輪碼的低功率設計對現今的通訊系統如第三代通訊系統來說是一個相當重要的研究課題。在渦輪碼的架構中用來儲存分支路徑值以狀態路徑直的記憶體,不論是在功率的消耗或是面積上都占了整個架構的大部分。因此在本論文中是以儲存編碼端的輸入值以及時計算產生分支路徑值而不是儲存計算出的分支路徑值。另外,還提出了一個新的簡化儲存狀態路徑值記憶體的方法,此方法僅需增加少量的額外硬體架構便可減少一半的記憶體數量。此外,相同的設計方法在非遞迴編碼應用上還可以更進一步的簡化軟輸出值計算模組的架構。最後經由實驗結果顯示我們所提出的方法在面積及功率的消耗上分別節省了約40%及13%。
Abstract
Design of low power Turbo decoder is one of the key issues in many modern communication systems such as 3 GPP. For the Turbo decoder architecture, the memory for the storage of the branch metric and state metric represents a major part of the entire decoder no matter in silicon area or power dissipation. Therefore, instead of saving the computed branch memory, this thesis adopts an alternative approach by saving the input in order to generate the branch memory on line. Furthermore, a novel design of state metric unit is proposed such that the size of the total state metric can be effectively reduced by a half with slightly overhead of adders/subtractors. For non-recursive systematic encoding applications, the same design methodology can further reduce the number of arithmetic units required in the soft-output calculating module. Our preliminary experimental result shows that the proposed design methodology can achieve 40% and 13% reduction on the gate count and power dissipation respectively.
目次 Table of Contents
第一章 : 緒論…………………………………………………1
1. 1研究動機……………………………………………………………1
1. 2 各章提要…………………………………………………………2

第二章 : 渦輪碼的原理與架構………………………………3
2.1 渦輪碼的架構………………………………………………………3
2.1.1渦輪編碼器架構………………………………………………………3
2.1.2渦輪解碼器架構………………………………………………………5
2.2 最大事後機率演算法……………………………………………….6
2.3 Log-MAP演算法…………………………………………………….7
2.4 移動式視窗的運作方法…………………………………………….9
第三章 : 渦輪解碼器之硬體設計…………………………..12
3.1 SISO單元………………………………………………………….12
3.1.1 BMC設計………………………………………………………12
3.1.2 ACSOC設計……………………………………………………14.
3.1.3 LLRC設計………………………………………………………17
第四章 : 渦輪解碼器之低功率設計………………………..19
4.1 SISOγ-RAM部分的修正…………………………………………19
4.1.1 Classical solution…………………………………..19
4.1.2 Proposed solution…………………………………….19
4.2 SISOα-RAM部分的修正………………………………………..21
4.2.1 Classical solution……………………………………21
4.2.2 Proposed solution……………………………………21
4.2.3 SMR設計……………………………………………………25
4.3 非遞迴碼的應用………………………………………………….28
4.3.1αRAM修正和非遞迴應用結合的設計……….……………31
第五章 : 結果與討論……………………………………….33
參考文獻……………………………………………………..34
參考文獻 References
[1] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error –correcting coding and decoding: Turbo Codes,” in Proc. ICC’93 , pp . 1064-1070, May, 1993.
[2] “3rd Generation Partnership Project; Technical specification group radio access network ; Multiplexing and channel coding(FDD),” 3GPP TS 25.212 v3.6.0, July, 2001.
[3] L. R. Bahl , J. Coke , F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, Vol. 42, pp. 429-445, Mar., 1974.
[4] P. Robertson, E. Villebrn, and P. Hoeher, ”A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,” in Proc. ICC’95, pp. 1009-1013, June, 1995.
[5] J. Hagenauer and P. Hoeher, ”A Viterbi algorithm with Soft-Decision Outputs and its Application,” in Proc. Globecom’89, pp.1680-1689, Nov., 1989.
[6] J. A. Erfanian and S. Pasupathy, ”Low-complexity parallel-structure symbol by symbol detection for ISI channels,” in Proc. IEEE Pacific Rim Conf. on Commu., Computers and Signal Processing, pp. 350-353, June, 1989.
[7] Z. Wang, H. Suzki, and K. K. Parhi, ”VLSI implementation issue of Turbo decoder design for wireless applications,” in Proc. SiPs’ 99’, Design and Implementation, pp. 415-418, Oct., 1999.
[8] A. J. Viterbi, “An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes, ” IEEE J. Select. Areas in Commu., vol. 16, pp. 260-264, Feb., 1998.
[9] C. Bai, J. Jiang, and P. Zhang, “Simplified recursive structure for turbo decoder with Log-MAP algorithm” IEEE 55th Conf., vol.2, pp. 1012 – 1015, May, 2002.
[10] G. Masera, M. Mazza, G. Piccinini, F. Viglione, and M. Zamboni, ”Architectural strategies for low-power VLSI turbo decoders,” IEEE Trans. on VLSI system, Vol. 10, pp. 279 – 285, June, 2002.
[11] M. Elassal and M. Bayoumi, “A low power turbo decoder architecture,” IEEE Workshop on Signal Processing Systems, pp.105-110, Aug., 2003.
[12] H. Dawid and H. Meyr, “Real-time algorithm and VLSI architectures for soft output MAP convolutional decoding,” in Proc. Personal, Indoor and Mobile Radio Commu., PIMRC’95, vol. 1, pp. 193-197, May, 1995.
[13] S. S. Pietrobon and S. A. Barbulescu, “A simplification of the modified Bahl algorithm for systematic convolutional codes,” in Proc. Int. Symp. Inform. Theory and Its Appli., pp. 1073-1077, Nov., 1994.
[14] E. Boutillon, W. J. Gross, and P. G. Gulak, “VLSI architectures for the MAP algorithm,” IEEE Trans. on Commu., vol. 51, No. 2, Feb., 2003.
[15] G. Masera, G. Piccinini, M. Ruo, and M. Zamboni, ”VLSI architectures for turbo codes,” IEEE Trans. on VLSI system, vol. 7, No. 3, Sept., 1999.
[16] S. S. Pietrobon, ”Implementation and performance of a Turbo/MAP decoder,” Int. J. of Satellite Commu., vol. 16, pp. 23-46, Feb., 1998.
[17] E. Boutillon, W. J. Gross, and G. Gulak, ” VLSI architectures for the forward-backward algorithm,” IEEE trans. on Commu., pp. 175-182, Feb., 2001.
[18] I. Atluri and T. Arslan, ”Low power VLSI implementation of the map decoder for turbo codes through forward recursive calculation of reverse state metrics,” IEEE Int. SOC Conf., pp.408 – 411, Sept., 2003.
[19] P. Robertson, ”Illuminating the structure of coder and decoder for parallel concatenated recursive systematic turbo codes,” in Proc. GLOBECOM’94, pp. 1298-1303, Dec., 1994.
[20] J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar., 1996.
[21] A. Worm, H. Lamm, and N. When, ”VLSI architectures for high-speed MAP decoders,” VLSI Design 14th Int. Conf., pp. 446-453, 2001.
[22] G. Colavolpe, G. Ferrari, and R. Raheli, “Reduced-state BCJR-type algorithm,” IEEE J. Select. Areas in Commu., vol. 19, No. 5, May, 2001.
[23] C. Schurgers, F. Catthoor, and M. Engels, “Memory optimization of MAP turbo decoder algorithm,” IEEE Trans. on VLSI system, vol. 9, No. 2, April, 2001.
[24] M. L. Vallejo, S. A. Mujtaba, I.Lee, “A low power architecture for maximum a posteriori decoding,” 36th Asilomar Conf., Signals, Systems and Computers, pp.47-51, Nov., 2002.
[25] S. J. Lee, N. R. Shanbhag, A. C. Singer, ”A low-power VLSI architecture for turbo decoding,” in Proc. Int. Symp., Low Power Electronics and Design, pp.25-27, Aug., 2003.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內外都一年後公開 withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code