Minimum Distances of the QC-LDPC Codes in IEEE 802 Communication Standards
نویسنده
چکیده
This work applies earlier results on Quasi-Cyclic (QC) LDPC codes to the codes specified in six separate IEEE 802 standards, specifying wireless communications from 54 MHz to 60 GHz. First, we examine the weight matrices specified to upper bound the codes’ minimum distance independent of block length. Next, we search for the minimum distance achieved for the parity check matrices selected at each block length. Finally, solutions to the computational challenges encountered are addressed.
منابع مشابه
On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families
A simple and general definition of quasi cyclic low-density parity-check (QC-LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of so called combinatorially designed multiple-edge protograph codes. The code construction is mainly based on perfect difference families (PDF’s) and is called...
متن کاملQC-LDPC Encoder Structure for IEEE 802.16e/802.11n Standard
Due to the popularity of LDPC (Low Density Parity Codes) in modern communication systems, there is a growing need of LDPC encoder with a faster encoding speed and more application compatibility. In this paper, an efficient QC-LDPC encoder architecture is proposed, which is suitable for both IEEE 802.16e standard and IEEE 802.11n standard. Owing to the special structure of multi-diagonal parity ...
متن کاملResearch on LDPC Decoder Design Methodology for Error-Correcting Performance and Energy-Efficiency
I-Abstract Low-Density Parity-Check (LDPC) codes, as linear block error-correcting codes (ECC), which were invented by Gallager in 1963 and rediscovered by MacKay in 1999, nowadays become a hot topic in a variety of application fields. Due to inherently paralleled decoding algorithm and near Shannon limit error-correcting performance, LDPC codes have been widely adopted in modern communication ...
متن کاملUpper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
In this paper we investigate the minimum code distance of QC LDPC codes [1], [2], [3]. These codes form an important subclass of LDPC codes [4], [5]. These codes also are a subclass of protograph-based LDPC codes [6]. QC LDPC codes can be easily stored as their parity-check matrices can be easily described. Besides such codes have efficient encoding [7] and decoding [8] algorithms. All of these...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1602.02831 شماره
صفحات -
تاریخ انتشار 2016