• DocumentCode
    3059755
  • Title

    A tight bound on the performance of a minimal-delay joint source-channel coding scheme

  • Author

    Kleiner, Marius ; Rimoldi, Bixio

  • Author_Institution
    Sch. of Comput. & Commun. Sci., Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
  • fYear
    2010
  • fDate
    13-18 June 2010
  • Firstpage
    136
  • Lastpage
    140
  • Abstract
    An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmitting the quantizer outputs in the first channel uses, and sending the remaining quantization error uncoded in the last channel use. The bound coincides with the performance achieved by a suboptimal decoder studied by the authors in a previous paper, thereby establishing that the bound is tight.
  • Keywords
    Gaussian channels; combined source-channel coding; delays; mean square error methods; quantisation (signal); Gaussian channel; asymptotic mean squared error; joint source-channel coding scheme; minimal delay; quantization error; Analog computers; Block codes; Computer errors; Decoding; Delay; Error correction; Gaussian channels; Jacobian matrices; Quantization; Transmitters;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-7890-3
  • Electronic_ISBN
    978-1-4244-7891-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2010.5513264
  • Filename
    5513264