• DocumentCode
    2023568
  • Title

    The Best Binary Linear Block Codes for Scalar Source-Channel Coding

  • Author

    Ilju Na ; Neuhoff, D.L.

  • Author_Institution
    Univ. of Michigan, Ann Arbor
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    741
  • Lastpage
    745
  • Abstract
    This paper finds the best binary linear block codes to use when an IID uniform source is uniform scalar quantized for transmission over a binary symmetric channel, with performance measured by mean squared error (MSE). The best code is found by optimizing the source-channel rate allocation, the linear code, and the assignment of its codewords to quantization indices. A table shows the maximum attained SNR, together with a code that achieves it, for a range of channel transition probabilities and transmission rates. When optimized, the performance of such systems comes within 1 ~ 2 dB of that of the best nonlinear codes found by an iterative algorithm.
  • Keywords
    binary codes; block codes; combined source-channel coding; linear codes; mean square error methods; probability; quantisation (signal); binary linear block codes; channel transition probability; iterative algorithm; mean squared error; scalar source-channel coding; uniform scalar quantization; Block codes; Decoding; Distortion measurement; Iterative methods; Linear code; Optimization methods; Quantization; Signal design; Signal mapping; Signal to noise ratio;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2007.4557313
  • Filename
    4557313