different lcf-A cide

ber of a lcfA coded mimo system mainly depend on the minimal polynomilal of the gaussian integers

here we show that the ber of a mimo system,coded as lcf depend only on the minimal polynomilal of the gaussian integers.

here our min. equation for 2x2 system is x^2+i=0 (where i is complex i)

the two different roots set is a.exp((-1i*pi)/4),exp((-1i*5*pi)/4)
b.exp((1i*3*pi)/4),exp((-1i*3*pi)/4)
so, from the fig. it is clear that ber for both the root set (in lcfA coding scheme ) is more or less equal .

we also show that if we exchange the position of the roots in lcfA,the result is same
(1.lcfA --> (1/sqrt(2))*[1 exp((1i*3*pi)/4);1 exp((-1i*3*pi)/4) ]
2.(1/sqrt(2))*[1 exp((-1i*3*pi)/4);1 exp((1i*3*pi)/4) ] give the same result)

so, ber depend only on the min. poly.