anchor.diff:                   (if (> (length v) c)
                        (subseq v 0 c)
                        v))))
  -    #'rec)))
  +      (let ((n (floor (/ skip n)))
  +            (m (mod skip n)))
  +        (loop repeat n do (funcall gen))
  +        (rec m))
  +      #'rec)))
   
   (defun num-gen (n &optional (init #*10))
     "return a function representing prbs-N. The returned function takes a single argument which is the number of the next n-bit integer values to generate from the sequence (default 1 value)."
  
positive.code:       (rec (num->bv (bv->num iv) n)))))
  
  (defun bvlist-gen (n &optional (init #*10))
    "return a function representing prbs-N. The returned function takes a single argument which is the number of the next n-bit bit vectors to generate from the sequence (default 1 value)."
    (let ((v (make-prbs n init)))
      (lambda (&optional (c 1))
        (loop for i from 1 to c collecting
             (let ((b (dcar v)))
               (setq v (dcdr v))
               b)))))
        
  (defun bit-gen (n &optional (init #*10))
    "return a function representing prbs-N. The returned function takes a single argument which is the number of the next bits to generate from the sequence (default 1 bit)."
    (let ((gen (bvlist-gen n init))
          (res #*))
  
negative.code: 
  (in-package :prbs)
  
  (declaim (optimize (debug 0) (safety 0) (speed 3)))
  
  (defun prbs-n (bv taps)
    "=> bit-vector
  
  