On computation of performance bounds of optimal index assignment

Xiaolin Wu, Hans Mittelmann, Xiaohan Wang, Jia Wang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intact. But optimal design of index assignment is an instance of quadratic assignment problem (QAP), one of the hardest optimization problems in the NP-complete class. In this work we make a progress in the research of index assignment optimization. We apply some recent results of QAP research to compute the strongest lower bounds so far for channel distortion of BSC among all index assignments. The strength of the resulting lower bounds is validated by comparing them against the upper bounds produced by heuristic index assignment algorithms.

Original languageEnglish (US)
Article number5997286
Pages (from-to)3229-3233
Number of pages5
JournalIEEE Transactions on Communications
Volume59
Issue number12
DOIs
StatePublished - Dec 2011

Fingerprint

Optimal design

Keywords

  • error resilience
  • Index assignment
  • quadratic assignment
  • quantization
  • relaxation
  • semidefinite programming

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

On computation of performance bounds of optimal index assignment. / Wu, Xiaolin; Mittelmann, Hans; Wang, Xiaohan; Wang, Jia.

In: IEEE Transactions on Communications, Vol. 59, No. 12, 5997286, 12.2011, p. 3229-3233.

Research output: Contribution to journalArticle

Wu, Xiaolin ; Mittelmann, Hans ; Wang, Xiaohan ; Wang, Jia. / On computation of performance bounds of optimal index assignment. In: IEEE Transactions on Communications. 2011 ; Vol. 59, No. 12. pp. 3229-3233.
@article{30a312dd1d5441c6a2abbe8b090ed757,
title = "On computation of performance bounds of optimal index assignment",
abstract = "Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intact. But optimal design of index assignment is an instance of quadratic assignment problem (QAP), one of the hardest optimization problems in the NP-complete class. In this work we make a progress in the research of index assignment optimization. We apply some recent results of QAP research to compute the strongest lower bounds so far for channel distortion of BSC among all index assignments. The strength of the resulting lower bounds is validated by comparing them against the upper bounds produced by heuristic index assignment algorithms.",
keywords = "error resilience, Index assignment, quadratic assignment, quantization, relaxation, semidefinite programming",
author = "Xiaolin Wu and Hans Mittelmann and Xiaohan Wang and Jia Wang",
year = "2011",
month = "12",
doi = "10.1109/TCOMM.2011.081111.100300",
language = "English (US)",
volume = "59",
pages = "3229--3233",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - On computation of performance bounds of optimal index assignment

AU - Wu, Xiaolin

AU - Mittelmann, Hans

AU - Wang, Xiaohan

AU - Wang, Jia

PY - 2011/12

Y1 - 2011/12

N2 - Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intact. But optimal design of index assignment is an instance of quadratic assignment problem (QAP), one of the hardest optimization problems in the NP-complete class. In this work we make a progress in the research of index assignment optimization. We apply some recent results of QAP research to compute the strongest lower bounds so far for channel distortion of BSC among all index assignments. The strength of the resulting lower bounds is validated by comparing them against the upper bounds produced by heuristic index assignment algorithms.

AB - Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intact. But optimal design of index assignment is an instance of quadratic assignment problem (QAP), one of the hardest optimization problems in the NP-complete class. In this work we make a progress in the research of index assignment optimization. We apply some recent results of QAP research to compute the strongest lower bounds so far for channel distortion of BSC among all index assignments. The strength of the resulting lower bounds is validated by comparing them against the upper bounds produced by heuristic index assignment algorithms.

KW - error resilience

KW - Index assignment

KW - quadratic assignment

KW - quantization

KW - relaxation

KW - semidefinite programming

UR - http://www.scopus.com/inward/record.url?scp=84655169230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84655169230&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2011.081111.100300

DO - 10.1109/TCOMM.2011.081111.100300

M3 - Article

AN - SCOPUS:84655169230

VL - 59

SP - 3229

EP - 3233

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 12

M1 - 5997286

ER -