• DocumentCode
    2517661
  • Title

    A novel coding scheme for symmetric multiple description coding

  • Author

    Tian, Chao ; Chen, Jun

  • Author_Institution
    AT&T Labs.-Res., Florham Park, NJ
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    1418
  • Lastpage
    1422
  • Abstract
    We propose a novel coding scheme for multiple description coding with K descriptions, with symmetric rate and symmetric distortion constraints. In this new coding scheme, channel codes are introduced on top of some carefully chosen source coding component. The channel coding component for k = 3 is akin to the network coding idea. We first show that for the quadratic Gaussian source, adding a simple channel coding component is able to achieve rate- distortion point outside the achievable region based on (n, k) source-channel erasure codes (SCEC), previously proposed by Puri et al, when Gaussian codebook is assumed to be optimal for that scheme. The channel coding component and (n, k) SCEC can be strategically combined, and for the special case of quadratic Gaussian three description case where any two of them are rate-distortion optimal jointly, the resulting scheme can achieve performance better than a direct time sharing between the new operating point and the (n, k) SCEC-based scheme. Moreover, this combination can be generalized naturally, which leads to a new coding scheme for the general if-description problem.
  • Keywords
    Gaussian channels; channel coding; source coding; SCEC; channel codes; channel coding component; quadratic Gaussian three description; source-channel erasure codes; symmetric distortion constraints; symmetric multiple description coding; Channel coding; Chaos; Distortion measurement; Information theory; Network coding; Rate distortion theory; Rate-distortion; Source coding; Time sharing computer systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595221
  • Filename
    4595221