BM Algorithm for Binary LFSR Synthesis

Version 1.1.0 (2.54 KB) by ji hea Lim
bm2() is a direct implementation of the original BM algorithm for binary LFSR synthesis.
0.0
(0)
176 Downloads
Updated 11 Dec 2019

View License

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

Cite As

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

MATLAB Release Compatibility
Created with R2019b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Polynomials in Help Center and MATLAB Answers
Tags Add Tags

Community Treasure Hunt

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

Start Hunting!

Version Published Release Notes
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