⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 main.cpp

📁 使用Visual C++生成Frank,cubic,chu序列
💻 CPP
字号:
#include "Gold.cpp"
#include <stdio.h>
#include <iostream>

void main()
{
  int i,j,p,m,mSeqLength,sequence[100000];
  int length;
  int num1,num2,num3;
  int q;

  //complex<double> complex1;
  
  FILE *fp;
  char filename[10];
 

 cout<<"Please input the prime polynomial degree:";
 cin>>q;
 if (q%2==0)//less than or equal to 30
	{
 cout<<"Error!Please input the prime polynomial degree:";
 cin>>q;
	}
 cout<<"Please input ACF num:";
 cin>>num1;
 cout<<"Please input CCF num1:";
 cin>>num2;
 cout<<"Please input CCF num2:";
 cin>>num3;
 cout<<"please input the filename that we can write data on:\n";
 scanf("%s",filename);

 if ((fp=fopen(filename,"w"))==NULL)
 {
  printf("cannot open file\n");
  exit(0);
 } 
 length = 1;
 for (i=1;i<=q;i++)
 {
	length=length*2;
 }
 length=length-1;
 long lNumber;
 lNumber=(int)pow((float)2,q)+1;

 Gold(q,sequence,length,lNumber);
 long SeqPhase;  
 SeqPhase = 2;


 float fPacf[1000];
 float fPccf[1000];
	//for(i=0;i<length;i++)
	//{
	//	fPacf[i] = i;
	//   fprintf(fp,"%5f",fPacf[i]);
	//}
 ACF(num1,length,lNumber,sequence, SeqPhase,fPacf);
 CCF(num2,num3,length,lNumber,sequence, SeqPhase,fPccf);
 fprintf(fp,"Length=%d,the Gold sequence as following:\n",length);

 for (i=0;i<length*lNumber;i++)
 {
	   fprintf(fp,"%3d",sequence[i]);
	 if ((i+1) %length == 0)
	 {
	 fprintf(fp,"\n");
	 }
 }


 fprintf(fp,"\n");
 fprintf(fp,"Periodic ACF of No.%d code is:\n",num1);
 for (i=0;i<length;i++)
	   fprintf(fp,"%10f",fPacf[i]);
 fprintf(fp,"\n");
 fprintf(fp,"Periodic CCF of No.%d and No.%d code is:\n",num2,num3);
 for (i=0;i<length;i++)
	   fprintf(fp,"%10f",fPccf[i]);
 fclose(fp);
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -