Quote Originally Posted by Byte_Butcher View Post
well, I guess that you can only have bit arrays up to 256 elements, but I was thinking something like this..

Code:
bigarray 	var	  bit[256] 'Large array to hold data
newdata	var	  bit   'newest bit to be shifted in
index		var	  byte


for 0 to 255
    bigarray[index] = bigarray[index +1] 
    next index
    
bigarray[255] = newdata  'put the newest data bit into the array
Maybe with 4 big arrays you could shift through 1024 steps?
Or have I missed the point entirely...
Byte_Butcher,

I hadn't thought about a bit array. My thinking was stuck on word arrays, ">>" functions, and being able to get the bit that falls out the end of one word and automatically put it into the input of the next word in the array. In assembler. this is almost trivial.

Your idea seems very doable, except that every bit has to be handled individually. I'm concerned about time, since I want to shift all 1000 bits in 100usec or less. Actually, I'd like to do 2000 bits in that time if I could.

Joe