Abstract
In telecommunication radio systems with random multiple-access (RMA), user signals are characterized by a random intermittent radiation mode and the occurrence of their collisions in the propagation medium, i.e. conflicts at the physical level. Practical interest belongs to the situations when the useful and interfering (intermittent) signals are asynchronous at clock points. It should also be noted that when there are intermittent mutually non-orthogonal signals along the length of the information error more than two, the detection-separation algorithms that are optimal in terms of the minimum probability of error in estimating the discrete parameter of the useful signal are too complex. Therefore, the simplest case is investigated here, when the interfering signal is the only one. An algorithm for demodulation of a binary phase-manipulated signal is observed, which is observed at the background of a similar asynchronous clock noise, which is characterized by a random intermittent radiation mode. The minimum probability of error in the discrete information parameter estimation of the useful signal is chosen as the criterion of optimum for the synthesis. It is also assumed that all non-information parameters of the useful signal and similar interference are precisely known. The distribution medium is considered to be stationary in time. These initial data for the synthesis allow obtaining in the analysis the potential limits of the noise immunity of the digital signal demodulation, which is observed at the background of a similar intermittent noise. The result is a «framework» of the demodulation-separation procedure, which should be subsequently supplemented with nodes (blocks) of continuous parameters estimation that are not informational - frequencies, initial phases, amplitudes, shapes of bending, clock points, etc. The algorithm for demodulating a digital signal under the influence of such an asynchronous intermittent interference turns out to be about twice as complicated in comparison with the previously known one, when the signal and the interference at the clock points were assumed to be synchronous. A characteristic feature of the obtained compensation algorithm is the absence of feedback - the compensation procedure is performed forward, at the outputs of the signal correlators and interference. The result is generalized to the case when the clock frequencies of the signal and interference differ by an arbitrary value. A simplified approximation of the obtained algorithm is proposed.
Highlights
Дослiдженню проблеми розв’язання конфлiктiв на фiзичному рiвнi (тобто, в демодуляторах приймальних пристроїв), якi виникають при випадковому множинному доступi, присвячена величезна кiлькiсть публiкацiй (див., наприклад, монографiю [1], яку можна вважати епохальною)
Дослiдженню проблеми розв’язання конфлiктiв на фiзичному рiвнi, якi виникають при випадковому множинному доступi, присвячена величезна кiлькiсть публiкацiй
Найгiрша завадостiйкiсть алгоритму компенсацiї переривчастої завади спостерiгається за умови ї ї синхронiзму за тактовими точками i в областi, коли завада за миттєвою потужнiстю не перевищує корисний сигнал дБ дБ бiльше, нiж на 6 або менша за нього на 10-15
Summary
Дослiдженню проблеми розв’язання конфлiктiв на фiзичному рiвнi (тобто, в демодуляторах приймальних пристроїв), якi виникають при випадковому множинному доступi, присвячена величезна кiлькiсть публiкацiй (див., наприклад, монографiю [1], яку можна вважати епохальною). При цьому дiльник Z > 0 спростуємо як такий, що є однаковим для всiх апостерiорних iмовiрностей (6) станiв групового ДП rГ = (︀r1k, r2k−1, r2k)︀ i тому не вплине на рiшення щодо стану ДП r1 корисного сигнала. Одержимо вираз для аргумента ППР (9) в явному видi, використовуючи опис iнтеграла (2) вiд сигнальної функцiї, його представлення (5), позначення (3), (4) та вирази для функцiоналiв правдоподiбностi станiв ДП корисного (першого) сигнала через функцiонали правдоподiбностi станiв групового ДП rГ (7) та (8).
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have