پديد آورنده :
هيودي، مرتضي
عنوان :
تحليل كدهاي حاصل ضرب براي كانال پاك شدگي دو دويي
گرايش تحصيلي :
رياضي كاربردي،نظريه اطلاعات و كد گذاري
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده رياضي
صفحه شمار :
ده،107ص.: مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
مرتضي اسماعيلي
استاد مشاور :
محمد حسام تدين
توصيفگر ها :
فاصله متوقف كننده , افزونگي متوقف كننده , كدهاي LDPC , كد حاصل ضرب
تاريخ نمايه سازي :
18/11/89
استاد داور :
محمود احمديان عطاري، محمد علي خسروي فرد، قهرمان طاهريان
كد ايرانداك :
ID354 دكتري
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتال
چكيده انگليسي :
Analysis of Product Codes for the Binary Erasure Channel Morteza Hivadi m hivadi@math iut ac ir June 19 2010 Doctor of Philosophy Thesis Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Morteza Esmaeili emorteza@cc iut ac ir Advisor Dr Mohammad Hesam Tadayon tadayon@itrc ac ir Department Graduate Program Coordinator Dr Azam Etemad ae110mat@cc iut ac ir Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Iran Telecommunication Research Center ITRC Tehran Iran Abstract The performance of a linear code under iterative decoding over the binary erasure chan nel is determined by stopping sets The relationship between stopping sets in a few parity check matrices of a given product code and those in the parity check matrices for the component codes is determined We derive upper bounds on the stopping re dundancy of product codes based on the stopping redundancy of the component codes and then obtain new upper bounds on the stopping redundancy of product codes and show how they improve the before known results It is shown that the multidimen sional single parity check product codes are the optimal stopping redundancy codes In this thesis construction of high stopping distance low density parity check prod uct codes with nite geometry LDPC and Hamming codes as the constituent codes is considered It is shown that these codes have high stopping distance compared to the other LDPC codes For example linear 511 180 30 945 407 27 2263 1170 30 and 4095 2101 54 LDPC codes are designed with the stopping distances 30 27 30 and 54 respectively It is well known that the decoding failure probability of iterative decoding over the BEC is computed by the multiplicity of the stopping distance when the erasure probability is small The decoding failure probability of iterative decoding for Hamming product codes are studied It is shown that the decoding failure probability of iterative decoding for Hamming product code is near the decoding failure probability of the maximum likelihood and row column decoding when the erasure probability is small Key Words Stopping distance Stopping redundancy LDPC codes product code 1 Introduction Using iterative belief propagation techniques Low Density Parity Check LDPC codes are capacity approaching codes which means that practical constructions exist that 1
استاد راهنما :
مرتضي اسماعيلي
استاد مشاور :
محمد حسام تدين
استاد داور :
محمود احمديان عطاري، محمد علي خسروي فرد، قهرمان طاهريان
