On Computation of Performance Bounds of Optimal Index Assignment
X. Wu (xwuece.mcmaster.ca)
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.
Keywords: Index assignment, quantization, error resilience, quadratic assign- ment, semide�nite programming, relaxation.
Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )
Category 2: Applications -- Science and Engineering (Other )
Citation: Data Compression Conference (DCC) 2010, IEEE, DOI 10.1109/DCC.2010.24, 189-198
Entry Submitted: 02/18/2010
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|