Robust Decoding for Convolutionally Coded Systems Impaired by Memoryless Impulsive Noise

It is well known that communication systems are susceptible to strong impulsive noises. To combat this, convolutional coding has long served as a cost-efficient tool against moderately frequent memoryless impulses with given statistics. Nevertheless, impulsive noise statistics are difficult to model...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2013-11, Vol.61 (11), p.4640-4652
Main Authors: Der-Feng Tseng, Han, Yunghsiang S., Wai Ho Mow, Po-Ning Chen, Jing Deng, Vinck, A. J. Han
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Bernoulli-Gaussian channel
Codes
Coding, codes
Convolutional codes
Equipments and installations
Exact sciences and technology
Impulsive noise
Information, signal and communications theory
Maximum likelihood decoding
Measurement
metric erasure Viterbi Algorithm (MEVA)
Middleton Class-A model
Miscellaneous
Noise
power line communications
Radiocommunications
Robustness
Signal and communications theory
Telecommunications
Telecommunications and information theory
Viterbi algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is well known that communication systems are susceptible to strong impulsive noises. To combat this, convolutional coding has long served as a cost-efficient tool against moderately frequent memoryless impulses with given statistics. Nevertheless, impulsive noise statistics are difficult to model accurately and are typically not time-invariant, making the system design challenging. In this paper, because of the lack of knowledge regarding the probability density function of impulsive noises, an efficient decoding scheme was devised for single-carrier narrowband communication systems; a design parameter was incorporated into recently introduced joint erasure marking and Viterbi decoding algorithm, dubbed the metric erasure Viterbi algorithm (MEVA). The proposed scheme involves incorporating a well-designed clipping operation into a Viterbi algorithm, in which the clipping threshold must be appropriately set. In contrast to previous publications that have resorted to extensive simulations, in the proposed scheme, the bit error probability performance associated with the clipping threshold was characterized by deriving its Chernoff bound. The results indicated that when the clipping threshold was judiciously selected, the MEVA can be on par with its optimal maximum-likelihood decoding counterpart under fairly general circumstances.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2013.101813.130122