BM Algorithm for Binary LFSR Synthesis

版本 1.1.0 (2.5 KB) 作者: ji hea Lim
bm2() is a direct implementation of the original BM algorithm for binary LFSR synthesis.
178.0 次下载
更新时间 2019/12/11

查看许可证

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

引用格式

ji hea Lim (2026). BM Algorithm for Binary LFSR Synthesis (https://ww2.mathworks.cn/matlabcentral/fileexchange/73633-bm-algorithm-for-binary-lfsr-synthesis), MATLAB Central File Exchange. 检索时间: .

MATLAB 版本兼容性
创建方式 R2019b
兼容任何版本
平台兼容性
Windows macOS Linux
类别
Help CenterMATLAB Answers 中查找有关 Polynomials 的更多信息
版本 已发布 发行说明
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