On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel

Details On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel

2009-03-18

arxiv.org/abs/0903.3204v3

Computer Science

Information Theory

Accepted for the XII International Symposium on Problems of Redundancy in Information and Control Systems, St. Petersburg, Rus

Scientific paper

We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained from the demodulator. This idea goes back to Forney and is based on treating received symbols with low reliability as erasures. This erasing at the decoder is done using a threshold, each received symbol with reliability falling below the threshold is erased. Depending on the target overall complexity of the decoder this pseudo-soft decision decoding can be extended from one threshold T to z>1 thresholds T_1<...1 thresholds case, starting with a geometric interpretation of the optimal threshold location problem and using an approach from Zyablov.

Affiliated with

Also associated with

No associations

Rating

On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-401984