(3.238.186.43) 您好!臺灣時間:2021/03/02 10:13
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:戴玲玲
論文名稱:基於疊代解碼效能的可變長度碼設計
論文名稱(外文):A Variable-Length Coder Design Based on the Perfermance of Iterative Decoding
指導教授:張文輝
指導教授(外文):Chang, Wen-Whei
學位類別:碩士
校院名稱:國立交通大學
系所名稱:電信工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2010
畢業學年度:98
語文別:中文
論文頁數:76
中文關鍵詞:可變長度碼疊代訊源通道解碼器額外資訊轉換圖雙向性可變長度碼索引指定
外文關鍵詞:Variable-Length CodeIterative source-channel decoderExtrinsic information transfer chartReversible variable-length CodeIndex assignment
相關次數:
  • 被引用被引用:1
  • 點閱點閱:209
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:10
  • 收藏至我的研究室書目清單書目收藏:0
本論文主要探討可變長度碼在疊代訊源通道解碼機制上的設計與應用。首先針對可變長度碼在位元層級上的籬柵結構,推導其軟性訊源解碼演算法,並將其整合運用於疊代訊源通道解碼機制。主要是針對具特定機率分佈的訊源,利用其可變長度編碼所得的殘餘冗息,再基於渦輪碼原則在疊代解碼過程中相互交換訊源及通道解碼器輸出的額外訊息。另外探討各種不同的可變長度編碼方式,並以額外資訊轉換圖加以理論分析。最後提出基於額外資訊轉換特性的可變長度碼設計,實驗証實能有效對抗通道雜訊干擾,進而提昇系統的強健性。
This thesis focuses on the variable‐length code (VLC) design using the performance of iterative source‐channel decoder (ISCD). Our work starts with a soft‐bit source decoding algorithm based on the bit‐based trellis. According to the source distribution, VLC can exploit the residual redundancy between source‐encoder indexes to enhance the robustness of the ISCD system. Then we analyze the performance of different VLC schemes, in terms of the extrinsic information transfer chart (EXIT chart). To further improve the reliability of ISCD system, we propose a new approach to VLC based on the EXIT chart. Simulation results show that the proposed VLC scheme can improve the error robustness of ISCD system.
第一章 緒論  1
第二章 可變長度碼之軟性訊源解碼機制  6
2.1 訊源解碼架構  7
2.2 位元層級籬柵圖  8
2.3 位元後驗機率推導  11
2.3.1 前向機率遞迴計算  11
2.3.2 後向機率遞迴計算  13
2.4 索引錯誤率之計算  15
第三章 可變長度碼之疊代訊源通道解碼機制  19
3.1 系統架構與流程  20
3.2 通道解碼演算法  23
3.3 解碼輸出之額外訊息  25
第四章 雙向性可變長度碼之最佳化設計  28
4.1 雙向性可變長度碼  29
4.1.1 基於最小平均長度的設計  31
4.1.2 基於錯誤更正能力的設計  33
4.2 額外資訊轉換特性分析  36
4.3 索引指定最佳化設計  45
第五章 實驗模擬與結果分析  51
第六章 結論與未來展望  71
附錄A S-random 交錯器  73
參考文獻  75
[1] R. Thobaben and J. Kliewer, “Low-Complexity Iterative Joint Source-Channel Decoding for Variable-Length Encoded Markov Sources,” IEEE Trans. Commun., vol. 53, no. 12, pp. 2054–2064, Dec. 2005.

[2] J. Kliewer and R. Thobaben, “Iterative Joint Source-Channel Decoding of Variable-Length Codes Using Residual Source Redundancy,” IEEE Trans. Wireless Commun., vol. 4, no. 3, pp. 919–929, 2005.

[3] T. Fingscheidt and P. Vary, “Softbit Speech Decoding: A New Approach to Error Concealment,” IEEE Trans. Speech Audio Processing, vol. 9, no. 3, pp. 240-251, 2001.

[4] J. Hagenauer, “Source-Controlled Channel Decoding,” IEEE Trans. Commun., vol. 43, pp. 2449-2457, Sep. 1995.

[5] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error Correcting Coding: Turbo Codes,” in Proc. IEEE International Conference on Communications (ICC), pp. 1064-1070, 1993.

[6] C. Berrou and A. Glavieux, “Near Optimum Error Correcting Coding And Decoding: Turbo-Codes,” IEEE Trans. on Commun., vol. 44, no. 10, pp. 1261-1271, 1996.

[7] R. Bauer and J. Hagenauer, “Symbol-by-symbol MAP decoding of variable length codes,” in Proc. 3rd ITG Conf. Source Channel Coding, Munich, Germany, Jan. 2000, pp. 111–116.

[8] R. Bauer and J. Hagenauer, “Iterative source/channel-decoding using reversible variable length codes,” in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2000, pp. 93–102.

[9] J. Kliewer and R. Thobaben, “Combining FEC and optimal soft-input source decoding for the reliable transmission of correlated variable- length encoded signals,” in Proc. IEEE Data Compression Conf., Snowbird, UT, Apr. 2002, pp. 83–91.

[10] R. Thobaben and J. Kliewer, “Robust decoding of variable-length encoded Markov sources using a three-dimensional trellis,” IEEE Commun. Lett., vol. 7, no. 7, pp. 320–322, Jul. 2003.

[11] L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 287–294, Mar. 1974.

[12] R. Bauer and J. Hagenauer, “On variable length codes for iterative source/channel-decoding,”in Proc. IEEE Data Compression Conf., 2001,pp. 273-282.

[13] M. Adrat and P. Vary, “Iterative source-channel decoding: improved system design using EXIT charts,” EURASIP J. Appl. Signal Processin, pp. 928–941, May 2005.

[14] K. Zeger and A. Gersho, “Pseudo-gray coding,” IEEE Trans. Commun., vol. 38, no. 12, pp. 2147–2158, 1990.

[15] V. B. Balakirsky, “Joint source-channel coding with variable length codes,” in Proc. IEEE Int. Symp. Inf. Theory, Ulm, Germany, Jum. 1997, p.419

[16] C. W. Tsai and J. L. Wu, “On constructing the Huffman-code based reversible variable length codes,” IEEE Trans. Commun., vol. 49, pp. 1506–1509, Sept. 2001.

[17] K. Lakovic´ and J. Villasenor, “On design of error-correcting reversible variable length codes,” IEEE Commun. Lett., vol. 6, no. 8, pp. 337–339, Aug. 2002.

[18] 潘彥璋,「基於索引層級的疊代訊源通解碼機制」,國立交通大學碩士論文,民國九十七年。

[19] 陳亞民,「渦輪原則在合併訊源通道編碼之研究」,國立交通大學碩士論文,民國九十八年。

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔