Ordered subsets message-passing

Joseph A. O'Sullivan; Naveen Singla

doi:10.1109/isit.2003.1228364

Ordered subsets message-passing

Joseph A. O'Sullivan
, Naveen Singla

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

A message-passing algorithm is proposed for decoding on graphs having short cycles. The algorithm, termed the "ordered subsets message-passing" (OSMP) algorithm, performs message-passing on a graph in which the measured data is partitioned into subsets. The OSMP algorithm is applied for joint equalization and decoding for two-dimensional (2D) intersymbol interference (ISI) channels. Simulation results show that the OSMP algorithm outperforms its unordered counterpart i.e. when the measured data are not partitioned into subsets. Concentration results proved by Kavčić et. al. in [2] for a one-dimensional ISI channel also hold for the OSMP algorithm for a 2D ISI channel.

Original language	English
Pages (from-to)	349
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228364
State	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

Access to Document

10.1109/isit.2003.1228364

Cite this

@article{475dd367819d4dc2b2144e05cee24428,

title = "Ordered subsets message-passing",

abstract = "A message-passing algorithm is proposed for decoding on graphs having short cycles. The algorithm, termed the {"}ordered subsets message-passing{"} (OSMP) algorithm, performs message-passing on a graph in which the measured data is partitioned into subsets. The OSMP algorithm is applied for joint equalization and decoding for two-dimensional (2D) intersymbol interference (ISI) channels. Simulation results show that the OSMP algorithm outperforms its unordered counterpart i.e. when the measured data are not partitioned into subsets. Concentration results proved by Kav{\v c}i{\'c} et. al. in [2] for a one-dimensional ISI channel also hold for the OSMP algorithm for a 2D ISI channel.",

author = "O'Sullivan, \{Joseph A.\} and Naveen Singla",

year = "2003",

doi = "10.1109/isit.2003.1228364",

language = "English",

pages = "349",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8096",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Ordered subsets message-passing

AU - O'Sullivan, Joseph A.

AU - Singla, Naveen

PY - 2003

Y1 - 2003

N2 - A message-passing algorithm is proposed for decoding on graphs having short cycles. The algorithm, termed the "ordered subsets message-passing" (OSMP) algorithm, performs message-passing on a graph in which the measured data is partitioned into subsets. The OSMP algorithm is applied for joint equalization and decoding for two-dimensional (2D) intersymbol interference (ISI) channels. Simulation results show that the OSMP algorithm outperforms its unordered counterpart i.e. when the measured data are not partitioned into subsets. Concentration results proved by Kavčić et. al. in [2] for a one-dimensional ISI channel also hold for the OSMP algorithm for a 2D ISI channel.

AB - A message-passing algorithm is proposed for decoding on graphs having short cycles. The algorithm, termed the "ordered subsets message-passing" (OSMP) algorithm, performs message-passing on a graph in which the measured data is partitioned into subsets. The OSMP algorithm is applied for joint equalization and decoding for two-dimensional (2D) intersymbol interference (ISI) channels. Simulation results show that the OSMP algorithm outperforms its unordered counterpart i.e. when the measured data are not partitioned into subsets. Concentration results proved by Kavčić et. al. in [2] for a one-dimensional ISI channel also hold for the OSMP algorithm for a 2D ISI channel.

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

U2 - 10.1109/isit.2003.1228364

DO - 10.1109/isit.2003.1228364

M3 - Conference article

AN - SCOPUS:0142008239

SN - 2157-8096

SP - 349

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

Ordered subsets message-passing

Abstract

Access to Document

Other files and links

Fingerprint

Cite this