By Topic

Limited complexity soft-decision decoding of binary linear block codes using modified t-algorithm

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
$33 $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)
M. Kokkonen ; Res. Center, Nokia Group, Finland ; K. Kalliojarvi

We have recently proposed a new soft-decision decoding algorithm for binary linear block codes based on a partial breadth-first search of the tree representation of the code. In this paper we analyze the bit error rate performance and the computational complexity of this algorithm when it is used to decode data that has been transmitted through an uncorrelated Rayleigh fading channel. We also study those aspects of the algorithm that are related to the variable decoding complexity. These aspects include variations in the required amount of memory and in the required number of arithmetic operations

Published in:

Vehicular Technology Conference, 1998. VTC 98. 48th IEEE  (Volume:3 )

Date of Conference:

18-21 May 1998