Diplomska naloga (.pdf)
Diplomska naloga (.pdf)
Diplomska naloga (.pdf)
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
51<br />
M=repmat(eye(2), [1, 1, int]);<br />
alpha=zeros(int,st_plasti);<br />
calpha=zeros(int,st_plasti);<br />
salpha=zeros(int,st_plasti);<br />
for j=1:st_plasti<br />
alpha(:,j)=(2*pi*interval.*(mi(:,P(1,j,k))*E(P(1,j,k))).^0.5.*(P(2,j,k)))/3e8;<br />
calpha(:,j)=cos(alpha(:,j));<br />
salpha(:,j)=sin(alpha(:,j));<br />
for n=1:int<br />
N=M(:,:,n);<br />
M(:,:,n)=N*[calpha(n,j) -i*(mi(n,P(1,j,k))/E(P(1,j,k))).^0.5.*salpha(n,j);<br />
-i*salpha(n,j)./(mi(n,P(1,j,k))/E(P(1,j,k))).^0.5 calpha(n,j)];<br />
end<br />
end<br />
q=0;<br />
for n=1:int<br />
R(n)=(-M(1,2,n)-M(2,2,n))/(-M(1,2,n)+M(2,2,n));<br />
R(n)=20*log10(abs(R(n)));<br />
%Preverimo, ali za vsako vrednost iz intervala ustreza dopustnemu pogoju.<br />
if R(n)>pogoj<br />
q=1;<br />
end<br />
end<br />
%Če optimiziramo po debelini absorberja.<br />
if opt==0<br />
if q==1<br />
%Označimo nedopustno rešitev.<br />
f(k)=1;<br />
else<br />
%Vrnemo debelino absorberja.<br />
f(k)=sum(P(2,:,k));<br />
end<br />
%Če optimiziramo po širini frekvenčnega pasu absorberja.<br />
elseif opt==1<br />
clear y<br />
clear z<br />
if R(int1)>=pogoj<br />
f(k)=0; %Označimo nedopustni osebek.<br />
else<br />
y=int1+1;<br />
while y