BM Algorithm for Binary LFSR Synthesis
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
Plateformes compatibles
Windows macOS LinuxCatégories
- MATLAB > Mathematics > Elementary Math > Polynomials >
Tags
Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
| Version | Publié le | Notes de version | |
|---|---|---|---|
| 1.1.0 | an error in discrepancy bit generation has now been fixed.
|
||
| 1.0.0 |
