Name
Abstract | ||
|---|---|---|
Given a primitive polynomial $p(x)$ , of degree $n$ , we deal with the problem of finding the number of possible linear feedback shift register realizations, with m-input m-output delay elements, such that the corresponding characteristic polynomial is $p(x)$ . We show the equivalence between these realizations and a set of specially structured matrices. Furthermore, the number of realizations is computed for some special cases. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TIT.2011.2174332 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
linear feedback shift registers,primitive polynomial,special case,special structure,register realization,m-input m-output delay element,possible linear feedback shift,corresponding characteristic polynomial,shift registers,vectors,characteristic polynomial,linear feedback shift register,spread spectrum communication,polynomials,silicon | Characteristic polynomial,Discrete mathematics,Shift register,Primitive polynomial,Polynomial,Matrix (mathematics),Software,Equivalence (measure theory),Mathematics,Spread spectrum | Journal |
Volume | Issue | ISSN |
58 | 3 | 0018-9448 |
Citations | PageRank | References |
8 | 0.83 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Krishnaswamy | 1 | 8 | 0.83 |
| Harish K. Pillai | 2 | 90 | 20.79 |