Convergence properties of iterative decoders working at bit and symbol level

نویسندگان

  • Bartolo Scanavino
  • Guido Montorsi
  • Sergio Benedetto
چکیده

Abstract In this paper, we compare the convergence thresholds of parallel and serially concatenated codes with interleaver that employ iterative decoding algorithms working at bit or symbol level. The analysis technique is an extension to the symbollevel decoder of that presented in [1], and is valid for very large interleavers. The comparison shows that working at symbol level always yields a lower convergence threshold. In the serial concatenation, the advantage is quite significant.

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

ثبت نام

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

منابع مشابه

A Low-Complexity Iterative Receiver for Multiuser Space-Time Block Coding Systems

Iterative processing has been shown to be very effective in multiuser space-time block coding (STBC) systems. The complexity and efficiency of an iterative receiver depend heavily on how the log-likelihood ratios (LLRs) of the coded bits are computed and exchanged at the receiver among its three major components, namely the multiuser detector, the maximum a posterior probability (MAP) demodulat...

متن کامل

Designing Iterative Decoding Schemes with the Extrinsic Information Transfer Chart

Since the discovery of parallel concatenated (turbo) codes, iterative decoding has become a vital field of research in digital communications. Applications of the “turbo principle” to many detection and decoding problems have been found. While most studies have focused on designing code concatenations with respect to maximum likelihood decoding performance, the convergence properties of iterati...

متن کامل

Iterative Decoding Trajectories of Parallel Concatenated Codes

Mutual information transfer characteristics for soft in/soft out decoders are proposed as a tool to better understand the convergence behavior of iterative decoding schemes. The exchange of extrinsic information is visualized as a decoding trajectory in the Extrinsic Information Transfer Chart. This allows the prediction of turbo cliff position and bit error rate after an arbitrary number of it...

متن کامل

Bandwidth reduction of extrinsic information exchange in turbo decoding

Besides computations and decoding delay, iterations in turbo decoding imply intensive and random extrinsic information exchange between component decoders. This high data exchange rate needs huge communication and routing resources to support the required bandwidth. Proposed is a novel symbol-based criterion to reduce the extrinsic information bandwidth in turbo decoding. The proposed criterion...

متن کامل

Turbo detection for MIMO systems: bit labeling and pre-coding

Bit-interleaved coded modulation with iterative detection for MIMO systems demands an efficient APP detector that delivers soft information about the coded bits. The list-sequential detector is a reduced-complexity approximation to an exhaustive APP detector. It uses a tree search employing the stack algorithm to find dominant terms of the log-likelihood ratio. The commonly used symbol-by-symbo...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

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