• DocumentCode
    825066
  • Title

    Index assignment for multichannel communication under failure

  • Author

    Berger-Wolf, Tanya Y. ; Reingold, Edward M.

  • Author_Institution
    Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
  • Volume
    48
  • Issue
    10
  • fYear
    2002
  • fDate
    10/1/2002 12:00:00 AM
  • Firstpage
    2656
  • Lastpage
    2668
  • Abstract
    We consider the problem of constructing multiple description scalar quantizers and describing the achievable rate-distortion tuples in that setting. We model this as a combinatorial optimization problem of number arrangements in a matrix. This approach gives a general technique for deriving lower bounds on the distortion at given channel rates. This technique is constructive, thus allowing an algorithm that gives an upper bound. For the case of two communication channels with equal rates, the bounds coincide, thus giving the precise lowest achievable distortion at fixed rates. The bounds are within a small constant for a higher number of channels. To the best of our knowledge, this is the first result involving systems with more than two communication channels.
  • Keywords
    combinatorial mathematics; matrix algebra; optimisation; quantisation (signal); rate distortion theory; telecommunication channels; channel rates; combinatorial optimization problem; failure; index assignment; lower bounds; matrix; multichannel communication; rate-distortion tuples; scalar quantizers; upper bound; Bandwidth; Communication channels; Communication systems; Computer science; Conferences; Information theory; Rate-distortion; Robustness; Source coding; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2002.802643
  • Filename
    1035118