Login
- Title:
Fast Multi-Sequence Shift-Register Synthesis with the Euclidean Algorithm
- Document type:
- Zeitschriftenaufsatz
- Author(s):
- Zeh, A.; Wachter, A.
- Abstract:
- Feng and Tzeng's generalization of the Extended Euclidean Algorithm synthesizes the shortest--length linear feedback shift--register for \$s ≥1\$ sequences, where each sequence has the the same length \$n\$. In this contribution, it is shown that Feng and Tzeng's algorithm which solves this multi--sequence shift--register problem has time complexity \$\ON{sn^2}\$. An acceleration based on the Divide and Conquer strategy is proposed and it is proven that subquadratic time complexity is achieved.
- Journal title:
- Adv. Math. Commun.
- Year:
- 2011
- Journal volume:
- 5
- Month:
- Nov
- Journal issue:
- 4
- Pages contribution:
- 667--680
BibTeX