An evaluation of potential noise immunity of a decoding algorithm for pseudo-random codes based on passive matched filtering

Аuthors

Mordasov K. A.

National Research University of Electronic Technology, 1, sq. Shokina, Moscow, Zelenograd, 124498, Russia

e-mail: kosmor@mail.ru

Abstract

An algorithm is suggested to decode rapidly long pseudo-random codes. An analytical estimation is considered for a potential noise immunity of the algorithm. Computer simulation results are presented for the algorithm operating in discrete symmetric channel using simplex block code (1023, 10) generated by means of circular shifts for one period of linear recurrent sequence with maximum length. The simulation results are compared with analytical ones. The comparison demonstrates a necessity to improve the pseudo¬random code decoding algorithm to reveal its useful potential capabilities.

Keywords:

maximum-length code, algorithm, decoding, noise immunity