Correlation properties for radio channels from multiple base stations to two antennas on a small handheld terminal

2003 ◽  
Author(s):  
W.A.T. Kotterman ◽  
G.F. Pedersen ◽  
K. Olesen ◽  
P. Eggers
Keyword(s):  
Base Stations ◽  
Radio Channels ◽  
Correlation Properties

scholarly journals Development of an algorithm for routing self­organizing radio networks

Connectivity ◽  
2020 ◽  
Vol 148 (6) ◽  
Author(s):  
V. O. Breslavsʹkyy ◽  
◽  
O. A. Laptyev ◽  
A. M. Pravdyvyy ◽  
S. A. Zozulya
Keyword(s):  
Information Exchange ◽  
Routing Algorithm ◽  
Base Stations ◽  
Dipole Antennas ◽  
Radio Channels ◽  
Self Organized ◽  
Transmission Of Information ◽  
The University ◽  
To Receive ◽  
Self Organizing

The routing algorithm in self-organizing radio channels is proponent. The following peculiarities: reduction of the overworld of the flow of critical signals in the grid for the transmission of the function of vibration (retrofitting) to the routes of all the nodes; Shows the adaptation and self-updating of the net for an alternative route when going out of the way of active retransmission universities. It has been deliver that the algorithm is protonated for the supremacy of the parameters for the reduction of the characteristics in proportion to the algorithms used. Self-organizing routing algorithm (SRA) of signs for mobile childless self-organized self-organizing links, in which universities may have the same status. The functions of the base stations distributed among the participants of the informational relationship. The SRA algorithm is intelligent, in which the possibility is laid by the university to independently decide on the fate of the route that/or is renewed. The measure, prompted in accordance with the SRA protocol, in the event that it is necessary to update the packages in the decimal universities, the form of the new session, so that it is possible to distribute information from the new universities. In case of transmission of information from a group of universities of the same university, the identifier allows the university to receive information and distribute information. In the designated algorithm, to encourage the route, the universities will only rotate the necessary fields and do not rotate the required fields, allowing the speed of an hour of processing and taking decisions about participating in the route. To process the package, it is not necessary to insert the package in one piece, to finish it without looking over the fields and adjusting the values. In the SRA algorithm for verifying the delivery of packets, the power of dipole antennas is to broadcast on all sides, so that it is possible to see any packets in the confirmation or to change a number of such packets. Fragmentation of the routing algorithm of self-organizing radio channels based on the parameter of interlocking the network traffic, changing the basic protocols of information exchange by 15%. This is general result to bring the overvoltage of developed this algorithm.

scholarly journals Noise-like discrete signals for asynchronous code division radio systems

Radiotekhnika ◽  
2021 ◽  
pp. 175-183
Author(s):  
A.A. Kuznetsov ◽  
O.A. Smirnov ◽  
T.Y. Kuznetsova
Keyword(s):  
Cross Correlation ◽  
Asymptotic Properties ◽  
Base Station ◽  
Communication Services ◽  
Radio Channels ◽  
Gold Codes ◽  
Discrete Signals ◽  
The Cost ◽  
Kasami Sequences ◽  
Correlation Properties

This article discusses noise-like discrete signals (pseudo-random sequences) for asynchronous code division systems for radio channels. Asynchrony implies the use of sequences that are statistically uncorrelated for an arbitrary cyclically shifted copy of the signals, i.e. their cross-correlation coefficient for arbitrarily chosen starting points is close to zero. The fundamental theoretical limit for this characteristic is the well-known Welch boundary. In this paper, we compare the correlation properties of various sets (Gold codes, Kasami sequences, etc.) with this fundamental limit. The parameters of different codes are estimated, the corresponding bound is shown and compared with the real correlation characteristics of the codes. For the approximation, the Laurent series expansion and the Puiseau series were used. The asymptotic properties were also estimated. The paper also considers new ensembles of noise-like discrete signals for asynchronous systems. These codes are statistically uncorrelated, asymptotically the square of their cross-correlation for arbitrary starting points tends to the theoretical Welch bound. Moreover, the cardinality (power of the set) of new signal ensembles is much higher than that of Gold codes and Kasami sets. Consequently, the practical use of such noise-like discrete signals will increase the capacity of asynchronous code division systems for radio channels and reduce the cost of communication services. In addition, new sets of spreading signals will be useful for the implementation of the so-called. soft capacity, i.e. when, if necessary, the base station can increase the subscriber capacity with a slight decrease in the quality of service.

Sign in / Sign up

Export Citation Format

Share Document