Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Recent content by fra93

  1. F

    How to test if a pseudo-random sequence is complete?

    I am not testing LFSR. I am testing my circuit that has a complete sequence. For complete I mean 2^n numbers, and not 2^n-1 as in the LFSR case. I can run simulations for small bit-lengths, lets say n < 24. If I add more bits the simulation will take too much time to complete. I can not run a...
  2. F

    How to test if a pseudo-random sequence is complete?

    That is exactly what I did, and all the circuits I drawn in the first post have a complete sequence.
  3. F

    How to test if a pseudo-random sequence is complete?

    Do you mean as a 2d plot? I plotted the generated numbers as an hystogram and they looked random. I also tested the sequence using all the Dieharder tests, and I got slightly better results than a simple lfsr. My concearn is not on the quality of the sequence, but on the testability as I scale...
  4. F

    How to test if a pseudo-random sequence is complete?

    Is analytical proof the only way? Is there any form of formal verification method and tool that can assist?
  5. F

    How to test if a pseudo-random sequence is complete?

    Hi I invented a "shift register" like circuit that behaves similarly to a linear feedback shift register, but it has a complete sequence. From here on I will call this circuit Non-Linear Pseudo Random Generator NLPRG for simplicity. Below some circuit typologies ranging from 3 up to 16 bits (...

Part and Inventory Search

Back
Top