mirror of https://github.com/saitohirga/WSJT-X.git
39 lines
1.3 KiB
Fortran
39 lines
1.3 KiB
Fortran
! Layland-Lushbaugh polynomials for a K=32, r=1/2 convolutional code,
|
|
! and 8-bit parity lookup table.
|
|
|
|
data npoly1/-221228207/,npoly2/-463389625/
|
|
integer*1 partab(0:255)
|
|
data partab/ &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
0, 1, 1, 0, 1, 0, 0, 1, &
|
|
1, 0, 0, 1, 0, 1, 1, 0/
|