SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Ramstad Tor A.) "

Sökning: WFRF:(Ramstad Tor A.)

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Floor, Pal Anders, et al. (författare)
  • Distributed zero-delay joint source-channel coding for a BI-variate Gaussian on a Gaussian MAC
  • 2011
  • Ingår i: 19TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO-2011). - : EURASIP. ; , s. 2084-2088
  • Konferensbidrag (refereegranskat)abstract
    • In this paper delay-free distributed joint source-channel coding for communication of two correlated Gaussian sources over a Gaussian Multiple Access Channel (GMAC) are considered. Both discrete and hybrid discrete analog schemes arc proposed and optimized. The proposed schemes are noise robust and show promising performance which improve with increasing correlation.
  •  
2.
  • Floor, Pal Anders, et al. (författare)
  • On Joint Source-Channel Coding for a Multivariate Gaussian on a Gaussian MAC
  • 2015
  • Ingår i: IEEE Transactions on Communications. - 0090-6778 .- 1558-0857. ; 63:5, s. 1824-1836
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, nonlinear distributed joint source-channel coding (JSCC) schemes for transmission of multivariate Gaussian sources over a Gaussian multiple access channel are proposed and analyzed. The main contribution is a zero-delay JSCC named Distributed Quantizer Linear Coder (DQLC), which performs relatively close the information theoretical bounds, improves when the correlation among the sources increases, and does not level off as the signal-to-noise ratio (SNR) becomes large. Therefore it outperforms any linear solution for sufficiently large SNR. Further an extension of DQLC to an arbitrary code length named Vector Quantizer Linear Coder (VQLC) is analyzed. The VQLC closes in on the performance upper bound as the code length increases and can potentially achieve the bound for any number of independent sources. The VQLC leaves a gap to the bound whenever the sources are correlated, however. JSCC achieving the bound for arbitrary correlation has been found for the bivariate case, but that solution is significantly outperformed by the DQLC/VQLC when there is a low delay constraint. This indicates that different approaches are needed to perform close to the bounds when the code length is high and low. The VQLC/DQLC also apply for bandwidth compression of a multivariate Gaussian transmitted on point-to-point links.
  •  
3.
  • Floor, Pål Anders, et al. (författare)
  • Zero-Delay Joint Source-Channel Coding for a Bivariate Gaussian on a Gaussian MAC
  • 2012
  • Ingår i: IEEE Transactions on Communications. - 0090-6778 .- 1558-0857. ; 60:10, s. 3091-3102
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, delay-free, low complexity, joint source-channel coding (JSCC) for transmission of two correlated Gaussian memoryless sources over a Gaussian Multiple Access Channel (GMAC) is considered. The main contributions of the paper are two distributed JSCC schemes: one discrete scheme based on nested scalar quantization, and one hybrid discrete-analog scheme based on a scalar quantizer and a linear continuous mapping. The proposed schemes show promising performance which improves with increasing correlation and are robust against variations in noise level. Both schemes also exhibit a constant gap to the performance upper bound when the channel signal-to-noise ratio gets large.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy