Studying of the scrambling coding sequence performance based on the ninth order primitive polynomial in telecommunication networks of information systems
Scrambling coding sequences find wide application in telecommunication networks to improve noise immunity and information transmission concealment. There are many different scrambling coding sequences with different autocorrelation properties from which one can be chosen. In the previous paper the authors researched a possibility of using scrambling coding sequences built on the base of the primitive eighth degree polynomial in telecommunication networks of information systems to enhance noise immunity and concealment of information transmission. This sequence, consisting of two hundred and fifty five chips, showed some good performance in terms of information transmission quality indicators. Nevertheless, some of its limitations were also revealed, which are mostly linked to the number of used chips. This paper aims to overcome the problems by proposing to use scrambling coding sequences based on the ninth degree primitive polynomial. The required polynomial was selected and the needed scrambling sequence generated. This scrambling coding sequence includes five hundred and eleven chips. Computer simulation helped to establish that scrambling coding sequence synthesized using this polynomial permits to substantially improve information transmission quality indicators as compared to the case of the scrambling coding sequence based on the eighth degree polynomial. For example, the interfering signal and internal noise to desired signal ratio, for which reception of transmitted bit sequence is still possible, increased by three decibels. It is clearly linked to the doubling of the number of the used chips. To preserve the transmission rate, the occupied frequency spectrum needs to be doubled. An inference is made as to a possibility of using the synthesized coding sequence in practical realizations of telecommunication channels.