forked from radfordneal/LDPC-codes
-
Notifications
You must be signed in to change notification settings - Fork 0
/
print-gen.c
139 lines (115 loc) · 3.04 KB
/
print-gen.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
/* PRINT-CODE.C - Print a Low Density Parity Check code's matrices. */
/* 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 "open.h"
#include "mod2sparse.h"
#include "mod2dense.h"
#include "mod2convert.h"
#include "rcode.h"
void usage(void);
/* MAIN PROGRAM. */
int main
( int argc,
char **argv
)
{
char *gen_file;
int dprint;
int i, j;
dprint = 0;
if (argc>1 && strcmp(argv[1],"-d")==0)
{ dprint = 1;
argc -= 1;
argv += 1;
}
if (!(gen_file = argv[1]) || argv[2])
{ usage();
}
read_gen(gen_file,0,1);
switch (type)
{
case 's':
{
printf("\nGenerator matrix in %s (sparse representation):\n\n",gen_file);
printf("Column order (message bits at end):\n");
for (j = 0; j<N; j++)
{ if (j%20==0) printf("\n");
printf(" %3d",cols[j]);
}
printf("\n\n");
printf("Row order:\n");
for (i = 0; i<M; i++)
{ if (i%20==0) printf("\n");
printf(" %3d",rows[i]);
}
printf("\n\n");
if (dprint)
{ mod2dense *Ld, *Ud;
Ld = mod2dense_allocate(M,M);
Ud = mod2dense_allocate(M,N);
mod2sparse_to_dense(L,Ld);
mod2sparse_to_dense(U,Ud);
printf("L:\n\n");
mod2dense_print(stdout,Ld);
printf("\n");
printf("U:\n\n");
mod2dense_print(stdout,Ud);
printf("\n");
}
else
{ printf("L:\n\n");
mod2sparse_print(stdout,L);
printf("\n");
printf("U:\n\n");
mod2sparse_print(stdout,U);
printf("\n");
}
break;
}
case 'd': case 'm':
{
if (type=='d')
{ printf("\nGenerator matrix in %s (dense representation):\n\n",gen_file);
}
if (type=='m')
{ printf("\nGenerator matrix in %s (mixed representation):\n\n",gen_file);
}
printf("Column order (message bits at end):\n");
for (j = 0; j<N; j++)
{ if (j%20==0) printf("\n");
printf(" %3d",cols[j]);
}
printf("\n\n");
printf (type=='d' ? "Inv(A) X B:\n\n" : "Inv(A):\n\n");
mod2dense_print(stdout,G);
printf("\n");
break;
}
default:
{ fprintf(stderr,"Unknown type of generator matrix file\n");
exit(1);
}
}
return 0;
}
/* PRINT USAGE MESSAGE AND EXIT. */
void usage(void)
{ fprintf(stderr,"Usage: print-gen [ -d ] gen-file\n");
exit(1);
}