Thread Subject: Count state switches in a vector?

Hi there,

I'm trying to find a smart (read: vectorized) way to count "state switches" in a vector. What I mean is, the number of times a vector switches between 0 and 1:

[0 1 0] -> 2
[1 0 1] -> 2
[0 0 1] -> 1
[0 0 0 1 1 0 0 1 1] -> 3
[1 1 1 1 1 1 1 1 0] -> 1

The solution only really needs to take a vector of length 32, and it will always be a value of either 0 or 1. I can obviously do this in a loop, but I was wondering if there was some clever function I could use to do this for a really big set of these vectors. Maybe something about a cumulative summation or something?

Thanks!

Ian Clarkson wrote:
 
> I'm trying to find a smart (read: vectorized) way to count "state switches" in a vector.

> [0 0 0 1 1 0 0 1 1] -> 3

> The solution only really needs to take a vector of length 32, and it will always be a value
> of either 0 or 1.

sum(abs(diff([0 0 0 1 1 0 0 1 1])))

OR

>> A = [0 0 0 1 1 0 0 1 1];
>> sum(A(1:end-1) ~= A(2:end))

Walter Roberson wrote:
> Ian Clarkson wrote:
>> I'm trying to find a smart (read: vectorized) way to count "state
>> switches" in a vector.

>>> A = [0 0 0 1 1 0 0 1 1];
>>> sum(A(1:end-1) ~= A(2:end))

Or, since you are only using 0 and 1,

sum(xor(A(1:end-1),A(2:end)))