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

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.