whats wrong with that loop ?

Hi,

I wrote loop in matlab function (here is part of it):

               for k=1:ADDR
                   if(I>0)
                       [~,I] = min(temp);
                       if(reg(I) == 1)
                           temp(I) = +inf;
                           reg(I) = 0;
                       else
                           reg(I) = 1;
                           temp(I) = +inf;
                       end
                   else
                       [~,I] = max(temp);
                        reg(I) = 1;
                        temp(I) = -inf;
                   end
               end

reg is 20 bit array and it is output from the function. the input to the function are: ADDR runs from 0 to 20, temp is input array of 20 values and changing all time. the function search the minimum value of temp and write the index of it into reg, for example:

if(I>0) and temp = [21 24 25 2 35 8 14 27 78 85 54 29 96 35 1 74 36 35 28 41] temp values can change all the time - next ADDR it is a differnt values. if bit is set to 1, it should be last till ADDR reached 20. for the first one, the loop searh the minimum values from 20 input values. set the bet reg to 1 and in the next ADDR(ADDR=2) the loop will search the next minimum from 19 inputs values and setanother bit ti one in reg. and so on/

for example: if ADDR=0 if(I>0) and temp = [21 24 25 2 35 8 14 27 78 85 54 29 96 35 1 74 36 35 28 41] result shuld be: reg = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0] if ADDR=1 if(I>0) and temp = [21 24 25 2 35 8 14 27 78 85 54 29 96 35 1 74 36 35 28 41] the minimum of that array is 1 and its location is index=15 (counting from left..) result shuld be: reg = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0]

for ADDR=2 if(I>0) and temp = [38 25 25 45 35 18 14 27 78 85 54 29 96 35 45 74 36 35 28 41] the minimum of that array is 14 and its location is index=7 (counting from left..) result shuld be: reg = [0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0]

ADDR=3 if(I>0) and temp = [638 245 12 45 35 18 74 27 88 85 54 29 916 35 465 74 36 325 28 441] the minimum of that array is 12 and its location is index=3 (counting from left..) result shuld be: reg = [0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0]

and so on till ADDR=20:

     result shuld be:
     reg = [1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]

the problem her is that loop does not luck those reg bits - the location(indexing) changing all the time. It's adding 1 bits into reg, as far as ADDR increment, but the locations of the inexing changing all time.

Someone can help me to solve it ?

Thanks, Henry.

Hi again,

I want to keep the bits that been set to 1 (depending on ADDR1) for every increment of ADDR1, that mean:

ADDR1 = 01 --search the first order min from 20 input values reg = [0100000..00]

ADDR1 = 02 --search the secound order min from 20 input value and indicate reg as: reg = [0100100..00] it keep the previus set bits of reg. * remark: if the min of input values is the same of the previus value, then it will keep the set bit of reg and search next other min..

ADDR1 = 03 --search the third order min from 20 input value and indicate reg as: reg = [0100110..00] it keeps again the previus set bits of reg.

Is it possible todo so ?

Thanks for your help.

Henry

[Walter Roberson]

In your code, if I starts greater than 0 then it will always be greater than 0 and the else of the first if will never be used. If I starts less than or equal to 0 then that else will be used exactly once.

The exception to the above is if temp starts empty, then I will become empty and the I>0 will not be true, invoking the else the next iteration along.

[Henry Buck]

Hi,

So what is the best way to write it ? Can you try to rewrite it in the best way ?

Thanks for your help, Henry

[Walter Roberson]

You wrote,

for ADDR=2 if(I>0) and temp = [38 25 25 45 35 18 14 27 78 85 54 29 96 35 45 74 36 35 28 41] the minimum of that array is 14 and its location is index=7 (counting from left..) result shuld be: reg = [0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0]

I do not understand why the 45 at position 15 is selected. It is not the second minimum of anything.