On computation of performance bounds of optimal index assignment

Xiaolin Wu; Hans Mittelmann; Xiaohan Wang; Jia Wang

doi:10.1109/TCOMM.2011.081111.100300

On computation of performance bounds of optimal index assignment

Xiaolin Wu, Hans Mittelmann, Xiaohan Wang, Jia Wang

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

6 Scopus citations

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 language	English (US)
Article number	5997286
Pages (from-to)	3229-3233
Number of pages	5
Journal	IEEE Transactions on Communications
Volume	59
Issue number	12
DOIs	https://doi.org/10.1109/TCOMM.2011.081111.100300
State	Published - Dec 2011

Keywords

Index assignment
error resilience
quadratic assignment
quantization
relaxation
semidefinite programming

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCOMM.2011.081111.100300

Cite this

@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 = "Index assignment, error resilience, quadratic assignment, quantization, relaxation, semidefinite programming",

author = "Xiaolin Wu and Hans Mittelmann and Xiaohan Wang and Jia Wang",

note = "Funding Information: X. Wu{\textquoteright}s work was supported partly by NSERC and partly by NSFC grant 60932006. H. D. Mittelmann{\textquoteright}s work was supported partly by AFOSR grant FA9550-09-1-0098. J. Wang{\textquoteright}s work was supported partly by NSFC grant 60802020, 973 Program (2010CB731401, 2010CB731406) and 863 Program 2009AA01A336. This work was presented in part at the 2010 Data Compression Conference.",

year = "2011",

month = dec,

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

N1 - Funding Information: X. Wu’s work was supported partly by NSERC and partly by NSFC grant 60932006. H. D. Mittelmann’s work was supported partly by AFOSR grant FA9550-09-1-0098. J. Wang’s work was supported partly by NSFC grant 60802020, 973 Program (2010CB731401, 2010CB731406) and 863 Program 2009AA01A336. This work was presented in part at the 2010 Data Compression Conference.

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 - Index assignment

KW - error resilience

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

SN - 0090-6778

VL - 59

SP - 3229

EP - 3233

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 12

M1 - 5997286

ER -

On computation of performance bounds of optimal index assignment

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this