SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "(WFRF:(Ottosson Tony 1969 )) srt2:(2000-2004)"

Sökning: (WFRF:(Ottosson Tony 1969 )) > (2000-2004)

  • Resultat 1-10 av 47
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  •  
4.
  • Agrell, Erik, 1965, et al. (författare)
  • On the optimality of the binary reflected Gray code
  • 2004
  • Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 50:12, s. 3170-3182
  • Tidskriftsartikel (refereegranskat)abstract
    • This paper concerns the problem of selecting a binary labeling for the signal constellation in M-PSK, M-PAM, and M-QAM communication systems. Gray labelings are discussed and the original work by Frank Gray is analyzed. As is noted, the number of distinct Gray labelings that result in different bit-error probability grows rapidly with increasing constellation size. By introducing a recursive Gray labeling construction method called expansion, the paper answers the natural question of what labeling, among all possible constellation labelings, will give the lowest possible average probability of bit errors for the considered constellations. Under certain assumptions on the channel, the answer is that the labeling proposed by Gray, the binary reflected Gray code, is the optimal labeling for all three constellations, which has, surprisingly, never been proved before.
  •  
5.
  • Agrell, Erik, 1965, et al. (författare)
  • The binary reflected Gray code is optimal for M-PSK
  • 2004
  • Ingår i: Proc. IEEE International Symposium on Information Theory, Chicago, Illinois, USA. - 0780382803 ; , s. 164-
  • Konferensbidrag (refereegranskat)abstract
    • This paper is concerned with the problem of selecting a binary labeling for the signal constellation in an M-PSK communication system. A good starting point is labelings having the Gray property, but this is not altogether enough, since the number of distinct Gray labelings that result in different bit error probability grows rapidly with increasing constellation size. By introducing a recursive Gray labeling construction method called expansion, the paper answers the natural question of what labeling, among all possible constellation labelings (not only Gray), that will give the lowest possible average probability of bit errors. Under certain assumptions on the channel, the answer is that the labeling originally proposed by Gray, the binary reflected Gray code, is the optimal labeling for M-PSK systems, which has, surprisingly, never been proved before.
  •  
6.
  • Berens, Friedbert, et al. (författare)
  • Modulation and Coding
  • 2000
  • Ingår i: Third Generation Mobile Communication Systems (Ramjee Prasad, Werner Mohr and Walter Konhäuser editors), chapter 5. - 1580530826
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)
  •  
7.
  •  
8.
  •  
9.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 47

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