Generation of delayed replicas of maximal-length linear binary sequences

By making use of the shift-and-add property of the maximal-length linear binary sequence, phase-delayed versions of the same sequence can be obtained by means of linear logic networks (modulo 2 adders) in conjunction with the sequence generator (e.g. a feedback shift register). This approach gives an alternative to the straightforward one which actually introduces the required time delays. The optimum way of deriving delayed versions in order to minimise the number of serial logical operations is indicated. The maximum number of serial additions required is given closely by log2n, where n denotes the number of binary stages in the generator. The advantages and shortcomings of this approach are briefly discussed.

[1]  D. Huffman A linear circuit viewpoint on error-correcting codes , 1956, IRE Trans. Inf. Theory.

[2]  William M. Siebert,et al.  A radar detection philosophy , 1956, IRE Trans. Inf. Theory.

[3]  P. E. Green,et al.  A Communication Technique for Multipath Channels , 1958, Proceedings of the IRE.

[4]  B. Elspas,et al.  The Theory of Autonomous Linear Sequential Networks , 1959 .

[5]  F. G. Heath,et al.  Chain codes and their electronic applications , 1961 .

[6]  F. G. Heath,et al.  Error-correcting data links using chain codes , 1962 .

[7]  J. J. Spilker Delay-Lock Tracking of Binary Signals , 1963, IEEE Transactions on Space Electronics and Telemetry.