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...

Full description

Saved in:
Bibliographic Details
Main Authors: Kokkonen, M., Kalliojarvi, K.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
AWGN
Bit error rate
Block codes
Decoding
Demodulation
Error analysis
Fading
Performance analysis
Probability density function
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1090-3038
2577-2465
DOI:10.1109/VETEC.1998.686191