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

Decoding algorithms with input quantization and maximum error correction capability

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

2 Author(s)
Hassan, A. ; Ericsson Mobile Commun. Inc., Triangle Park, NC, USA ; Stark, W.

Decoding that uses soft-decision information but with multiple low-complexity decoders are investigated. These decoders correct only errors and erasures. The structure of the receiver consists of a bank of z demodulators followed by errors- and erasures-correcting decoders operating in parallel. Each demodulator has a threshold for determining when to erase a given symbol. We assign a cost f(θ) to the noise for causing an erasure when the receiver uses a particular threshold θ and a (larger) cost f(θ¯) for causing an error. The goal in designing the receiver is to choose the thresholds to maximize the noise cost which is necessary to cause a decoding error. We demonstrate that the above formulation is solvable for many channels including the M-ary input-output channel, the additive channel with coherent demodulation, and an additive channel with orthogonal modulation and noncoherent demodulation. Then we show that the maximum worst case error-correcting capability of the parallel decoding algorithms is the same as the maximum worst case error-correcting capability of a correlation decoder with the same number of quantization regions

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 4 )

Date of Publication:

Jul 1995

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.