[daip] CLCOR - update
Craig Walker
cwalker at nrao.edu
Tue Oct 14 15:28:40 EDT 2014
I reverted to OPTYPE='GAIN' and used the square root of the CLCORPRM(1)
from my last message. I got the same error.
>default clcor
> inn='bw102_OQ208'; incl='multi'; ins=2; ind=3
> gainver=3; gainus=4; opcode='gain'; clcorprm=sqrt(1/0.978),0
>go clcor
CLCOR1: Task CLCOR (release of 31DEC14) begins
CLCOR1: Copied CL file from vol/cno/vers 3 166 3 to 3 166 4
CLCOR1: CL version input 3 output 4
forrtl: severe (66): output statement overflows record, unit -5, file
Internal Formatted Write
AIPS 1: Resumes
>
>inp clcor
AIPS 1: CLCOR Task which applies various corrections to CL tables.
AIPS 1: Adverbs Values Comments
AIPS 1: ----------------------------------------------------------------
AIPS 1: INNAME 'BW102_OQ208' Input UV file name (name)
AIPS 1: INCLASS 'MULTI' Input UV file name (class)
AIPS 1: INSEQ 2 Input UV file name (seq. #)
AIPS 1: INDISK 3 Input UV file disk unit #
AIPS 1: SOURCES *all ' ' Source list ' '=>all.
AIPS 1: STOKES ' ' Stokes type to process
AIPS 1: SELBAND -1 Bandwidth to select (kHz)
AIPS 1: SELFREQ -1 Frequency to select (MHz)
AIPS 1: FREQID -1 Freq. ID to select
AIPS 1: BIF 0 Lowest IF number 0=>all
AIPS 1: EIF 0 Highest IF number 0=>all
AIPS 1: TIMERANG *all 0 Time range to use.
AIPS 1: ANTENNAS *all 0 Antennas to correct.
AIPS 1: SUBARRAY 0 Subarray; 0 => 1.
AIPS 1: GAINVER 3 Input CL table 0=>high
AIPS 1: GAINUSE 4 Output CL table: not =
AIPS 1: GAINVER -> high+1
AIPS 1: OPCODE 'GAIN' Operation code.
AIPS 1: many -> see HELP!
AIPS 1: CLCORPRM 1.0112 *rest 0 Parameters (see HELP CLCOR).
AIPS 1: BADDISK *all 0 Disks to avoid for scratch
AIPS 1: INFILE *all ' ' OPCODE = 'ANTP' or 'ANTC':
AIPS 1: list of times and relevant
Cheers,
Craig
--
---------------------------------------------------------------------
R. Craig Walker Array Operations Center
cwalker at nrao.edu National Radio Astronomy Observatory
Phone 575 835 7247 P. O. Box O
Fax 575 835 7027 Socorro NM 87801 USA
---------------------------------------------------------------------
More information about the Daip
mailing list