Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電信工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42551
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor蘇炫榮
dc.contributor.authorKai-Sheng Chenen
dc.contributor.author陳凱昇zh_TW
dc.date.accessioned2021-06-15T01:16:04Z-
dc.date.available2010-08-03
dc.date.copyright2009-08-03
dc.date.issued2009
dc.date.submitted2009-07-28
dc.identifier.citation[1] C.-H. Hsu and A. Anastasopoulos, Asymptotic weight distributions of irregular
repeat-accumulate codes,' in Global Telecommunications Conference, St. Louis,
MO, Nov. 2005, pp. 1147 { 1151.
[2] T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley,
1991.
[3] M. W. Marcellin and T. R. Fischer, Trellis coded quantization of memoryless
and Gauss-Markov sources,' IEEE Trans. Commun., vol. 38, no. 1, pp. 82{93,
Jan. 1990.
[4] G. Ungerboeck, Channel coding with multilevel/phase signals,' IEEE Trans.
Inform. Theory, vol. 28, no. 6, pp. 55{67, Jan. 1982.
[5] M. Wainwright and E. Martinian, Low-density graph codes that are optimal
for binning and coding with side information,' IEEE Trans. Inform. Theory,
vol. 55, no. 3, pp. 1061{1079, March 2009.
[6] A. Braunstein, F. Kayhan, and R. Zecchina, E±cient ldpc codes over gf(q) for
lossy data compression,' in available online in http://arxiv.org/abs/0901.4467.
[7] A. D. Wyner and J. Ziv, The rate-distortion function for source coding with
side information at the decoder,' IEEE Trans. Inform. Theory, vol. 22, no. 1,
pp. 1{10, Jan. 1976.
[8] A. D. Wyner, The rate-distortion function for source coding with side infor-
mation at the decoder-II: General sources,' Inf. Contr., vol. 38, pp. 60{80,
Jan. 1978.
[9] D. Slepian and J. K. Wolf, Noiseless coding of correlated information sources,'
IEEE Trans. Inform. Theory, vol. 19, no. 4, pp. 471{480, July 1973.
[10] Z. Xiong, A. D. Liveris, and S. Cheng, Distributed source coding for sensor
networks,' IEEE Signal Processing Mag., vol. 21, no. 5, pp. 80{94, 2004.
[11] S. S. Pradhan and K. Ramchandran, Distributed source coding using syn-
dromes (DISCUS): Design and construction,' IEEE Trans. Inform. Theory,
vol. 49, no. 3, pp. 626{643, Mar. 2003.
[12] S.C.Draper and G.Wornell, Side information aware coding strategies for sensor
networks,' vol. 22, no. 6, pp. 966{976, 2004.
[13] G. Kramer, M. Gastpar, and P. Gupta, Cooperative strategies and capacity
theorems for relay networks,' IEEE Trans. Inform. Theory, vol. 51, no. 9, pp.
3037{3063, Sep. 2005.
[14] A. D. Wyner, The rate-distortion function for source coding with side infor-
mation at the decoder-II: General sources,' Inf. Contr., vol. 38, pp. 60{80,
Jan. 1978.
[15] R. Zamir, S. Shamai, and U. Erez, Nested linear/lattice codes for structured
multiterminal binning,' IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1250{
1276, June 2002.
[16] S. Lin, S. Lin, K. Chen, and H. Su, Coding for noisy quadratic-Gaussian
Wyner-Ziv problem : A successive encoding approach,' in Information Theory
Workshop on Networking and Information Theory, Volos, Greece, june 2009.
[17] S.-C. Lin and H.-J. Su, Vector Wyner-Ziv coding for vector Gaussian CEO
problem,' in Information Sciences and Systems, 2007 41st Annual Conference
on., Mar. 2007, pp. 333{338.
[18] S. C. Lin and H. J. Su, Practical vector dirty paper coding for mimo gaussian
broadcast channels,' IEEE J. Select. Areas Commun., vol. 25, no. 7, pp. 1345{
1357, Sept. 2007.
[19] F. Kschischang, B. Frey, and H.-A. Loeliger, Factor graphs and the sum-
product algorithm,' IEEE Trans. Inform. Theory, vol. 47, no. 2, p. 498V519,
Feb. 2001.
[20] H. l. Van Trees, Detection, estimation, and modulation theory. J: Wiley, 2001.
[21] E. Martinian and J. Yedidia, Iterative quantization using codes on graphs,'
in Allerton Conf. Control, Comput. Commun., Oct. 2003.
[22] M. Mezard and R. Zecchina, Random k-satis‾ability: from an analytic solution
to an e±cient algorithm,,' Phys. Rev. E, vol. 66, no. 1, pp. 2001{3007, Mar.
2002.
[23] M.J.Wainwright and E.Maneva, Lossy source coding by message-passing and
decimation over generalized codewords of ldgm codes,' in Int. Symp. Inform.
Theory, Adelaide, Australia, Sep. 2005.
[24] T. Filler and J. Fridrich, Binary quantization using belief propagation with
decimation over factor graphs of ldgm codes,' in Allerton Conf. Control, Com-
put. Commun., Sep. 2007.
[25] Q. C. Wang and C. He, Approaching 1.53-db shaping gain with ldgm quanti-
zation codes,' Jan. 2008.
[26] D.Divsalar, H. Jin, and R. McEliece, Coding theorems for 'turbo-like' codes,'
in Proc. 36th Allerton Conf. Communications, Control, and Computing, Ur-
bana, IL, Sept. 1998, pp. 23 { 25.
[27] H. Jin, A. Khandekar, and R. McEliece, Irregular repeat-accumulate codes,'
in Proc. 2nd Int. Symp. Turbo Codes Related Topics, Brest,France, Sept. 2000,
pp. 1 { 8.
[28] S.T.Brink, Code doping for triggering iterative decoding convergence,' in Int.
Symp. Inform. Theory, Washington, DC, June. 2001.
[29] R. Zamir and M. Feder, On lattice quantization noise,' IEEE Trans. Inform.
Theory, vol. 42, no. 4, pp. 1152{1159, July. 1996.
[30] Y.Yang, S.Cheng, Z.Xiong., and W.Zhao, Wyner-Ziv Coding Based on TCQ
and LDPC Cpdes,' IEEE Trans. Commun., vol. 57, no. 2, june 2009.
[31] S. ten Brink and G. Kramer, Design of repeat-accumulate codes for iterative
detection and decoding,' IEEE Trans. Signal Processing, vol. 51, no. 11, pp.
2764 { 2772, Nov. 2003.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42551-
dc.description.abstract在此本論文中,我們考慮一個同時是好的通道編碼與訊號源編碼的編碼架構,我們將其命名為SCS 問題。除了在理論上的價值之外,SCS 的主要應用是在於實做Wyner-Ziv 編碼以及髒紙編碼(Dirty Paper coding)。目前被廣泛使用於SCS 問題的編碼為網格編碼調製/量化(Trellis coded modulation/quantization)。但使用網格編碼調製/量化在當與訊息傳遞演算法(Message passing)並用時會有太高的複雜度。在此論文,對於SCS 問題我們提出兩個低密度架構針對在Wyner-Ziv 編碼及髒紙編碼的應用上。根據模擬結果,我們提出的方法比現有最佳的編碼為網格編碼調製/量化有更好的效能,另外在複雜度方面也有顯著下降。zh_TW
dc.description.provenanceMade available in DSpace on 2021-06-15T01:16:04Z (GMT). No. of bitstreams: 1
ntu-98-R96942056-1.pdf: 632492 bytes, checksum: 10907a14c1e9804241961b6ff0909e46 (MD5)
Previous issue date: 2009
en
dc.description.tableofcontents1 Introduction 1
1.1 Simultaneously good channel and source coding (SCS) problem and
contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Coding with side information . . . . . . . . . . . . . . . . . . . . . . 2
1.3 Overview of Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.4 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 Sparse Graph Codes in Channel Coding and Lossy Source coding 4
2.1 Sparse Graph Codes in Channel Coding . . . . . . . . . . . . . . . . 4
2.1.1 Message-passing algorithm . . . . . . . . . . . . . . . . . . . . 5
2.2 Sparse Graph Codes in Source Coding . . . . . . . . . . . . . . . . . 8
2.2.1 Message passing algorithm with decimation . . . . . . . . . . 9
3 Sparse Graph Coding Structure for SCS problem 12
3.1 Irregular Repeat Accumulate codes (IRA) . . . . . . . . . . . . . . . 12
3.2 IRA and Low Density Generator Matrix codes(LDGM) . . . . . . . . 13
3.3 The IRA code with Doping . . . . . . . . . . . . . . . . . . . . . . . 14
4 Low Complexity Encoding Algorithm for the SCS Problem 17
4.1 The error propagation problem of decimation . . . . . . . . . . . . . 17
4.2 The Low Complexity Encoding Algorithm . . . . . . . . . . . . . . . 18
5 Simulation Environment and Results 21
6 Conclusions 26
dc.language.isoen
dc.subject產生器矩陣碼zh_TW
dc.subject低密&#64001zh_TW
dc.subjectWyner-Ziv 編碼zh_TW
dc.subject疊加編碼zh_TW
dc.subject雜zh_TW
dc.subject規則重複&#63823zh_TW
dc.subject加碼zh_TW
dc.subjectsuperposition codingen
dc.subjectIrregular Repeat Accumulate codes(IRA)en
dc.subjectLow Density Generator Matrix codes(LDGM)en
dc.subjectWyner-Ziv codingen
dc.subjectdopingen
dc.title同時為好的通道編碼與訊號源編碼的低密度編碼及其應用zh_TW
dc.titleLow density constructions for simultaneously good for channel and source coding problem (SCS) with applicationsen
dc.typeThesis
dc.date.schoolyear97-2
dc.description.degree碩士
dc.contributor.oralexamcommittee易志孝,葉丙成,林士駿
dc.subject.keywordWyner-Ziv 編碼,低密&#64001,產生器矩陣碼,&#63847,規則重複&#63823,加碼,&#63851,雜,疊加編碼,zh_TW
dc.subject.keywordWyner-Ziv coding,Low Density Generator Matrix codes(LDGM),Irregular Repeat Accumulate codes(IRA),doping,superposition coding,en
dc.relation.page30
dc.rights.note有償授權
dc.date.accepted2009-07-28
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-98-1.pdf
  未授權公開取用
617.67 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved