SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Johannesson Rolf) srt2:(1990-1994)"

Sökning: WFRF:(Johannesson Rolf) > (1990-1994)

  • Resultat 1-10 av 23
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  •  
4.
  • Johannesson, Rolf, et al. (författare)
  • A linear algebra approach to minimal convolutional encoders
  • 1993
  • Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 39:4, s. 1219-1233
  • Tidskriftsartikel (refereegranskat)abstract
    • The authors review the work of G.D. Forney, Jr., on the algebraic structure of convolutional encoders upon which some new results regarding minimal convolutional encoders rest. An example is given of a basic convolutional encoding matrix whose number of abstract states is minimal over all equivalent encoding matrices. However, this encoding matrix can be realized with a minimal number of memory elements neither in controller canonical form nor in observer canonical form. Thus, this encoding matrix is not minimal according to Forney's definition of a minimal encoder. To resolve this difficulty, the following three minimality criteria are introduced: minimal-basic encoding matrix, minimal encoding matrix, and minimal encoder. It is shown that all minimal-basic encoding matrices are minimal and that there exist minimal encoding matrices that are not minimal-basic. Several equivalent conditions are given for an encoding matrix to be minimal. It is proven that the constraint lengths of two equivalent minimal-basic encoding matrices are equal one by one up to a rearrangement. All results are proven using only elementary linear algebra
  •  
5.
  •  
6.
  • Johannesson, Rolf, et al. (författare)
  • A trellis coding scheme based on signal alphabet splitting
  • 1992
  • Ingår i: Problems of Information Transmission. - 0032-9460. ; 28:4, s. 308-316
  • Tidskriftsartikel (refereegranskat)abstract
    • A signal–code construction is proposed that ensures a better relationship between decoding reliability and complexity than the classical scheme. The coder is partitioned into several “elementary” binary convolutional coders and the decoder is partitioned into several Viterbi decoders. The transmission of PSK-modulated signals is considered in more detail.
  •  
7.
  •  
8.
  •  
9.
  • Johannesson, Rolf, et al. (författare)
  • Estimating the computational cut-off rate for the Gilbert-Elliott channel
  • 1991
  • Ingår i: [Host publication title missing]. - 0780300564 ; , s. 291-291
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we estimate the computational cutoff rate for sequential decoding when used together with short interleaving to communicate over the Gilbert-Elliot channel.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 23

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