Name
Abstract | ||
|---|---|---|
We describe a method for efficient software generation of binary linear sequences. Suppose that a machine sized word can hold an unsigned integer between 0 and 2w−1 and a binary linear sequence (s(t))t≥0 has a characteristic polynomial of degree n having l nonzero coefficients. Then given nw initial bits of the sequence, it is possible to generate successive blocks of (s(t))t≥0 of length w bits each. The time required to generate each block is equal to the time required to perform l bitwise XOR operations on machine sized words. Compared to the basic method of sequence generation, this provides a w-fold increase in speed. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/s00200-004-0147-7 | Appl. Algebra Eng. Commun. Comput. |
Keywords | Field | DocType |
Linear Binary Recurrence,Linear feedback shift register (LFSR) | Bit-length,Characteristic polynomial,Discrete mathematics,Combinatorics,Bitwise operation,Maximum length sequence,Nonzero coefficients,Software generation,Algorithm,Pseudorandom binary sequence,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
15 | 3 | 0938-1279 |
Citations | PageRank | References |
2 | 0.46 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjay Burman | 1 | 19 | 2.99 |
| Palash Sarkar | 2 | 1505 | 130.85 |