3-labaratoriya ishi 17-variant o`lmasov Nurbek Raqamli axborotlarni qayta ishlashda Fure usuli va dinamik dasturlash yo‘li

3-labaratoriya ishi 17-VARIANT O`lmasov Nurbek

Raqamli axborotlarni qayta ishlashda Fure usuli va dinamik dasturlash yo‘li

1-vazifa
Jadval ko’rinishida berilgan funksiyalarni Furye qatori asosida raqamli signallar yetakchi garmonikalarini aniqlash usuli bilan analitik ko’rinishda ifodalang. Algoritmini tuzib, dasturlash tilida dastur kodini yozing va natija oling.
1-vazifaga doir variantlar:

#include
#include
using namespace std;
int main(){
double t1=0, t[21] , y_m[21 ], a[10] , b[10] , c[10] , T , sum_f=0 , h , v;
double f[21]={4.46136, 3.426047, -5.89431, -10.9078, -4.59839, 4.769931, 5.028706, 3.15564, -7.30293, -0.4801, 9.000391, 8.958288, 0.087231, -5.06597, 0.532104, 8.69061, 7.35787, -2.54838, -8.67078, 3.58895, 4.458518};
cout<<"t va unga mos f ni kiriting";
for(int i=0 ; i<21 ; i++ ){
t[i]=t1;
t1+=0.000005;
}
T = t[20];
h = T / 20;
cout<for(int i=1 ; i<20 ; i++)
sum_f+=f[i];
a[0] = 2 * ( ( f[0] + f[20] ) / 2 + sum_f ) * h / T;
b[0] = 0;
for(int k=1 ; k<11 ; k++){
a[k] = f[0]*sin(k*M_PI*h/T) - f[20]*sin(2*k*M_PI*(T-(h/2))/T);
for(int i=1 ; i<20 ; i++)
{
v=i*h;
a[k] += f[i]*( sin(2*M_PI*k*(v+(h/2))/T)-sin(2*M_PI*k*(v-(h/2))/T) );
}
a[k]/=(M_PI*k);
cout<<"a"<}
cout<for(int k=1 ; k<11 ; k++){
b[k] = f[0]* (cos(k*M_PI*h/T) -1) + f[20]*( 1-cos(2*k*M_PI*(T-(h/2))/T) );
for(int i=1 ; i<20 ; i++)
{
v=i*h;
b[k] += f[i]*( cos(2*M_PI*k*(v+(h/2))/T)-cos(2*M_PI*k*(v-(h/2))/T) );
}
b[k]/=(-1*M_PI*k);
cout<<"b"<}
c[0]=0;
cout<<" \n\n";
for(int i=1;i<11;i++){
c[i]=sqrt(a[i]*a[i]+b[i]*b[i]);
cout<<"c"<}
// c1 -> max;
double fi = atan(a[1]/b[1]);
cout<<"\n\n model qiymatlar va ularning xatoliklari : "<for(int i=0 ; i<21 ; i++){
v=h*i;
y_m[i]=c[1]*sin(2*M_PI*v/T + fi );
cout<<"y"<}
}


2-vazifa
Dinamlik dasturlash masala. Fibonachi sonlari misolida. Har bir talaba quyidagi dastur kodlaridan foydalanib dinamik dasturlashni o’rganishi va ishlatib natijani olishi kerak.