A1 and A2 are two arrays of integers with the same dimensions 6000x2000.
I want to find a third matrix B by following these steps:
for i=1:1:6000
    for j=1:2000
        a1 = fliplr(dec2binvec(A1(i,j),14));  % Convert A1(i,j) to a binary vector
        a2 = fliplr(dec2binvec(A2(i,j),32));  % Convert A2(i,j) to a binary vector
        b = [a1 a2];
        B(i,j) = sum(b.*2.^(numel(b)-1:-1:0));  % Convert b to decimal
    end
end
my problem is the computation time to find B.
Is there a way to avoid loops in order to reduce the computation time ?
Example:
A1 = [2 3           A2 = [7 6
      4 5]                2 9]
A1(1,1) = 2 and A2(1,1) = 7
a1 = [0 0 0 1 0] (eg 5 bits)   a2 = [0 0 0 1 1 1] (eg 6 bits)
b = [a1 a2] = [0 0 0 1 0 0 0 0 1 1 1]
B1(1,1) = sum(b.*2.^(numel(b)-1:-1:0)) = 135
 
     
     
    