BM Algorithm for Binary LFSR Synthesis

Version 1.1.0 (2,54 ko) par ji hea Lim
bm2() is a direct implementation of the original BM algorithm for binary LFSR synthesis.
179 téléchargements
Mise à jour 11 déc. 2019

Afficher la licence

bm2() is a direct implementation of the original Berlekamp-Massey algorithm for binary LFSR synthesis.
c = bm2(s) gives the LFSR feedback polynomial coefficients c for generating the binary sequence s. The vectors c and s are row vectors. For correct operation, the length of s should be greater than or equal to 2L, where L is the number of delay elements in the original LFSR.
Refer to bm2_test.m script provided together for a sample usage of bm2().

References:
[1] James L. Massey, "Shift-register synthesis and BCH decoding", IEEE Trans. Inform. Theory, vol. 15, no. 1, pp. 122-127, Jan.1969

Citation pour cette source

ji hea Lim (2026). BM Algorithm for Binary LFSR Synthesis (https://fr.mathworks.com/matlabcentral/fileexchange/73633-bm-algorithm-for-binary-lfsr-synthesis), MATLAB Central File Exchange. Extrait(e) le .

Compatibilité avec les versions de MATLAB
Créé avec R2019b
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Catégories
En savoir plus sur Polynomials dans Help Center et MATLAB Answers
Version Publié le Notes de version
1.1.0

an error in discrepancy bit generation has now been fixed.
a random seed has been incorporated for testing bm2() in bm2_test.m

1.0.0