BM Algorithm for Binary LFSR Synthesis

Versione 1.1.0 (2,54 KB) da ji hea Lim
bm2() is a direct implementation of the original BM algorithm for binary LFSR synthesis.
0.0
(0)
170 download
Aggiornato 11 dic 2019

Visualizza la licenza

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

Cita come

ji hea Lim (2025). BM Algorithm for Binary LFSR Synthesis (https://it.mathworks.com/matlabcentral/fileexchange/73633-bm-algorithm-for-binary-lfsr-synthesis), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2019b
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Polynomials in Help Center e MATLAB Answers
Tag Aggiungi tag

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
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