WebSVN – svnkaklik – Diff – /programy/C/ix86/signals/correlation.c


// jednoduchy algoritmus krizove korelace
// copile gcc correlation.c -lm -o correlation
 
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
 
#define SAMPLES  1000
#define SIGNAL_SAMPLES  SAMPLES*20
 
int sample[SAMPLES];
int signal[SIGNAL_SAMPLES];
 
double correlation[SIGNAL_SAMPLES];
 
int obdelnik(int *pole, int delka_pole, int delka_pulsu, int spozdeni) //generuje testovaci lichobeznikovy puls  do zadaneho pole
{
int i;
int value=1;
  for (i=0; i <= delka_pole; i++) { 
    if (i < spozdeni && i < delka_pole) pole[i]=value;
 
    if ((i > spozdeni) && (i < (spozdeni+10))) pole[i] = value++;
 
    if (i < (spozdeni+delka_pulsu+10) && i > (spozdeni+10) && i < delka_pole) pole[i]= value;      
 
    if (i < (spozdeni+delka_pulsu+20) && i > (spozdeni+delka_pulsu+10) && i < delka_pole) pole[i] = value--;      
 
    if (i > (spozdeni+delka_pulsu+20) && i < delka_pole) pole[i]=value;
  }
}
 
int linear_chirp(int *pole, int delka_pole, int delka_pulsu, int spozdeni){  // vygeneruje linearni chirp a vzorky ulozi do pole
 
static const double pi = 3.141592653589793238462643383279502884197; // Archimedes constant pi
static const float f0 = 0.01;
static const float k = 0.0001;
 
int t;
float ble;
  if((spozdeni+delka_pulsu) < delka_pole)
    for(t=0;t < delka_pulsu;t++) pole[spozdeni+t] = round ( 100*sin(2*pi*t*(f0+(k/2)*t)) );
  else return 0;
 
}
 
int exp_chirp(int *pole, int delka_pole, int delka_pulsu, int spozdeni){  // vygeneruje linearni chirp a vzorky ulozi do pole
 
static const double pi = 3.141592653589793238462643383279502884197; // Archimedes constant pi
static const float f0 = 0.01;
static const float k = 0.0001;
 
int t;
float ble;
  if((spozdeni+delka_pulsu) < delka_pole)
    for(t=0;t < delka_pulsu;t++) pole[spozdeni+t] = round ( 100*sin(2*pi*t*(f0+(k/2)*t)) );
  else return 0;
 
}
 
 
int main (void)
{
   int i,n,m,delay;
   double r;
	FILE *out;
 
   linear_chirp(sample,SAMPLES,100,0);			// vyrobi vzorek signalu
   linear_chirp(signal,SIGNAL_SAMPLES,500,1000);			// vyrobi signal ve kterem se vzorek hleda
 
   for(n=0; n < (SIGNAL_SAMPLES - SAMPLES);n++){			//spocita korelaci pro mozna spozdeni
     r=0;
     for(m=0;m < SAMPLES;m++) r += sample[m]*signal[m+n];
     correlation[n]=r;
   }
 
   r=0;
   for(n=0; n < (SIGNAL_SAMPLES - SAMPLES);n++){			//najde nejvetsi shodu (pro nazornost v samostatnem cyklu)
     if (r < correlation[n]){
       delay = n;
       r = correlation[n];
     }
   }
 
 
   out=fopen("output.txt",'w');
   for(i=0;i<SAMPLES;i++)
   {
//     fprintf(stdout,"%3u ",i);	 		// vypise cislo bunky v poli (spozdeni)
     fprintf(stdout,"%2i ",sample[i]);
//     fprintf(stdout,"%2d ",signal[i]);
//     fprintf(out,"%3.2f\n",correlation[i]);		// vypise hodnotu korelace nejvissi cislo je nejvetsi korelace.
   }
   fprintf(stdout,"\nvzorek v signalu zacina na miste: %3u \n",delay);
	fclose(out);
  exit(1);
}

Rev 526	Rev 536
1	`// jednoduchy algoritmus krizove korelace`	1	`// jednoduchy algoritmus krizove korelace`
2	`// copile gcc correlation.c -lm -o correlation`	2	`// copile gcc correlation.c -lm -o correlation`
3		3
4	`#include <stdio.h>`	4	`#include <stdio.h>`
5	`#include <stdlib.h>`	5	`#include <stdlib.h>`
6	`#include <math.h>`	6	`#include <math.h>`
7		7
8	`#define SAMPLES 1000`	8	`#define SAMPLES 1000`
9	`#define SIGNAL_SAMPLES SAMPLES*20`	9	`#define SIGNAL_SAMPLES SAMPLES*20`
10		10
11	`int sample[SAMPLES];`	11	`int sample[SAMPLES];`
12	`int signal[SIGNAL_SAMPLES];`	12	`int signal[SIGNAL_SAMPLES];`
13		13
14	`double correlation[SIGNAL_SAMPLES];`	14	`double correlation[SIGNAL_SAMPLES];`
15		15
16	`int obdelnik(int *pole, int delka_pole, int delka_pulsu, int spozdeni) //generuje testovaci lichobeznikovy puls do zadaneho pole`	16	`int obdelnik(int *pole, int delka_pole, int delka_pulsu, int spozdeni) //generuje testovaci lichobeznikovy puls do zadaneho pole`
17	`{`	17	`{`
18	`int i;`	18	`int i;`
19	`int value=1;`	19	`int value=1;`
20	`for (i=0; i <= delka_pole; i++) {`	20	`for (i=0; i <= delka_pole; i++) {`
21	`if (i < spozdeni && i < delka_pole) pole[i]=value;`	21	`if (i < spozdeni && i < delka_pole) pole[i]=value;`
22		22
23	`if ((i > spozdeni) && (i < (spozdeni+10))) pole[i] = value++;`	23	`if ((i > spozdeni) && (i < (spozdeni+10))) pole[i] = value++;`
24		24
25	`if (i < (spozdeni+delka_pulsu+10) && i > (spozdeni+10) && i < delka_pole) pole[i]= value;`	25	`if (i < (spozdeni+delka_pulsu+10) && i > (spozdeni+10) && i < delka_pole) pole[i]= value;`
26		26
27	`if (i < (spozdeni+delka_pulsu+20) && i > (spozdeni+delka_pulsu+10) && i < delka_pole) pole[i] = value--;`	27	`if (i < (spozdeni+delka_pulsu+20) && i > (spozdeni+delka_pulsu+10) && i < delka_pole) pole[i] = value--;`
28		28
29	`if (i > (spozdeni+delka_pulsu+20) && i < delka_pole) pole[i]=value;`	29	`if (i > (spozdeni+delka_pulsu+20) && i < delka_pole) pole[i]=value;`
30	`}`	30	`}`
31	`}`	31	`}`
32		32
33	`int linear_chirp(int *pole, int delka_pole, int delka_pulsu, int spozdeni){ // vygeneruje linearni chirp a vzorky ulozi do pole`	33	`int linear_chirp(int *pole, int delka_pole, int delka_pulsu, int spozdeni){ // vygeneruje linearni chirp a vzorky ulozi do pole`
34		34
35	`static const double pi = 3.141592653589793238462643383279502884197; // Archimedes constant pi`	35	`static const double pi = 3.141592653589793238462643383279502884197; // Archimedes constant pi`
36	`static const float f0 = 0.01;`	36	`static const float f0 = 0.01;`
37	`static const float k = 0.0001;`	37	`static const float k = 0.0001;`
38		38
39	`int t;`	39	`int t;`
40	`float ble;`	40	`float ble;`
41	`if((spozdeni+delka_pulsu) < delka_pole)`	41	`if((spozdeni+delka_pulsu) < delka_pole)`
42	`for(t=0;t < delka_pulsu;t++) pole[spozdeni+t] = round ( 100sin(2pit(f0+(k/2)*t)) );`	42	`for(t=0;t < delka_pulsu;t++) pole[spozdeni+t] = round ( 100sin(2pit(f0+(k/2)*t)) );`
43	`else return 0;`	43	`else return 0;`
44		44
45	`}`	45	`}`
46		46
47	`int exp_chirp(int *pole, int delka_pole, int delka_pulsu, int spozdeni){ // vygeneruje linearni chirp a vzorky ulozi do pole`	47	`int exp_chirp(int *pole, int delka_pole, int delka_pulsu, int spozdeni){ // vygeneruje linearni chirp a vzorky ulozi do pole`
48		48
49	`static const double pi = 3.141592653589793238462643383279502884197; // Archimedes constant pi`	49	`static const double pi = 3.141592653589793238462643383279502884197; // Archimedes constant pi`
50	`static const float f0 = 0.01;`	50	`static const float f0 = 0.01;`
51	`static const float k = 0.0001;`	51	`static const float k = 0.0001;`
52		52
53	`int t;`	53	`int t;`
54	`float ble;`	54	`float ble;`
55	`if((spozdeni+delka_pulsu) < delka_pole)`	55	`if((spozdeni+delka_pulsu) < delka_pole)`
56	`for(t=0;t < delka_pulsu;t++) pole[spozdeni+t] = round ( 100sin(2pit(f0+(k/2)*t)) );`	56	`for(t=0;t < delka_pulsu;t++) pole[spozdeni+t] = round ( 100sin(2pit(f0+(k/2)*t)) );`
57	`else return 0;`	57	`else return 0;`
58		58
59	`}`	59	`}`
60		60
61		61
62	`int main (void)`	62	`int main (void)`
63	`{`	63	`{`
64	`int i,n,m,delay;`	64	`int i,n,m,delay;`
65	`double r;`	65	`double r;`
-		66	`FILE *out;`
66		67
67	`linear_chirp(sample,SAMPLES,100,0); // vyrobi vzorek signalu`	68	`linear_chirp(sample,SAMPLES,100,0); // vyrobi vzorek signalu`
68	`linear_chirp(signal,SIGNAL_SAMPLES,500,1000); // vyrobi signal ve kterem se vzorek hleda`	69	`linear_chirp(signal,SIGNAL_SAMPLES,500,1000); // vyrobi signal ve kterem se vzorek hleda`
69		70
70	`for(n=0; n < (SIGNAL_SAMPLES - SAMPLES);n++){ //spocita korelaci pro mozna spozdeni`	71	`for(n=0; n < (SIGNAL_SAMPLES - SAMPLES);n++){ //spocita korelaci pro mozna spozdeni`
71	`r=0;`	72	`r=0;`
72	`for(m=0;m < SAMPLES;m++) r += sample[m]*signal[m+n];`	73	`for(m=0;m < SAMPLES;m++) r += sample[m]*signal[m+n];`
73	`correlation[n]=r;`	74	`correlation[n]=r;`
74	`}`	75	`}`
75		76
76	`r=0;`	77	`r=0;`
77	`for(n=0; n < (SIGNAL_SAMPLES - SAMPLES);n++){ //najde nejvetsi shodu (pro nazornost v samostatnem cyklu)`	78	`for(n=0; n < (SIGNAL_SAMPLES - SAMPLES);n++){ //najde nejvetsi shodu (pro nazornost v samostatnem cyklu)`
78	`if (r < correlation[n]){`	79	`if (r < correlation[n]){`
79	`delay = n;`	80	`delay = n;`
80	`r = correlation[n];`	81	`r = correlation[n];`
81	`}`	82	`}`
82	`}`	83	`}`
83		84
84		-
-		85	`out=fopen("output.txt",'w');`
85	`for(i=0;i<SAMPLES;i++)`	86	`for(i=0;i<SAMPLES;i++)`
86	`{`	87	`{`
87	`// fprintf(stdout,"%3u ",i); // vypise cislo bunky v poli (spozdeni)`	88	`// fprintf(stdout,"%3u ",i); // vypise cislo bunky v poli (spozdeni)`
88	`fprintf(stdout,"%2i ",sample[i]);`	89	`fprintf(stdout,"%2i ",sample[i]);`
89	`// fprintf(stdout,"%2d ",signal[i]);`	90	`// fprintf(stdout,"%2d ",signal[i]);`
90	`// fprintf(stdout,"%3.2f\n",correlation[i]); // vypise hodnotu korelace nejvissi cislo je nejvetsi korelace.`	91	`// fprintf(out,"%3.2f\n",correlation[i]); // vypise hodnotu korelace nejvissi cislo je nejvetsi korelace.`
91	`}`	92	`}`
92	`fprintf(stdout,"\nvzorek v signalu zacina na miste: %3u \n",delay);`	93	`fprintf(stdout,"\nvzorek v signalu zacina na miste: %3u \n",delay);`
93		94	`fclose(out);`
94	`exit(1);`	95	`exit(1);`
95	`}`	96	`}`

Subversion Repositories svnkaklik

(root)/programy/C/ix86/signals/correlation.c @ 895 – Rev 526 → 536