EXIT Chart-based Design of LDPC Codes for Inter-Symbol Interference Channels

نویسندگان

  • Michele Franceschini
  • Riccardo Raheli
چکیده

The subject of this paper is the design of lowdensity parity-check (LDPC) codes concatenated with a Gray mapped quaternary phase shift keying (QPSK) modulator for transmission over inter-symbol (ISI) channels. In particular, we will present several results considering important partial response channels (PRCs). Using an extrinsic information transfer (EXIT) chart-based analysis, we give insights into the behavior of an iterative detector/decoder for LDPC codes transmitted over ISI channels. In particular, we will discuss if there is a real need for LDPC codes specifically optimized for ISI channels. Using the proposed analysis method, we design LDPC codes tailored for ISI channels. We show that, if the channel impulse response is short, an ad hoc optimized LDPC code is very similar to that optimized for an additive white Gaussian noise (AWGN) channel, reducing significantly the need for code optimization. On the other hand, if the impulse response of the ISI channel is long, ad hoc optimized LDPC codes achieve sensible gain with respect to LDPC codes optimized for AWGN channel.

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

ثبت نام

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

منابع مشابه

Design of LDPC Codes: A Survey and New Results

This survey paper provides fundamentals in the design of LDPC codes. To provide a target for the code designer, we first summarize the EXIT chart technique for determining (near-)optimal degree distributions for LDPC code ensembles. We also demonstrate the simplicity of representing codes by protographs and how this naturally leads to quasi-cyclic LDPC codes. The EXIT chart technique is then ex...

متن کامل

Turbo Equalization With Optimized Linearly Encodable LDPC Codes

Turbo equalization is a joint iterative equalization and decoding technique known to produce superior performance for Inter-Symbol Interference (ISI) channel, comparing to noniterative methods. We analyze turbo equalization that employs linearly encodable LDPC codes. The codes are irregular and their degree profiles are optimized in order to achieve capacityapproaching performance. To optimize ...

متن کامل

A Class of High-rate, Low-complexity, Well- structured LDPC Codes from Combinatorial Designs and their Applications on ISI Channels

We present a systematic construction of a class of highrate, well-structured low density parity check (LDPC) codes based on combinatorial designs. We show that the proposed -design results in a class of -regular LDPC codes, which are systematic, quasicyclic, free of length-4 and length-6 cycles, linear-time encodable and decodable, and which have high code rates of . Analysis from the maximum l...

متن کامل

M-ary Detection and q-ary Decoding in Large-Scale MIMO: A Non-Binary Belief Propagation Approach

In this paper, we propose a non-binary belief propagation approach (NB-BP) for detection of M -ary modulation symbols and decoding of q-ary LDPC codes in large-scale multiuser MIMO systems. We first propose a message passing based symbol detection algorithm which computes vector messages using a scalar Gaussian approximation of interference, which results in a total complexity of just O(KN √ M)...

متن کامل

Differentially Encoded LDPC Codes - Part I: Special Case of Product Accumulate Codes

Part I of a two-part series investigates product accumulate codes, a special class of differentially-encoded low density parity check (DE-LDPC) codes with high performance and low complexity, on flat Rayleigh fading channels. In the coherent detection case, Divsalar’s simple bounds and iterative thresholds using density evolution are computed to quantify the code performance at finite and infin...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2005