Optimization Online


On Computation of Performance Bounds of Optimal Index Assignment

X. Wu (xwu***at***ece.mcmaster.ca)
H. D. Mittelmann (mittelmann***at***asu.edu)
X. Wang (wangxiaohan***at***gmail.com)
J. Wang (jiawang***at***sjtu.edu.cn)

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 in- stance of quadratic assignment problem (QAP), one of the hardest optimization problems in the NP-complete class. In this paper 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 distor- tion 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. This is an extended version of an earlier paper.

Keywords: Index assignment, quantization, error resilience, quadratic assign- ment, semide´┐Żnite programming, relaxation.

Category 1: Applications -- Science and Engineering

Category 2: Combinatorial Optimization

Category 3: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation: IEEE Trans Comm 59(12), 3229-3233 (2011) DOI: 10.1109/TCOMM.2011.081111.100300

Download: [PDF]

Entry Submitted: 12/03/2010
Entry Accepted: 12/07/2010
Entry Last Modified: 08/30/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society