File: line_model.c

package info (click to toggle)
spandsp 0.0.2pre10-3
  • links: PTS
  • area: main
  • in suites: sarge
  • size: 9,492 kB
  • ctags: 3,331
  • sloc: ansic: 59,323; sh: 8,269; xml: 7,334; cpp: 492; makefile: 369
file content (263 lines) | stat: -rwxr-xr-x 6,952 bytes parent folder | download
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
/*
 * SpanDSP - a series of DSP components for telephony
 *
 * line_model.c - Model a telephone line.
 *
 * Written by Steve Underwood <steveu@coppice.org>
 *
 * Copyright (C) 2004 Steve Underwood
 *
 * All rights reserved.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * $Id: line_model.c,v 1.3 2005/01/16 08:26:55 steveu Exp $
 */

#include <stdlib.h>
#include <unistd.h>
#include <stdint.h>
#include <string.h>
#include <time.h>
#include <stdio.h>
#include <fcntl.h>
#include <audiofile.h>
#include <tiffio.h>

#define GEN_CONST
#include <math.h>

#include "spandsp.h"
#include "spandsp/g168models.h"

#include "line_model.h"
#include "line_models.h"

#if !defined(NULL)
#define NULL (void *) 0
#endif

static float *models[] =
{
    proakis_line_model,
    ad_1_edd_1_model,
    ad_1_edd_2_model,
    ad_1_edd_3_model,
    ad_5_edd_1_model,
    ad_5_edd_2_model,
    ad_5_edd_3_model,
    ad_6_edd_1_model,
    ad_6_edd_2_model,
    ad_6_edd_3_model,
    ad_7_edd_1_model,
    ad_7_edd_2_model,
    ad_7_edd_3_model,
    ad_8_edd_1_model,
    ad_8_edd_2_model,
    ad_8_edd_3_model,
    ad_9_edd_1_model,
    ad_9_edd_2_model,
    ad_9_edd_3_model
};

static float calc_line_filter(one_way_line_model_state_t *s, float v)
{
    float sum;
    float noise;
    int j;
    int p;

    /* Add the sample in the filter buffer */
    p = s->buf_ptr;
    s->buf[p] = v;
    if (++p == s->line_filter_len)
        p = 0;
    s->buf_ptr = p;
    
    /* Apply the filter */
    sum = 0;
    for (j = 0;  j < s->line_filter_len;  j++)
    {
        sum += s->line_filter[j]*s->buf[p];
        if (++p == s->line_filter_len)
            p = 0;
    }
    
    /* Add noise */
    noise = awgn(&s->noise);
    sum += noise;
    
    return sum;
}
/*- End of function --------------------------------------------------------*/

void one_way_line_model(one_way_line_model_state_t *s, 
                        int16_t *output,
                        const int16_t *input,
                        int samples)
{
    int i;
    float in;
    float out;

    /* The path being modelled is:
        modem
          | < hybrid
          |
          | < noise and filtering
          |
          | < hybrid
         CO
          |
          | < A-law distortion
          |
         CO
          | < hybrid
          |
          | < noise and filtering
          |
          | < hybrid
        modem
     */
    for (i = 0;  i < samples;  i++)
    {
        in = input[i];

        /* Line model filters & noise */
        //out = calc_line_filter(s, in);
        out = in;

        /* Introduce distortion due to A-law munging. The effects
           of u-law should be very similar, so a separate test for
           this is not needed. */
        output[i] = alaw_to_linear(linear_to_alaw(out));
    }
}
/*- End of function --------------------------------------------------------*/

void both_ways_line_model(both_ways_line_model_state_t *s, 
                          int16_t *output1,
                          const int16_t *input1,
                          int16_t *output2,
                          const int16_t *input2,
                          int samples)
{
    int i;
    float in1;
    float in2;
    float out1;
    float out2;
    float tmp1;
    float tmp2;

    /* The path being modelled is:
        modem
          | < hybrid
          |
          | < noise and filtering
          |
          | < hybrid
         CO
          |
          | < A-law distortion
          |
         CO
          | < hybrid
          |
          | < noise and filtering
          |
          | < hybrid
        modem
     */
    for (i = 0;  i < samples;  i++)
    {
        in1 = input1[i];
        in2 = input2[i];

        /* Echo from each modem's CO hybrid */
        tmp1 = in1 + s->fout2*s->line1.co_hybrid_echo;
        tmp2 = in2 + s->fout1*s->line2.co_hybrid_echo;

        /* Line model filters & noise */
        s->fout1 = calc_line_filter(&s->line1, tmp1);
        s->fout2 = calc_line_filter(&s->line2, tmp2);

        /* Introduce distortion due to A-law munging. The effects
           of u-law should be very similar, so a separate test for
           this is not needed. */
        s->fout1 = alaw_to_linear(linear_to_alaw(s->fout1));
        s->fout2 = alaw_to_linear(linear_to_alaw(s->fout2));

        /* Echo from each modem's own hybrid */
        out1 = s->fout1 + in2*s->line1.cpe_hybrid_echo;
        out2 = s->fout2 + in1*s->line2.cpe_hybrid_echo;

        output1[i] = fsaturate(out1);
        output2[i] = fsaturate(out2);
    }
}
/*- End of function --------------------------------------------------------*/

one_way_line_model_state_t *one_way_line_model_init(int model, int noise)
{
    float p;
    int i;
    one_way_line_model_state_t *s;

    if ((s = (one_way_line_model_state_t *) malloc(sizeof(*s))) == NULL)
        return NULL;
    memset(s, 0, sizeof(*s));

    s->line_filter = models[model];
    s->line_filter_len = 129;

    awgn_init(&s->noise, 1234567, noise);
    return s;
}
/*- End of function --------------------------------------------------------*/

both_ways_line_model_state_t *both_ways_line_model_init(int model1,
                                                        int noise1,
                                                        int model2,
                                                        int noise2)
{
    float p;
    float echo_level;
    int i;
    both_ways_line_model_state_t *s;

    if ((s = (both_ways_line_model_state_t *) malloc(sizeof(*s))) == NULL)
        return NULL;
    memset(s, 0, sizeof(*s));

    s->line1.line_filter = models[model1];
    s->line1.line_filter_len = 129;
    s->line2.line_filter = models[model2];
    s->line2.line_filter_len = 129;

    awgn_init(&s->line1.noise, 1234567, noise1);
    awgn_init(&s->line2.noise, 1234567, noise2);

    /* Echos */
    echo_level = -15; /* in dB */
    s->line1.co_hybrid_echo = pow(10, echo_level/20.0);
    s->line2.co_hybrid_echo = pow(10, echo_level/20.0);
    s->line1.cpe_hybrid_echo = pow(10, echo_level/20.0);
    s->line2.cpe_hybrid_echo = pow(10, echo_level/20.0);
    
    return s;
}
/*- End of function --------------------------------------------------------*/
/*- End of file ------------------------------------------------------------*/