Sorry I haven't got a Julia implementation but this report <http://crc.stanford.edu/crc_papers/CRC-TR-04-03.pdf>, Primitive Polynomial Generation Algorithms Implementation and Performance Analysis by Nirmal R Saxena and Edward J McCluskey, gives efficient algorithms that shouldn't be too hard to implement. The IntModN.jl <https://github.com/andrewcooke/IntModN.jl> package might be useful to you too, but I haven't used it myself.
[BTW, if you're interested in the effects of nonlinearity on the MLS identification procedure (which is the main topic of the Vanderkooy paper you cite) you might want to read my comment on it in JAES 43(1-2) 48.] On Thursday, October 20, 2016 at 8:52:26 PM UTC+1, CrocoDuck O'Ducks wrote: > > Hi there cool people! > > I have implemented a simple MLS generator using linear feedback shift > registers. I used as taps the ones provided in: > > Vanderkooy, J. (1994). Aspects of MLS Measuring Systems. Journal of the >> Audio Engineering Society, 42 (4), 219-231. >> > > However, now that the theory is a little bit clearer to me, I would like > to make it more general. The feedback taps are supplied by the coefficients > of the primitive factors of the polynomial x^N + 1, where N is the length > of the sequence (related to the number of registers). I would like to know > from you guys if you think there is some Julia package I can use to > calculate primitive factors of polynomials. As mentioned in the title, I > need to perform this in modulo-2. Here > <http://www.newwaveinstruments.com/resources/articles/m_sequence_linear_feedback_shift_register_lfsr.htm> > > there are more info and the Berlekamp algorithm is mentioned. Has that > algorithm already been implemented somewhere (couldn't really quite find > out at the moment)? If not, do you know any good source that could assist > me in the implementation? >
