Tsekhmistro, R. I.Kirichenko, L. O.Krug, O. Y.Storozhenko, A. W.2018-05-202018-05-202011Tsekhmistro R. I. Comparative analysis of pseudorandom number generation in the up‐to‐date wireless data communication / R. I.Tsekhmistro, O. Y. Krug, A. W. Storozhenko, L. O. Kirichenko // Telecommunications and Radio Engineering - 2011- 70(4) - p. 325-333http://openarchive.nure.ua/handle/document/5322Many experiments and analyzing techniques require generating of number sequences of a purely random nature. Such sequences can be applied in the problems of cryptography, navigation, radio engineering, location of remote and fast-moving objects, in stochastic computations and in a great variety of other implementations. Recently, the Wi-Fi (Wireless Fidelity) technology became very wide spread, enabling a wireless data communication with a high accuracy. The specification of this technique is described in the well-known standard IEEE 802.11x, regulating the data interchange procedures over the radio channels in the wireless local area networks (WLAN). Standard IEEE 802.11x specifies two transmission methods of the spread spectrum signal: the Frequency Hopping Spread Spectrum (FHSS) and Direct Sequence Spread Spectrum (DSSS). The FHSS technology uses the whole range (2.4 GHz), which is divided into 79 channels, 1 MHz each. The receiver and transmitter are switched to the carrier frequencies of the channels in-series according to the pseudorandom law.The paper considers generation of pseudorandom number sequences derived by applyingrecurrent algorithm and chaotic reflections. The results of an operative implementation of these algorithms at the up‐to‐date microprocessor devices are presented. The generated sequenceshave been compared in terms of their compliance with the independence and evenness criteria.enthe Lehmer algorithmchaotic reflectionhardware implementation of algorithmsWi‐Fi technologyArticle