| Type of document: |
 |
Articles in peer-reviewed journal |
|
| Domain: |
|
|
|
| Title: |
|
Fast Multi-Sequence Shift-Register Synthesis with the Euclidean Algorithm |
|
| Author(s): |
|
Alexander Zeh 1, 2, Antonia Wachter 2, 3 |
|
| Research team(s): |
|
|
|
| Research team (except Inria): |
|
Géométrie algébrique réelle |
| Abstract: |
|
Feng and Tzeng's generalization of the Extended Euclidean Algorithm synthesizes the shortest--length linear feedback shift--register for \$s \geq 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 \$\ONsn^2\$. An acceleration based on the Divide and Conquer strategy is proposed and it is proven that subquadratic time complexity is achieved. |
|
| Full text language: |
|
English |
|
|
| Journal title: |
|
Advances in mathematics of communications |
|
| Publication date: |
|
2011 |
|
| Audience: |
|
international |
|
| Commercial editor: |
|
American Institute of Mathematical Science |
|
| Volume: |
|
5 |
|
| Number: |
|
4 |
|
| Pagination: |
|
667--680, posted-at = 2011-10-26 07:39:25 |
|
|
| Keywords: |
|
euclid – irs – multisequence |
|
BibTeX,EndNote,...
