رکورد قبلیرکورد بعدی

" ALGEBRAIC AND COMBINATORIAL CONSTRUCTIONS OF EFFICIENTLY ENCODABLE QUASI-CYCLIC LDPC CODES "


Document Type : Latin Dissertation
Language of Document : English
Record Number : 150118
Doc. No : ET21910
Main Entry : LAN LAN
Title Proper : ALGEBRAIC AND COMBINATORIAL CONSTRUCTIONS OF EFFICIENTLY ENCODABLE QUASI-CYCLIC LDPC CODES
Note : This document is digital این مدرک بصورت الکترونیکی می باشد
Abstract : Low density parity check (LDPC) codes, discovered by Gallager in 1962, were redis-covered in the late 1990's and shown to form a class of Shannon limit approaching codesin the early 2000's. Ever since their rediscovery, design, construction, analysis and ap-plications of these codes have become focal points of research. This dissertation presentseveral algebraic, combinatorial and graphical methods for constructing structured regularand irregular LDPC codes systematically. Construction methods presented include: (1)construction of LDPC codes based on finite fields and construction of LDPC codes com-bined with masking technique;,..tested for theQ1 PC1 bus cardBoth these projects mere sofixare des elopment efforts tonards contributing to dlfferentaspects of Roboucs and lZ1echatronics projects m the Controls and Roboucs Group..
Subject : Electericl tess
: برق
electronic file name : TL45102.pdf
Title and statement of responsibility and : ALGEBRAIC AND COMBINATORIAL CONSTRUCTIONS OF EFFICIENTLY ENCODABLE QUASI-CYCLIC LDPC CODES [Thesis]
آدرس ثابت

پیوستها
عنوان :
نام فایل :
نوع عام محتوا :
نوع ماده :
فرمت :
سایز :
عرض :
طول :
TL45102.pdf
TL45102.pdf
پایان نامه لاتین
متن
application/octet-stream
7.07 MB
85
85
نظرسنجی