Change search
Refine search result
1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Krasheninnikov, Pavel V.
    et al.
    Siberian State University of Telecommunications and Information Sciences, Novosibirsk, Russia.
    Melent’ev, Oleg G.
    Siberian State University of Telecommunications and Information Sciences, Novosibirsk, Russia.
    Kleyko, Denis
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Shapin, Alexey
    Ericsson Research, Luleå, Sweden.
    Parameter Estimation for the Resulting Logical Channel Formed by Minimizing Channel Switching2019In: Automation and remote control, ISSN 0005-1179, E-ISSN 1608-3032, Vol. 80, no 2, p. 278-285Article in journal (Refereed)
    Abstract [en]

    We propose a method for calculating the parameters of the resulting discrete channel for secondary users in cognitive radio systems formed by the algorithm for minimizing channel switchings. The availability of channel slots is defined by a simple Markov chain. We obtain mathematical expressions for determining the transition probabilities of a graph reduced to two states for any number of primary channels.

  • 2.
    Melentyev, Oleg
    et al.
    Siberian State University of Telecommunications and Information Sciences.
    Kleyko, Denis
    Siberian State University of Telecommunications and Information Sciences.
    Computing the parameters of the discrete channel resulting under frequency hopping in the general case2013In: Automation and remote control, ISSN 0005-1179, E-ISSN 1608-3032, Vol. 74, no 7, p. 1128-1131Article in journal (Refereed)
    Abstract [en]

    We derive expressions for computing the parameters of the resulting discrete channel formed by frequency hopping between an arbitrary number of original channels defined by simple Markov chains for any hopping slot lengths. In obtaining the expressions, we aggregate the graph that described the hopping process. The expressions define transition probabilities of the graph defined by a Markov chain reduced to two states.

1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf