• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • SINTEF
  • Publikasjoner fra CRIStin
  • Publikasjoner fra CRIStin - SINTEF AS
  • View Item
  •   Home
  • SINTEF
  • Publikasjoner fra CRIStin
  • Publikasjoner fra CRIStin - SINTEF AS
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Zero Delay Joint Source Channel Coding for Multivariate Gaussian Sources over Orthogonal Gaussian Channels

Floor, Pål Anders; Kim, Anna N.; Ramstad, Tor Audun; Balasingham, Ilangko
Journal article
Thumbnail
View/Open
entropy-15-02129.pdf (1.577Mb)
URI
http://hdl.handle.net/11250/2375210
Date
2013
Metadata
Show full item record
Collections
  • Publikasjoner fra CRIStin - SINTEF AS [4239]
  • SINTEF Digital [1648]
Original version
Entropy 2013, 15(6):2129-2161   10.3390/e15062129
Abstract
Communication of a multivariate Gaussian source transmitted over orthogonal additive white Gaussian noise channels using delay-free joint source channel codes (JSCC) is studied in this paper. Two scenarios are considered: (1) all components of the multivariate Gaussian are transmitted by one encoder as a vector or several ideally collaborating nodes in a network; (2) the multivariate Gaussian is transmitted through distributed nodes in a sensor network. In both scenarios, the goal is to recover all components of the multivariate Gaussian at the receiver. The paper investigates a subset of JSCC consisting of direct source-to-channel mappings that operate on a symbol-by-symbol basis to ensure zero coding delay. A theoretical analysis that helps explain and quantify distortion behavior for such JSCC is given. Relevant performance bounds for the network are also derived with no constraints on complexity and delay. Optimal linear schemes for both scenarios are presented. Results for Scenario 1 show that linear mappings perform well, except when correlation is high. In Scenario 2, linear mappings provide no gain from correlation when the channel signal-to-noise ratio (SNR) gets large. The gap to the performance upper bound is large for both scenarios, regardless of SNR, when the correlation is high. The main contribution of this paper is the investigation of nonlinear mappings for both scenarios. It is shown that nonlinear mappings can provide substantial gain compared to optimal linear schemes when correlation is high. Contrary to linear mappings for Scenario 2, carefully chosen nonlinear mappings provide a gain for all SNR, as long as the correlation is close to one. Both linear and nonlinear mappings are robust against variations in SNR.
Description
-

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit