跳到主要內容

臺灣博碩士論文加值系統

(54.80.249.22) 您好!臺灣時間:2022/01/20 07:59
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:張志偉
論文名稱:具抑制錯誤蔓延之能力的二元前置碼
論文名稱(外文):Error Resilient Binary Prefix Codes
指導教授:黃育銘
學位類別:碩士
校院名稱:國立暨南國際大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:中文
論文頁數:73
中文關鍵詞:變動長度碼同步碼延伸同步碼
外文關鍵詞:variable-length codesynchronizing codeextended synchronizing code
相關次數:
  • 被引用被引用:0
  • 點閱點閱:136
  • 評分評分:
  • 下載下載:10
  • 收藏至我的研究室書目清單書目收藏:0
摘要
在一個錯誤率高的多媒體通訊環境中,傳統的無失真資料編碼技術,往往會因為只有一個位元的錯誤,很有可能導致編碼器與解碼器間的不同步,隨即引發錯誤蔓延的現象,雖然,錯誤更正碼技術能減少錯誤的數目,但是額外增加的資料量畢竟太大,因此對於建構出較佳抑制錯誤蔓延的機制是我們所要探討的主題。
為了抑制錯誤蔓延,首先,我們研究許多對變動長度碼作改進的文獻,探討其中各類同步碼之建構演算法,之後針對同步碼演算法加以改良;接著,將改良的方法應用於靜態影像實作上,結合延伸同步碼來改進同步碼的缺點,當實驗靜態影像遭受錯誤率為10-3情況下,其與標準霍夫曼方法等比較,平均上均能呈現較佳的影像品質。

Abstract
For an error-prone communication channel, the conventional lossless data coding techniques may not be robust any more, because any bit error can lead to de-synchronization between the decoder and the encoder causes error propagation. Although error-correcting codes can reduce the number of errors, the resulting bit rate may be too high. Thus, a major challenge in source coding research is to discover various error-resilient codes used to transmit the multimedia data in the wireless-network world.
To avoid the error propagation, we have studied a lot of writings about the improvement of variable length codes, and we have examined the constructing algorithms of each kind of synchronizing codes among those works. Then, we try to improve those constructing algorithms of synchronizing codes, and apply the modified algorithm to the JPEG standard. Furthermore, an extended synchronizing code is also combined as well to improve the shortcomings of synchronizing codes. On the error rate 10-3, the above-modified method compared with the standard Huffman based method, can usually have better error resilient ability.

內容目次
摘要----------------------------------------------------1
內容目次------------------------------------------------2
圖目目次------------------------------------------------4
表目目次------------------------------------------------6
第一章 簡介-------------------------------------------7
1.1 研究動機------------------------------------------7
1.2 論文架構------------------------------------------10
第二章 具抑制錯誤蔓延之能力的前置碼-------------------11
2.1 前置碼--------------------------------------------11
2.2 霍夫曼碼------------------------------------------13
2.3 可逆變動長度碼------------------------------------16
2.4 同步碼--------------------------------------------20
2.5 延伸同步碼----------------------------------------24
第三章 同步碼之建構演算法-----------------------------27
3.1 Ferguson與Rabinowitz [1984] 演算法----------------30
3.2 Montgomery與Abrahams [1986] 演算法----------------35
3.3 Capocelli [1992] 演算法---------------------------38
3.4 Escott和Perkins [1998] 演算法---------------------41
3.5 改良的同步碼建構演算法----------------------------45
3.6 結果比較------------------------------------------50
第四章 延伸同步碼之建構與偵測方法---------------------55
4.1 延伸同步字碼之建構方法----------------------------55
4.2 提出之延伸同步字碼之偵測方法----------------------57
第五章 實驗結果---------------------------------------59
第六章 結論與未來展望---------------------------------68
6.1 結論----------------------------------------------68
6.2 未來展望------------------------------------------69
參考文獻------------------------------------------------70

參考文獻 :
[1] P. G. Neumann, “ Efficient error-limiting variable-length codes, ” IRE Trans. Inform. Theory, vol. IT-8, pp.292-304, July 1962.
[2] E. N. Gilbert and E. F. Moore, “ Variable-length binary encoding, “Bell Syst. Tech. J.,vol. 38, pp. 933-967, July 1959.
[3] M. P. Schutzenberger, “ On synchronizing prefix codes, “Inform. Contr.,vol. 11, pp. 396-401, 1967.
[4] B. Ruder, “ Construction of minimum-redundancy codes with an optimum synchronizion property, ” IEEE Trans. Inform. Theory, vol. IT-17, pp. 478-487, July 1971.
[5] R. Hunter and A. H. Robinson, “ International digital facsimile coding standards, “ Proc. IEEE, pp. 854-867, July 1980.
[6] O. R. Mitchell and A. J. Tabatabi, “ Channel error recovery for transform image coding, “ IEEE Trans. Commun, vol. 29-12, pp. 1754-1762, Dec. 1981.
[7] T. J. Ferguson and J. H. Rabinowiz, “ Self-synchronizing Huffman codes, ” IEEE Trans. Inform. Theory, vol. IT-30, pp. 687-693, July 1984.
[8] J. C. Maxted and J. P. Robinson, “ Errors recovery for variable length codes, ” IEEE Trans. Inform. Theory, vol. IT-31, pp. 794-801, Nov. 1985.
[9] B. L. Montgomery and J. Abrahams, “ Synchronization of binary source codes, ” IEEE Trans. Inform. Theory, vol. IT-32, pp.849-854, Nov 1986.
[10] R. M. Capocelli, L. Gargano,and U. Vaccaro, ” On the characterization of statistically synchronizable variable-length codes,”IEEE Trans. Inform. Theory, vol. 34, pp. 817-825, July 1988.
[11] M. Rahman and S. Misbahuddin, “ Effects of a binary symmetric channel on the synchronization recovery of variable length codes,” Computer J., vol. 32, pp.246-251, 1989.
[12] L. E. Stanfel, ” New optimization models for designing synchronizing codes”, Math. Comput. Modeling, vol. 13, no. 9, pp. 33-48, 1990.
[13] S.-M. Lei and M.-T. Sun, “ An entropy coding system for digital HDTV applications, “ IEEE Trans. Circuits Syst. For Video Technol, vol. 1, no. 1, pp. 147-154, Mar. 1991.
[14] R. M. Capocelli, A. A. D. Santis, L. Gargano, and U. Vaccaro, ” On the construction of statistically synchronizable codes,”IEEE Trans. Inform. Theory, vol. 38, pp.407-414, Mar. 1992.
[15] W. -M. Lam and A. R. Reibman, “ Self-synchronizing variable-length codes for image transmission, ” in Proc. ICASSP’92, vol. 3, pp. 477-480.
[16] Y. Takishima, M. Wada, and H. Murakami, “ Error states and synchronization recovery for variable length codes, “ IEEE Trans. Commun, vol. 42, no. 2-4, pp. 782-792, Feb./Mar./Apr. 1994.
[17] P. F. Swaszek and P. DiCicco, “ More on the error recovery for variable-length codes,” IEEE Trans. Inform. Theory, vol. 41, pp. 2064-2071, Nov. 1995.
[18] W. -M. Lam and S. R. Kulkarni, “ Extended synchronizing codes for binary prefix codes, ” IEEE Trans. Inform. Theory, vol. 42, pp. 984-987, May 1996.
[19] M. R. Titchener, “ The synchronization of variable-length codes,” IEEE Trans. Inform. Theory, vol. 43, pp. 683-691, Mar. 1997.
[20] A. E. Escott and S. Perkins, “ Binary Huffman equivalent codes with a short synchronizing codeword, “ IEEE Trans. Inform. Theory, vol. 44, pp. 346-351, Jan 1998.
[21] S. Hemami, “ Robust Image Transmission Using Resynchronizing Variable-Length Codes and Error Concealment, “ IEEE J. on Selected Areas in Communications, vol. 18, pp. 927-939, Jun. 2000.
[22] ISO/IEC 10918-1, “ Information Technology - Digital Compression And Coding Of Continuous-Tone Still Image-Requirements And Guidelines”
[23] D. A. Huffman, “ A method for the construction of minimum redundancy codes, ” Proc. IRE, vol. 40, no. 2, pp. 1098-1101, 1952.
[24] A. S. Fraenkel and S. T. Klein, “ Bidirectional Huffman coding, ” The Computer J., vol. 33, no. 4, 1990.
[25] Y. Takishima, M. Wada, and H. Murakami, “ Reversible variable length codes, “ IEEE Trans. Commun., vol. 43, pp. 158-162, 1995.
[26] J. Wen and J. D. Villasenor, “ A class of reversible variable length codes for robust image and video coding, “ in Proc. IEEE Int. Conf. Image Processing, vol. 2, pp.65-68, 1997.
[27] J. Wen and J. D. Villasenor, “ Reversible variable length codes for efficient and robust image and video coding, ”in Data Compression Conf., pp. 471-480, 1998.
[28] J. J. Stiffler, Theory of Synchronous Communication. Englewood Cliffs, NJ: Prentice-Hall, 1971
[29] S. Perkins and A. E. Escott,” Synchronizing codewords for q-ary Huffman codes ”, in Elsevier Discrete Mathematics , Volume: 197-198, February 28, 1999, pp. 637-655
[30] S. Perkins and D.H. Smith, “ A scheme for the synchronization of variable length codes “, in Elsevier Discrete Applied Mathematics ,Volume: 101, Issue: 1-3, April 15, 2000, pp. 231-245

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
1. 邱浩哲(2001a),〈未來數位廣播發展與市場趨勢〉,《廣電人月刊》,2001年2月,pp.10~11。
2. 李木村(2001),〈數位音訊廣播DAB的探討〉,《廣電人月刊》,2001年3月,pp.24~27。
3. 李慧馨(1999),〈從第三波廣播革命─數位廣播對廣播生態的影響〉,《藝術學報》,第65期,pp.151-157。
4. 邱浩哲(2001c),〈看DAB如何運用既有資源創造加值服務〉,《廣電人月刊》,2001年3月,pp.35~39。
5. 洪清標(1996),〈數位音訊廣播系統概論〉,《電腦與通訊》,1996年5月,pp.53~60。
6. 徐肇徵(2001),〈數位廣播之發展狀況與產品應用〉,《廣電人月刊》,2001年6月,pp.60~63。
7. 許士軍(1994),〈贏得市場的企業特色競爭〉,《世界經理文摘》,第96期。
8. 陳清河(1998),〈數位廣播與廣播生態的脈動〉,《廣播月刊》,1998年7月,pp.30~32。
9. 黃葳威(2001),〈DAB服務內容與法規研議〉,《數位視訊多媒體月刊》,2001年10月。
10. 楊立人(1999),〈數位聲音廣播可行性分析與發展動態〉,《無線電技術季刊》,第38期,1999年5月,pp.25-34。
11. 廖慧娟(1999),〈你聯播我聯播:廣播為何要聯網?〉,《廣播月刊》,1998年3月,pp.23~25。
12. 潘中一(2001),〈數位音訊廣播向前行〉,《廣電人月刊》,2001年3月,pp.44~45。
13. 劉利安(2001),〈數位廣播的問卷調查與回應〉,《數位視訊多媒體月刊》,2001年10月。
14. 魏裕屏(2001),〈多媒體數位廣播之軟體工業〉,《廣電人月刊》,2001年3月,pp.32~34。
15. 顧爾德(2001),〈追討黨產不是政黨談判的籌碼〉,《新新聞週報》,768期,2001年11月。