I have developed an algorithm that counts the number of times a particular block (within a 2D Matrix) crosses zero. Here's an example:
Matrix = {
1, 2, -1, -0.1,
4, 3, -6, -12,
12, 2, -5, 19,
8, -1, 12, -9,
}
Then the matrix is split into sub-matrices (or blocks)
B1 = {
1, 2,
4, 3
}
B2 = {
-1, -0.1,
-6, -12,
}
...,
...,
...
An example summing up each of the blocks is:
Ex=∑n|x[n]|2
Find the signum value of each element within the block (will return "1", "-1", "0") respectively.
If the signum value returns -1 then count increments by 1.
This will repeat until the there is no blocks, however, will only produce 1 value per block.
I am looking for a way to put all this process into an equation so I can demonstrate this rather than having to explain the processes in written text everytime. Is this possible?
B1 = {1, 4, -1, -3, 0.12, -2.3}– 2012-11-21(the answer would be 3).. Then another block.. B2 = {1, 2, 5, -21, -0.1} = 2 .. make sense?