Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Optimal Linear Joint Source-Channel Coding with Delay Constraint

Författare:
Publiceringsår: 2012
Språk: Engelska
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Dokumenttyp: Artikel i tidskrift
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.

Sammanfattning

The problem of joint source-channel coding is considered for a stationary remote (noisy) Gaussian source and a Gaussian channel. The encoder and decoder are assumed to be causal and their combined operations are subject to a delay constraint. It is shown that, under the mean-square error distortion metric, an optimal encoder-decoder pair from the linear and time-invariant (LTI) class can be found by minimization of a convex functional and a spectral factorization. The functional to be minimized is the sum of the well-known cost in a corresponding Wiener filter problem and a new term, which is induced by the channel noise and whose coefficient is the inverse of the channel's signal-to-noise ratio. This result is shown to also hold in the case of vector-valued signals, assuming parallel additive white Gaussian noise channels. It is also shown that optimal LTI encoders and decoders generally require infinite memory, which implies that approximations are necessary.

A numerical example is provided, which compares the performance to the lower bound provided by rate-distortion theory.

Nyckelord

  • Mathematics
  • Computer Vision and Robotics (Autonomous Systems)
  • Control Engineering
  • Analog transmission
  • causal coding
  • delay constraint
  • joint source-channel coding
  • MSE distortion
  • remote source
  • signal-to-noise ratio (SNR).

Övriga

Submitted
  • LCCC
  • LCCC-lup-obsolete
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu.se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen