Sum-product algorithm utilizing soft distances on additive impulsive noise channels

M. Johnston; B. S. Sharif; C. C. Tsimenidis; L. Chen

doi:10.1109/TCOMM.2013.043013.110141

Sum-product algorithm utilizing soft distances on additive impulsive noise channels

M. Johnston
, B. S. Sharif
, C. C. Tsimenidis
, L. Chen

Electrical Engineering

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

In this letter, a Sum-Product algorithm (SPA) utilizing soft distances is shown to be more resilient to impulsive noise than conventional likelihood-based SPAs, when the noise distribution is unknown. An efficient version of the soft distance SPA is also developed but with half the storage requirements and running time.

Original language	British English
Article number	6514975
Pages (from-to)	2113-2116
Number of pages	4
Journal	IEEE Transactions on Communications
Volume	61
Issue number	6
DOIs	https://doi.org/10.1109/TCOMM.2013.043013.110141
State	Published - Jun 2013

Keywords

Block codes
Decoding
Gaussian noise
Impulse noise
Iterative methods

Access to Document

10.1109/TCOMM.2013.043013.110141

OpenUrl availability

Full text

Cite this

@article{2b284ae777c54cd5855a021a97e4ad88,

title = "Sum-product algorithm utilizing soft distances on additive impulsive noise channels",

abstract = "In this letter, a Sum-Product algorithm (SPA) utilizing soft distances is shown to be more resilient to impulsive noise than conventional likelihood-based SPAs, when the noise distribution is unknown. An efficient version of the soft distance SPA is also developed but with half the storage requirements and running time.",

keywords = "Block codes, Decoding, Gaussian noise, Impulse noise, Iterative methods",

author = "M. Johnston and Sharif, \{B. S.\} and Tsimenidis, \{C. C.\} and L. Chen",

note = "Funding Information: This work is partly supported by the National Natural Science Foundation of China (NSFC) with project ID: 61001094. Publisher Copyright: {\textcopyright} 2013 IEEE.",

year = "2013",

month = jun,

doi = "10.1109/TCOMM.2013.043013.110141",

language = "British English",

volume = "61",

pages = "2113--2116",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Sum-product algorithm utilizing soft distances on additive impulsive noise channels

AU - Johnston, M.

AU - Sharif, B. S.

AU - Tsimenidis, C. C.

AU - Chen, L.

PY - 2013/6

Y1 - 2013/6

N2 - In this letter, a Sum-Product algorithm (SPA) utilizing soft distances is shown to be more resilient to impulsive noise than conventional likelihood-based SPAs, when the noise distribution is unknown. An efficient version of the soft distance SPA is also developed but with half the storage requirements and running time.

AB - In this letter, a Sum-Product algorithm (SPA) utilizing soft distances is shown to be more resilient to impulsive noise than conventional likelihood-based SPAs, when the noise distribution is unknown. An efficient version of the soft distance SPA is also developed but with half the storage requirements and running time.

KW - Block codes

KW - Decoding

KW - Gaussian noise

KW - Impulse noise

KW - Iterative methods

UR - https://www.scopus.com/pages/publications/84959452138

U2 - 10.1109/TCOMM.2013.043013.110141

DO - 10.1109/TCOMM.2013.043013.110141

M3 - Article

AN - SCOPUS:84959452138

SN - 0090-6778

VL - 61

SP - 2113

EP - 2116

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 6

M1 - 6514975

ER -

Sum-product algorithm utilizing soft distances on additive impulsive noise channels

Abstract

Keywords

Access to Document

OpenUrl availability

Other files and links

Fingerprint

Cite this