different lcf-A cide
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.
Cite As
bedadadipta (2024). different lcf-A cide (https://www.mathworks.com/matlabcentral/fileexchange/36465-different-lcf-a-cide), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |