Maximum length sequence
- Maximum length sequence
-
Une maximum length sequence (MLS) est une pseudorandom binary sequence (en) (PRBS) — c'est-à-dire une suite périodique de valeurs produite par un linear feedback shift register (LFSR) — qui explore toutes les valeurs pouvant être produites par le registre à décalage : s'il comporte n bascules, 2n - 1 valeurs sont parcourues.
Le calcul effectué par le registre à décalage peut être représenté par un polynôme dont les coefficients valent 0 ou 1. Une condition nécessaire et suffisante pour que la suite générée par le LFSR soit une maximum length sequence est que le polynôme associé soit un polynôme primitif (en).
Wikimedia Foundation.
2010.
Contenu soumis à la licence CC-BY-SA. Source : Article Maximum length sequence de Wikipédia en français (auteurs)
Regardez d'autres dictionnaires:
Maximum length sequence — A maximum length sequence (MLS) is a type of pseudorandom binary sequence. They are bit sequences generated using maximal linear feedback shift registers and are so called because they are periodic and reproduce every binary sequence that can be… … Wikipedia
Maximum Length Sequence — Eine Maximum Length Sequence (kurz MLS, deutsch Folge maximaler Länge oder Maximalfolge) ist eine pseudozufällige, binäre Folge, die vorwiegend zur Ermittlung des Impulsverhaltens bestimmter Systeme (zum Beispiel den Nachhall von Räumen)… … Deutsch Wikipedia
Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… … Wikipedia
M-sequence — An M sequence may refer to: *Regular sequence, which is an important topic in commutative algebra. *A maximum length sequence, which is a type of pseudorandom binary sequence … Wikipedia
Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… … Wikipedia
Sequence alignment — In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences.[1]… … Wikipedia
Regular sequence (algebra) — In commutative algebra, if R is a commutative ring and M an R module, an element r in R is called M regular if r is not a zerodivisor on M , and M/rM is nonzero. An R regular sequence on M is a d tuple: r1, ..., rd in R such that for each i le; d … Wikipedia
Davenport–Schinzel sequence — In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited. The maximum possible length of a Davenport–Schinzel sequence is bounded by the number of… … Wikipedia
Run length limited — or RLL coding is a technique that is used to store data on recordable media. Specifically, RLL prevents long stretches of repeated bits from causing the signal recorded on media to not change for an excessive period, by modulating the data. RLL… … Wikipedia
Attribute sequence — A clause attribute is a characteristic of a clause. Some examples of clause attributes are: the number of literals in a clause (i.e., clause length) the number of term symbols in a clause the number of constants in a clause the number of… … Wikipedia
Portail des mathématiques
Portail de l’électricité et de l’électronique
