Performance and analysis of Quadratic Residue Codes of lengths less than 100

نویسندگان

  • Yong Li
  • Qianbin Chen
  • Hongqing Liu
  • Trieu-Kien Truong
چکیده

In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a simulation-based algorithm is proposed to obtain the maximum likelihood decoding performance of QR codes of lengths within 100. Moreover, four important theorems are proposed to predict the performance of the hard decoding and the maximum-likelihood decoding in which they can explore some internal properties of QR codes. It is shown that such four theorems can be applied to the QR codes with lengths less than 100 for predicting the decoding performance. In contrast, they can be straightforwardly generalized to longer QR codes. The result is never seen in the literature, to our knowledge. Simulation results show that the estimated hard decoding performance is very accurate in the whole signal-to-noise ratio (SNR) regimes, whereas the derived upper bounds of the maximum likelihood decoding are only tight for moderate to high SNR regions. For each of the considered QR codes, the soft decoding is approximately 1.5 dB better than the hard decoding. By using powerful redundant paritycheck cuts, the linear programming-based decoding algorithm, i.e., the ACG-ALP decoding algorithm performs very well for any QR code. Sometimes, it is even superior to the Chase-based soft decoding algorithm significantly, and hence is only a few tenths of dB away from the maximum likelihood decoding. Yong Li, Qianbin Chen and Hongqin Liu are with the Key Lab of Mobile Communication, Chongqing university of Posts and Telecommunications, Chongqing, 400065 China (e-mail: {yongli, hongqingliu, chenqb}@cqupt.edu.cn). Trieu-Kien Truong is with the Department of Information Engineering, I-Shou University, Kaohsiung Country 84001, Taiwan (e-mail: [email protected]), and is also with the Department of Computer Science and Engineering, National Sun Yat-sen University, Taiwan. August 26, 2014 DRAFT

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal self-dual codes

In the present thesis we consider extremal self-dual codes. We mainly concentrate on Type II codes (binary doubly-even codes), which may theoretically exist for lengths n = 8k ≤ 3928. It is noteworthy that extremal Type II codes have been actually constructed only for 13 lengths, 136 being the largest. Over the last decades the study of extremal codes became inseparable from the study of their ...

متن کامل

Cyclotomy and Duadic Codes of Prime Lengths

In this paper we present a cyclotomic approach to the construction of all binary duadic codes of prime lengths. We calculate the number of all binary duadic codes for a given prime length and that of all duadic codes that are not quadratic residue codes. We give necessary and sufficient conditions for p such that all binary duadic codes of length p are quadratic residue (Q.R.) codes. We also sh...

متن کامل

Decoding Linear Block Codes Using a Priority-First Search : Performance Analysis and Suboptimal Version

An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra’s algorithm was proposed by Han, Hartmann, and Chen. In this correspondence we prove that this algorithm is efficient for most practical communication systems where the probability of error is less than 10 3 by finding an upper bound of the computational effort of the algorithm. ...

متن کامل

On extremal codes with automorphisms

Let C be a binary extremal self-dual doubly-even code of length n ≥ 48. If such a code has an automorphism σ of prime order p ≥ 5 then the number of fixed points in the permutation action on the coordinates is bounded by the number of p-cycles. It turns out that large primes p, i.e. n − p small, occur extremely rarely in Aut(C). Examples are the extended quadratic residue codes. We prove that d...

متن کامل

Binary extremal self-dual codes of type II and their automorphisms

Binary extremal self-dual codes of type II and their automorphisms Wolfgang Willems Otto-von-Guericke-Universität Magdeburg Extremal type II codes are for several reasons of particular interest. However only for small lengths such codes have been contructed. In order to find larger examples ’symmetries’ or in other words ’non-trivial automorphisms’ may be helpful. In this spirit the talk deals ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1408.5674  شماره 

صفحات  -

تاریخ انتشار 2014