A generalized Euclidean algorithm for multisequence shift-register synthesis

The problem of finding a linear-feedback shift register of shortest length capable of generating prescribed multiple sequences is considered. A generalized Euclidean algorithm, which is based on a generalized polynomial division algorithm, is presented. A necessary and sufficient condition for the u...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 1989-05, Vol.35 (3), p.584-594
Hauptverfasser:	Feng, G.-L., Tzeng, K.K.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Circuit properties Combinatorial mathematics Computer science Digital circuits Electric, optical and optoelectronic circuits Electronic circuits Electronics Exact sciences and technology Iterative algorithms Iterative decoding Linear feedback shift registers Milling machines Polynomials Shift registers Sufficient conditions
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!