Iterative decoding with a hamming thresholdfor block turbo-codes

Ashraf Mahran

doi:10.1109/LCOMM.2004.835331

Return

Iterative decoding with a hamming thresholdfor block turbo-codes

2004-09-01

PRE

Ashraf Mahran *

Mohammed Benaissa

DOI：10.1109/LCOMM.2004.835331

Original

Original request for help

Save

Abstract

En 中文

This work introduces a novel approach to increase the performance of block turbo codes (BTCs). The idea is based on using a Hamming threshold to limit the search for the maximum-likelihood (ML) codeword within only those codewords that lie within this threshold. The proposed iterative decoding approach is shown to offer both significant coding gain and complexity reduction over the standard iterative decoding methods.

Keywords:

block turbo codes (BTCs)

channel coding

decoding complexity

Hamming threshold

soft-decision decoding