 |
 |
|
|
| HAL: hal-00647586, version 1 |
| DOI: 10.3934/amc.2011.5.667 |
| See detailed view |  BibTeX,EndNote,... |
 |
| Advances in mathematics of communications 5, 4 (2011) 667-680 |
|
|
|
|
| Fast Multi-Sequence Shift-Register Synthesis with the Euclidean Algorithm |
|
|
| Alexander Zeh 1, 2Antonia Wachter 2, 3 |
|
|
| (2011) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | TANC (INRIA Saclay - Ile de France) |
|
|
|
INRIA – Polytechnique - X – CNRS : UMR7161 |
|
|
| 2: | Institute of Communications Engineering [Ulm] (INT - University of Ulm.) |
|
|
|
University of Ulm |
|
|
| 3: | Institut de Recherche Mathématique de Rennes (IRMAR) |
|
|
|
CNRS : UMR6625 – Université de Rennes 1 – École normale supérieure de Cachan - ENS Cachan – Institut National des Sciences Appliquées (INSA) : - RENNES – Université de Rennes II - Haute Bretagne |
|
|
|
|
|
|
|
|
|
| Géométrie algébrique réelle |
|
|
|
|
| Domain | : | Computer Science/Information Theory and Coding Mathematics/Information Theory |
|
|
| euclid – irs – multisequence |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00647586, version 1 | |
| http://hal.inria.fr/hal-00647586 | |
| oai:hal.inria.fr:hal-00647586 | |
| From: Alexander Zeh | |
| Submitted on: Friday, 2 December 2011 12:41:13 | |
| Updated on: Thursday, 30 May 2013 11:29:10 | |
