Computing the parameters of the discrete channel resulting under frequency hopping in the general case

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.

Presented by the member of Editorial Board: A. I. Lyakhov