Cart (Loading....) | Create Account
Close category search window

Low-Complexity Z_4 LDPC Code Design under a Gaussian Approximation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ferrari, M. ; IEIIT Inst., Milan, Italy ; Bellini, S. ; Tomasoni, A.

In this paper we propose low complexity LDPC code design and decoding in Z4 which may be useful to combat phase ambiguities in wireless links affected by strong phase noise. We approximate messages exchanged on the Tanner graph using separable probability density functions. This allows a substantial reduction of decoder memory and complexity, with a negligible performance penalty, compared to ideal Z4 decoding. Furthermore, we show that the Density Evolution analysis of this suboptimal decoder leads to irregular LDPC designs matching the criteria of binary LDPC codes.

Published in:

Wireless Communications Letters, IEEE  (Volume:1 ,  Issue: 6 )

Date of Publication:

December 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.