By Topic

Soft-decision decoding of linear block codes using efficient iterative G-space encodings

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)
Yingquan Wu ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Hadjicostis, C.

This paper proposes a sub-optimal maximum-likelihood decoding algorithm for linear block codes. Given reliability information about each bit in the received word, our approach initially finds the set of most reliable "basis" information bits; it then searches for the most likely codeword by iteratively flipping bits in this basis set, constructing the corresponding codeword and determining its likelihood. The search of "test error patterns" on the set of basis information bits is conducted so that at each iteration the new set of basis information bits differs from a previously studied (and stored) one in a single bit position. Thus, the new codeword can be obtained from a stored codeword by modifying only the redundant bits that depend on the modified bit. The space complexity of the proposed decoding scheme is polynomial in the code length. We also describe an heuristic criterion to approximate the optimal set of test error patterns subject to a limit on the maximum computational effort. Simulation results with codes of relatively large length show that the proposed approach is very efficient, especially under low SNR

Published in:

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:2 )

Date of Conference:

2001