| 000 | 01800cam a2200337 a 4500 | ||
|---|---|---|---|
| 003 | EG-GiCUC | ||
| 005 | 20250223030548.0 | ||
| 008 | 120211s2011 ua e f m 000 0 eng d | ||
| 040 |
_aEG-GiCUC _beng _cEG-GiCUC |
||
| 041 | 0 | _aeng | |
| 049 | _aDeposite | ||
| 097 | _aM.Sc | ||
| 099 | _aCai01.13.08.M.Sc.2011.Ah.L | ||
| 100 | 0 | _aAhmed Hassan Mahmoud Elsayed Hareedy | |
| 245 | 1 | 0 |
_aLDPC decoding using selective max-min (SMM) algorithm : _bTheory and implementation / _cAhmed Hassan Mahmoud Elsayed Hareedy ; Supervised Mohamed Mohamed Khairy , Amr Galal Eldin Wassal |
| 246 | 1 | 5 |
_aحل شفرة الكود منخفض الكثافة المتحقق من التكافؤ باستخدام خوارزمية الانتقاء من أكبر القيم الصغري : _bالنظرية و التنفيذ |
| 260 |
_aCairo : _bAhmed Hassan Mahmoud Elsayed Hareedy , _c2011 |
||
| 300 |
_a89 P. : _bplans ; _c30cm |
||
| 502 | _aThesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Electronics and Communication | ||
| 520 | _aWith the growing importance of error correction in different communication systems, using an efficient and easily implementable code is always appreciated. Two main iterative decoding algorithms are usually used for the important class of codes known as low density parity check (LDPC) codes; namely the sum-product (SP) algorithm and the min-sum MS | ||
| 530 | _aIssued also as CD | ||
| 653 | 4 | _aLow density parity check (LDPC) code | |
| 653 | 4 | _aMin-sum (MS) algorithm | |
| 653 | 4 | _aSum-product (SP) algorithm | |
| 700 | 0 |
_aAmr Galal Eldin Wassal , _eSupervisor |
|
| 700 | 0 |
_aMohamed Mohamed Khairy , _eSupervisor |
|
| 856 | _uhttp://172.23.153.220/th.pdf | ||
| 905 |
_aNazla _eRevisor |
||
| 905 |
_aSamia _eCataloger |
||
| 942 |
_2ddc _cTH |
||
| 999 |
_c37327 _d37327 |
||