Оптимизация двоичных групповых последовательностей, полученных в результате нелинейного кодового уплотнения

Abstract

This paper presents the challenge of optimization of binary group sequences obtained from the nonlinear code multiplexing. It shows that at optimal element wise methodology for group sequences in a full system of orthogonal Walsh functions, a maximum criterion for the minimum distance of group sequences is equal to a maximum criterion for the minimum correlation response for the information orthogonal Walsh functions which contain group sequences. After a nonlinear code multiplexing group sequences are often contained errors, that makes using this method of multiplexing more difficult. To eliminate this source of errors the algorithm of optimization of group sequences was suggested. In this algorithm some elements of group sequences can be replaced with the opposite elements. Additionally, the algorithm of receiving of the entire group sequence among the nearest group sequences was developed. This algorithm provides considerable increasing of immunity while group sequence receiving unlike the other algorithm of element-to-element receiving in a full system of orthogonal Walsh functions.