Abstract
The paper presents the substantiation of algorithm for forming the structure and technique for message transmission in unidirectional radio communication systems. The proposed algorithm is intended for use before the beginning of signal transmission for implementing the single-use reliable transmission technique with delayed acknowledgement, but with the possibility of forecasting the interference conditions at the receiving point. The algorithm stages are also discussed and analyzed. The first stage involves the search of the threshold quantity of correctly received symbols of message, the quantity of its blocks and the length of code sequences, which ensure the attaining of required probability of erroneous reception (malfunctioning). The first stage of the algorithm is proposed implying the need to follow a specific order of operations that include gradual increase of the threshold, gradual rise of the quantity of message blocks, and gradual increase of the length of code sequences. The second stage involves the calculation of the structure of discrete messages and algorithm of their transmission that ensure the required probability of correct reception. It is proposed to execute this stage in a specific order that includes gradual increase of the repetition multiplicity of message transmission, gradual rise of the quantity of frequencies for parallel transmission of message, and gradual increase of the length of code sequences. It has been proved that precisely such order of algorithm execution ensures the best indicators regarding the required time and the optimization of the computational complexity (in terms of the number of iterations) in providing the required transmission validity in unidirectional transmission radio systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.