SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Gabry J.) "

Sökning: WFRF:(Gabry J.)

  • Resultat 1-2 av 2
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Wijayatunga, Priyantha, 1967-, et al. (författare)
  • Discussion on the meeting on 'Data visualization'
  • 2019
  • Ingår i: Journal of the Royal Statistical Society. - UK : Royal Statistical Society. - 0964-1998 .- 1467-985X. ; 182:2, s. 433-441
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
    • Visualizing both conditional and marginal associations in contingency tables by using simple diagrams is discussed
  •  
2.
  • Goubet, Olivier, et al. (författare)
  • Low-Complexity Scalable Iterative Algorithms for IEEE 802.11p Receivers
  • 2015
  • Ingår i: IEEE Transactions on Vehicular Technology. - 0018-9545 .- 1939-9359. ; 64:9, s. 3944-3956
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we investigate receivers for vehicle-to- vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. Vehicular channels are characterized by multiple paths and time variations, which introduce challenges in the design of receivers. We propose an algorithm for IEEE 802.11p-compliant receivers, based on orthogonal frequency-division multiplexing (OFDM). We employ iterative structures in the receiver as a way to estimate the channel despite variations within a frame. The channel estimator is based on factor graphs (FGs), which allow the design of soft iterative receivers while keeping acceptable computational complexity. Throughout this paper, we focus on designing a receiver that offers a good complexity-performance tradeoff. Moreover, we propose a scalable algorithm to be able to tune the tradeoff, depending on the channel conditions. Our algorithm allows reliable communications while offering a considerable decrease in computational complexity. In particular, numerical results show the tradeoff between complexity and performance measured in computational time and bit error rate (BER), as well as frame error rate (FER) achieved by various interpolation lengths used by the estimator, which both outperform by decades the standard least squares (LS) solution. Furthermore, our adaptive algorithm shows a considerable improvement in terms of computational time and complexity against state-of-the-art and classical receptors while showing acceptable BER and FER performance.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-2 av 2

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