prewcovertmatrix.cpp

qrdrls算法

#include "filein.h"
#include "share.h"


int PreWcovertmatrixint(double *in_1,double *in_2,double *in_3,double *in_4,double *in_5,double *in_6,matrix *C,matrix *D)//预加窗的矩阵形式
{
	int i,j;
	complex2 **a,**b;

	a=new complex2 *[M+1];
	for(i=0;i<M+1;i++)
		a[i]=new complex2 [NUMBER1];


	for(j=0;j<M;j++)
	{
	for(i=0;i<j;i++)
	{
		a[j][i]=0;
	}
	for(i=0;i<(NUMBER1-j);i++)
	{
		a[j][i+j]=complex2(in_1[i],in_2[i]);
	}

	}
	for(i=0;i<NUMBER1;i++)
	{
		a[M][i]=complex2(in_3[i],in_4[i]);
	}
  

	b = new complex2 *[M];
	for(i=0;i<M;i++)
		b[i]=new complex2 [NUMBER2];

	for(j=0;j<M;j++)
	{
	for(i=0;i<j;i++)
	{
		b[j][i]=0;
	}
	for(i=0;i<(NUMBER2-j);i++)
	{
		b[j][i+j]=complex2(in_5[i],in_6[i]);
	}

	}


	for(i=0;i<M+1;i++)
			C->set_row(i,a[i]);

	for(i=0;i<M;i++)
			D->set_row(i,b[i]);

	
	for(i=0;i<M+1;i++)
		delete [] a[i];
    delete a;

	for(i=0;i<M;i++)
		delete [] b[i];
    delete b;

	return 1;


}