FPGA Implementation of Optimal PN_Sequences by Time_Multiplexing Technique

In this paper, FPGA implementation of a LFSR and PSEUDO_NOISE(PN) sequences are designed and carried out for many purposes. The motivation for that is multifold: LFSR and related PN sequences are indispensable building blocks not only for cipher sequence used in cryptography, steganography but also for BIST (build in self test system), scrambler. There have been a lot of attempts to develop specific circuit and sequences for these applications. However, the interleaving approach renders the optimal products in term of sequences length, statistical properties (distributions, autocorrelation function(ACF) and linear complexity (LC). It will be shown that the Interleaving structure can be easily expressed in time-multiplexing technique (namely Delay operation-D-transform). The equivalence between the D-transform and other well-known methods will be also highlighted in this contribution. Furthermore, the interleaving structure with outstanding LC will be given. � Springer Nature Switzerland AG 2020.