![]() As points out, if the time code is of length $220$ bits, then examining all $220$ bits could result in an LFSR of length $110$. The "not practical in any way" suggests that perhaps insufficient memory was allocated for storing the various polynomials used internally in the BMA or that buffers overflowed etc. It is likely that this issue is a matter of mistakes in the implementation of the BMA. Just the first few bits are as expected and then the bits seem to flip. It can also not be reconstructed with the 110-bit irreducible polynomial the BMA finds. This code seems to have a linear complexity of 110, which is not practical in any way. In the body of the question, the OP complains It is not clear what exactly the "certain time code" is, but I will take it to mean a finite-length sequence $s_0, s_1, \ldots, s_$ used by the Berlekamp-Massey algorithm.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |