Minimax nonredundant channel coding

The distortion of a message due to channel noise can be alleviated significantly without redundant error control bits by judicious assignment of binary indices to message symbols. The nonredundant coding gain relies only on a notion of distance between symbols. In this paper, we consider the index assignment problem and adopt a minimax design criterion instead of the usual mean squared error (MSE) measure. The problem is found to be NP-hard, and an effective, heuristic, polynomial-time algorithm is presented for computing approximate solutions. The minimax criterion yields greatly improved worst case performance while maintaining good average performance. In addition, the familiar MSE criterion is shown likewise to yield an NP-hard index assignment task. The MSE problem is a special case of the classical quadratic assignment problem, for which computationally and theoretically useful results are available from the discrete mathematics literature. >

[1]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[2]  Stanley C. Ahalt,et al.  Competitive learning algorithms for vector quantization , 1990, Neural Networks.

[3]  R. Burkard,et al.  Numerical investigations on quadratic assignment problems , 1978 .

[4]  David H. West,et al.  Algorithm 608: Approximate Solution of the Quadratic Assignment Problem , 1983, TOMS.

[5]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[6]  Kabekode V. S. Bhat.  On the Complexity of Testing a Graph for N-Cube , 1980, Inf. Process. Lett..

[7]  T. Murakami,et al.  Vector quantiser of video signals , 1982 .

[8]  N.-J. Cheng,et al.  Robust zero-redundancy vector quantization for noisy channels , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[9]  Steven B. Bibyk,et al.  Video data compression using artificial neural network differential vector quantization , 1991 .

[10]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[11]  A. Constantinides,et al.  Variation of vector quantisation and speech waveform coding , 1991 .

[12]  Masao Kasahara,et al.  Fundamental studies on combined coding for information source and channel , 1990 .

[13]  James E. Fowler,et al.  Image coding using differential vector quantization image coding using differential vector quantization , 1993, IEEE Trans. Circuits Syst. Video Technol..

[14]  Nariman Farvardin,et al.  A study of vector quantization for noisy channels , 1990, IEEE Trans. Inf. Theory.

[15]  Allen Gersho,et al.  Pseudo-Gray coding , 1990, IEEE Trans. Commun..

[16]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[17]  C. S. Parker,et al.  An Experimental Investigation of Some Heuristic Strategies for Component Placement , 1976 .

[18]  David W. Krumme,et al.  Fixed Hypercube Embedding , 1987, Inf. Process. Lett..

[19]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[20]  Steven B. Bibyk,et al.  Associative computation circuits for real-time processing of satellite communications and image pattern classification , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  John O. Limb,et al.  Distortion Criteria of the Human Viewer , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .