SVN r8748
This commit is contained in:
@@ -0,0 +1,165 @@
|
||||
program fox_sim
|
||||
|
||||
! Simulates QSO exchanges using the proposed FT8 "DXpedition" mode.
|
||||
parameter (MAXSIG=5,NCALLS=268)
|
||||
character*6 xcall(NCALLS)
|
||||
character*4 xgrid(NCALLS)
|
||||
integer isnr(NCALLS)
|
||||
|
||||
character*32 fmsg(MAXSIG),fm
|
||||
character*22 hmsg(MAXSIG),hm
|
||||
character*16 log
|
||||
character*6 called(MAXSIG)
|
||||
character*4 gcalled(MAXSIG)
|
||||
character*6 MyCall
|
||||
character*4 MyGrid
|
||||
character*8 arg
|
||||
character*1 c1,c2,c3,c4
|
||||
integer ntot(MAXSIG),irate(MAXSIG),ntimes(MAXSIG)
|
||||
logical logit
|
||||
common/dxpfifo/nc,isnr,xcall,xgrid
|
||||
|
||||
nargs=iargc()
|
||||
if(nargs.ne.2 .and. nargs.ne.4) then
|
||||
print*,'Usage: fox_sim nseq maxtimes'
|
||||
print*,' fox_sim nseq maxtimes nsig fail'
|
||||
print*,' '
|
||||
print*,' nseq: number of T/R sequences to execute'
|
||||
print*,' maxtimes: number of repeats of same Tx message'
|
||||
print*,' nsig: number of simultaneous Tx sigals'
|
||||
print*,' fail: receiving error rate'
|
||||
go to 999
|
||||
endif
|
||||
ii1=1
|
||||
ii2=5
|
||||
jj1=0
|
||||
jj2=5
|
||||
nseq=80
|
||||
if(nargs.ge.2) then
|
||||
call getarg(1,arg)
|
||||
read(arg,*) nseq
|
||||
call getarg(2,arg)
|
||||
read(arg,*) maxtimes
|
||||
endif
|
||||
if(nargs.eq.4) then
|
||||
call getarg(3,arg)
|
||||
read(arg,*) nsig
|
||||
call getarg(4,arg)
|
||||
read(arg,*) fail
|
||||
ii1=nsig
|
||||
ii2=nsig
|
||||
jj1=nint(10*fail)
|
||||
jj2=nint(10*fail)
|
||||
endif
|
||||
|
||||
! Read a file with calls and grids; insert random S/N values.
|
||||
! This is used in place of an operator-selected FIFO
|
||||
open(10,file='xcall.txt',status='old')
|
||||
do i=1,NCALLS
|
||||
read(10,1000) xcall(i),xgrid(i)
|
||||
1000 format(a6,7x,a4)
|
||||
if(i.ne.-99) cycle
|
||||
j=mod(i-1,26)
|
||||
c1=char(ichar('A')+j)
|
||||
k=mod((i-1)/26,26)
|
||||
c2=char(ichar('A')+k)
|
||||
n=mod((i-1)/260,10)
|
||||
c3=char(ichar('0')+n)
|
||||
xcall(i)='K'//c2//c3//c1//c1//c1
|
||||
|
||||
j=mod(i-1,18)
|
||||
c1=char(ichar('A')+j)
|
||||
k=mod((i-1)/18,18)
|
||||
c2=char(ichar('A')+k)
|
||||
n=mod((i-1)/10,10)
|
||||
c4=char(ichar('0')+n)
|
||||
n=mod((i-1)/100,10)
|
||||
c3=char(ichar('0')+n)
|
||||
xgrid(i)=c1//c2//c3//c4
|
||||
|
||||
call random_number(x)
|
||||
isnr(i)=-20+int(40*x)
|
||||
enddo
|
||||
! close(10)
|
||||
|
||||
! Write headings for the summary file
|
||||
minutes=nseq/4
|
||||
write(13,1002) nseq,minutes,maxtimes
|
||||
1002 format(/'Nseq:',i4,' Minutes:',i3,' Maxtimes:',i2// &
|
||||
18x,'Logged QSOs',22x,'Rate (QSOs/hour)'/ &
|
||||
'fail Nsig: 1 2 3 4 5 1 2 3 4 5'/ &
|
||||
71('-'))
|
||||
|
||||
write(*,1003)
|
||||
1003 format('Seq s n Fox messages Hound messages Logged info i Rate'/87('-'))
|
||||
|
||||
ntot=0
|
||||
irate=0
|
||||
MyCall='KH1DX'
|
||||
MyGrid='AJ10'
|
||||
|
||||
do jj=jj1,jj2 !Loop over Rx failure rates
|
||||
fail=0.1*jj
|
||||
do ii=ii1,ii2 !Loop over range of nsig
|
||||
nc=0 !Set FIFO pointer to top
|
||||
ntimes=1
|
||||
nsig=ii
|
||||
nlogged=0
|
||||
fmsg="CQ KH1DX AJ10"
|
||||
hmsg=""
|
||||
called=" "
|
||||
do iseq=0,nseq !Loop over specified number of sequences
|
||||
if(iand(iseq,1).eq.0) then
|
||||
do j=1,nsig !Loop over Fox's Tx slots
|
||||
fm=fmsg(j)
|
||||
hm=hmsg(j)
|
||||
|
||||
! Call fox_tx to determine the next Tx message for this slot
|
||||
call fox_tx(maxtimes,fail,called(j),gcalled(j),hm,fm, &
|
||||
ntimes(j),log,logit)
|
||||
|
||||
fmsg(j)=fm
|
||||
if(logit) then
|
||||
! Log this QSO
|
||||
nlogged=nlogged+1
|
||||
nrate=0
|
||||
if(iseq.gt.0) nrate=nint(nlogged*240.0/iseq)
|
||||
write(*,1010) iseq,j,ntimes(j),fmsg(j),log,nlogged,nrate
|
||||
1010 format(i4.4,2i2,1x,a32,20x,a16,2i4)
|
||||
! call log_routine()
|
||||
else
|
||||
write(*,1010) iseq,j,ntimes(j),fmsg(j)
|
||||
endif
|
||||
enddo
|
||||
! call transmit()
|
||||
endif
|
||||
|
||||
if(iand(iseq,1).eq.1) then
|
||||
do j=1,nsig !Listen for expected responses
|
||||
fm=fmsg(j)
|
||||
call fox_rx(fail,called(j),fm,hm)
|
||||
if(j.ge.2) then
|
||||
if(hm.eq.hmsg(j-1)) hm=""
|
||||
endif
|
||||
hmsg(j)=hm
|
||||
write(*,1020) iseq,j,hmsg(j)
|
||||
1020 format(i4.4,i2,37x,a22)
|
||||
enddo
|
||||
endif
|
||||
write(*,1021)
|
||||
1021 format(87('-'))
|
||||
enddo
|
||||
ntot(ii)=nlogged
|
||||
irate(ii)=0
|
||||
if(iseq.gt.0) irate(ii)=nint(nlogged*3600.0/(15*iseq))
|
||||
write(*,1030) nsig,fail,nlogged,nc
|
||||
1030 format(/'Nsig:',i3,' Fail:',f4.1,' Logged QSOs:',i4, &
|
||||
' Final nc:',i4)
|
||||
enddo
|
||||
|
||||
! Write the summary file
|
||||
write(13,1100) fail,ntot,irate
|
||||
1100 format(f4.1,2x,5i6,5x,5i6)
|
||||
enddo
|
||||
|
||||
999 end program fox_sim
|
||||
@@ -1,195 +0,0 @@
|
||||
/* ENCODE.C - Encode message blocks. */
|
||||
|
||||
/* Copyright (c) 1995-2012 by Radford M. Neal.
|
||||
*
|
||||
* Permission is granted for anyone to copy, use, modify, and distribute
|
||||
* these programs and accompanying documents for any purpose, provided
|
||||
* this copyright notice is retained and prominently displayed, and note
|
||||
* is made of any changes made to these programs. These programs and
|
||||
* documents are distributed without any warranty, express or implied.
|
||||
* As the programs were written for research purposes only, they have not
|
||||
* been tested to the degree that would be advisable in any important
|
||||
* application. All use of these programs is entirely at the user's own
|
||||
* risk.
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <math.h>
|
||||
|
||||
#include "rand.h"
|
||||
#include "alloc.h"
|
||||
#include "blockio.h"
|
||||
#include "open.h"
|
||||
#include "mod2sparse.h"
|
||||
#include "mod2dense.h"
|
||||
#include "mod2convert.h"
|
||||
#include "rcode.h"
|
||||
#include "enc.h"
|
||||
|
||||
void usage(void);
|
||||
|
||||
|
||||
/* MAIN PROGRAM. */
|
||||
|
||||
int main
|
||||
( int argc,
|
||||
char **argv
|
||||
)
|
||||
{
|
||||
char *source_file, *encoded_file;
|
||||
char *pchk_file, *gen_file;
|
||||
mod2dense *u, *v;
|
||||
|
||||
FILE *srcf, *encf;
|
||||
char *sblk, *cblk, *chks;
|
||||
int i, n;
|
||||
|
||||
/* Look at initial flag arguments. */
|
||||
|
||||
blockio_flush = 0;
|
||||
|
||||
while (argc>1)
|
||||
{
|
||||
if (strcmp(argv[1],"-f")==0)
|
||||
{ if (blockio_flush!=0) usage();
|
||||
blockio_flush = 1;
|
||||
}
|
||||
else
|
||||
{ break;
|
||||
}
|
||||
|
||||
argc -= 1;
|
||||
argv += 1;
|
||||
}
|
||||
|
||||
/* Look at remaining arguments. */
|
||||
|
||||
if (!(pchk_file = argv[1])
|
||||
|| !(gen_file = argv[2])
|
||||
|| !(source_file = argv[3])
|
||||
|| !(encoded_file = argv[4])
|
||||
|| argv[5])
|
||||
{ usage();
|
||||
}
|
||||
|
||||
if ((strcmp(pchk_file,"-")==0)
|
||||
+ (strcmp(gen_file,"-")==0)
|
||||
+ (strcmp(source_file,"-")==0) > 1)
|
||||
{ fprintf(stderr,"Can't read more than one stream from standard input\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
/* Read parity check file */
|
||||
|
||||
read_pchk(pchk_file);
|
||||
|
||||
if (N<=M)
|
||||
{ fprintf(stderr,
|
||||
"Can't encode if number of bits (%d) not greater than number of checks (%d)\n",
|
||||
N,M);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
/* Read generator matrix file. */
|
||||
|
||||
read_gen(gen_file,0,0);
|
||||
|
||||
/* Allocate needed space. */
|
||||
|
||||
if (type=='d')
|
||||
{ u = mod2dense_allocate(N-M,1);
|
||||
v = mod2dense_allocate(M,1);
|
||||
}
|
||||
|
||||
if (type=='m')
|
||||
{ u = mod2dense_allocate(M,1);
|
||||
v = mod2dense_allocate(M,1);
|
||||
}
|
||||
|
||||
/* Open source file. */
|
||||
|
||||
srcf = open_file_std(source_file,"r");
|
||||
if (srcf==NULL)
|
||||
{ fprintf(stderr,"Can't open source file: %s\n",source_file);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
/* Create encoded output file. */
|
||||
|
||||
encf = open_file_std(encoded_file,"w");
|
||||
if (encf==NULL)
|
||||
{ fprintf(stderr,"Can't create file for encoded data: %s\n",encoded_file);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
sblk = chk_alloc (N-M, sizeof *sblk);
|
||||
cblk = chk_alloc (N, sizeof *cblk);
|
||||
chks = chk_alloc (M, sizeof *chks);
|
||||
|
||||
/* Encode successive blocks. */
|
||||
|
||||
for (n = 0; ; n++)
|
||||
{
|
||||
/* Read block from source file. */
|
||||
|
||||
if (blockio_read(srcf,sblk,N-M)==EOF)
|
||||
{ break;
|
||||
}
|
||||
|
||||
/* Compute encoded block. */
|
||||
|
||||
switch (type)
|
||||
{ case 's':
|
||||
{ sparse_encode (sblk, cblk);
|
||||
break;
|
||||
}
|
||||
case 'd':
|
||||
{ dense_encode (sblk, cblk, u, v);
|
||||
break;
|
||||
}
|
||||
case 'm':
|
||||
{ mixed_encode (sblk, cblk, u, v);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
/* Check that encoded block is a code word. */
|
||||
|
||||
mod2sparse_mulvec (H, cblk, chks);
|
||||
|
||||
for (i = 0; i<M; i++)
|
||||
{ if (chks[i]==1)
|
||||
{ fprintf(stderr,"Output block %d is not a code word! (Fails check %d)\n",n,i);
|
||||
abort();
|
||||
}
|
||||
}
|
||||
|
||||
/* Write encoded block to encoded output file. */
|
||||
|
||||
blockio_write(encf,cblk,N);
|
||||
if (ferror(encf))
|
||||
{ break;
|
||||
}
|
||||
}
|
||||
|
||||
// fprintf(stderr,
|
||||
// "Encoded %d blocks, source block size %d, encoded block size %d\n",n,N-M,N);
|
||||
|
||||
if (ferror(encf) || fclose(encf)!=0)
|
||||
{ fprintf(stderr,"Error writing encoded blocks to %s\n",encoded_file);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
/* PRINT USAGE MESSAGE AND EXIT. */
|
||||
|
||||
void usage(void)
|
||||
{ fprintf(stderr,
|
||||
"Usage: encode [ -f ] pchk-file gen-file source-file encoded-file\n");
|
||||
exit(1);
|
||||
}
|
||||
Binary file not shown.
|
After Width: | Height: | Size: 16 KiB |
Reference in New Issue
Block a user