TY - JOUR
T1 - An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences
AU - Ahmad, A.
AU - Elabdalla, A. M.
PY - 1997/1
Y1 - 1997/1
N2 - Based upon the mathematical characterization of linear feedback shift registers, an efficient algorithm for designing a maximal length pseudorandom binary sequence generator is postulated. The proposed algorithm is not only computationally cost effective in relation to existing algorithms, but also yields the knowledge of feedback connections corresponding to the reciprocal of each nth order primitive polynomial itself. This makes the algorithm a further, more effective tool for an LFSR based testing of digital circuits.
AB - Based upon the mathematical characterization of linear feedback shift registers, an efficient algorithm for designing a maximal length pseudorandom binary sequence generator is postulated. The proposed algorithm is not only computationally cost effective in relation to existing algorithms, but also yields the knowledge of feedback connections corresponding to the reciprocal of each nth order primitive polynomial itself. This makes the algorithm a further, more effective tool for an LFSR based testing of digital circuits.
KW - Maximal length sequences
KW - Shift registers
KW - Testing of digital circuits
UR - http://www.scopus.com/inward/record.url?scp=0002173077&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0002173077&partnerID=8YFLogxK
U2 - 10.1016/S0045-7906(96)00020-1
DO - 10.1016/S0045-7906(96)00020-1
M3 - Article
AN - SCOPUS:0002173077
SN - 0045-7906
VL - 23
SP - 33
EP - 39
JO - Computers and Electrical Engineering
JF - Computers and Electrical Engineering
IS - 1
ER -