Single parity check product codes

نویسندگان

  • David M. Rankin
  • T. Aaron Gulliver
چکیده

This paper considers the performance of single parity check (SPC) multidimensional product codes in an Additive White Gaussian Noise channel. Asymptotic performance bounds are derived and compared to simulation results. A new code structure based on SPC product codes is introduced. This structure involves interleaving between the encoding of each dimension. Weight distribution analysis is used to explain the extremely good performance results for this class of codes. 1 Background Product codes, or iterated codes, were introduced by Elias 1] in 1954 and represent the rst method capable of achieving error free coding with a non-zero code rate (as the number of dimensions increases to innnity). A product code can be constructed in the following way 6]. The data to be transmitted is arranged in a hypercube of dimension d with the length in each dimension deened by

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

ثبت نام

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

منابع مشابه

An Improved New Structure of Single Parity Check Product Codes

This paper proposes an improved new structure of Single Parity Check (SPC) product codes with an embedded interleaver. The complexity of decoding the new SPC product codes is the same as the one of the existing single parity check product codes by use of the message passing algorithm. Simulation results and bound analysis demonstrate a significant bite error rate (BER) performance improvement c...

متن کامل

Trellis-constrained Codes

We introduce a class of iteratively decodable trellis-constrained codes as a generalization of turbocodes, low-density parity-check codes, serially-concatenated con-volutional codes, and product codes. In a trellis-constrained code, multiple trellises interact to deene the allowed set of codewords. As a result of these interactions, the minimum-complexity single trellis for the code can have a ...

متن کامل

Parallel and Serial Concatenated Single Parity Check Product Codes

The parallel and serial concatenation of codes is well established as a practical means of achieving excellent performance. In this paper, we introduce the parallel and serial concatenation of single parity check (SPC) product codes. The weight distribution of these codes is analyzed and the performance is bounded. Simulation results confirm these bounds at high signal-to-noise ratios. The perf...

متن کامل

Good LDPC Codes based on Very Simple Component Codes

We describe a novel approach for designing lowdensity parity-check (LDPC) codes based on a particular class of very simple component codes, that are a generalization of single parity-check (SPC) codes. The proposed method allows the design of LDPC codes with good performance while requiring encoder circuits with easy implementation. In addition, the proposed technique permits us to obtain rate-...

متن کامل

Multidimensional Codes

In this chapter we provide a brief introduction to multidimensional codes. In particular, we focus on product codes and other similar codes that use parity checks over multidimensional arrays. We present a brief introduction to product codes and their properties. We then focus on multidimensional codes based on single parity-check constituent codes. We provide two applications that illustrate t...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2001