4 * Copyright by Andreas Eversberg (jolly@eversberg.eu)
5 * based on different decoders such as ISDN4Linux
7 * This software may be used and distributed according to the terms
8 * of the GNU General Public License, incorporated herein by reference.
12 #include <linux/mISDNif.h>
13 #include <linux/mISDNdsp.h>
17 #define NCOEFF 8 /* number of frequencies to be analyzed */
19 /* For DTMF recognition:
20 * 2 * cos(2 * PI * k / N) precalculated for all k
22 static u64 cos2pik
[NCOEFF
] =
24 /* k << 15 (source: hfc-4s/8s documentation (www.colognechip.de)) */
25 55960, 53912, 51402, 48438, 38146, 32650, 26170, 18630
29 static char dtmf_matrix
[4][4] =
37 /* dtmf detection using goertzel algorithm
40 void dsp_dtmf_goertzel_init(struct dsp
*dsp
)
43 dsp
->dtmf
.lastwhat
= '\0';
44 dsp
->dtmf
.lastdigit
= '\0';
48 /* check for hardware or software features
50 void dsp_dtmf_hardware(struct dsp
*dsp
)
54 if (!dsp
->features
.hfc_dtmf
)
57 /* check for volume change */
59 if (dsp_debug
& DEBUG_DSP_DTMF
)
60 printk(KERN_DEBUG
"%s dsp %s cannot do hardware DTMF, "
61 "because tx_volume is changed\n",
66 if (dsp_debug
& DEBUG_DSP_DTMF
)
67 printk(KERN_DEBUG
"%s dsp %s cannot do hardware DTMF, "
68 "because rx_volume is changed\n",
72 /* check if encryption is enabled */
74 if (dsp_debug
& DEBUG_DSP_DTMF
)
75 printk(KERN_DEBUG
"%s dsp %s cannot do hardware DTMF, "
76 "because encryption is enabled\n",
80 /* check if pipeline exists */
81 if (dsp
->pipeline
.inuse
) {
82 if (dsp_debug
& DEBUG_DSP_DTMF
)
83 printk(KERN_DEBUG
"%s dsp %s cannot do hardware DTMF, "
84 "because pipeline exists.\n",
89 dsp
->dtmf
.hardware
= hardware
;
90 dsp
->dtmf
.software
= !hardware
;
94 /*************************************************************
95 * calculate the coefficients of the given sample and decode *
96 *************************************************************/
98 /* the given sample is decoded. if the sample is not long enough for a
99 * complete frame, the decoding is finished and continued with the next
100 * call of this function.
102 * the algorithm is very good for detection with a minimum of errors. i
103 * tested it allot. it even works with very short tones (40ms). the only
104 * disadvantage is, that it doesn't work good with different volumes of both
105 * tones. this will happen, if accoustically coupled dialers are used.
106 * it sometimes detects tones during speach, which is normal for decoders.
107 * use sequences to given commands during calls.
109 * dtmf - points to a structure of the current dtmf state
110 * spl and len - the sample
111 * fmt - 0 = alaw, 1 = ulaw, 2 = coefficients from HFC DTMF hw-decoder
115 *dsp_dtmf_goertzel_decode(struct dsp
*dsp
, u8
*data
, int len
, int fmt
)
123 s32 result
[NCOEFF
], tresh
, treshl
;
124 int lowgroup
, highgroup
;
127 dsp
->dtmf
.digits
[0] = '\0';
129 /* Note: The function will loop until the buffer has not enough samples
130 * left to decode a full frame.
133 /* convert samples */
134 size
= dsp
->dtmf
.size
;
135 buf
= dsp
->dtmf
.buffer
;
139 while (size
< DSP_DTMF_NPOINTS
&& len
) {
140 buf
[size
++] = dsp_audio_law_to_s32
[*data
++];
145 case 2: /* HFC coefficients */
149 printk(KERN_ERR
"%s: coefficients have invalid "
150 "size. (is=%d < must=%d)\n",
152 return dsp
->dtmf
.digits
;
154 hfccoeff
= (s32
*)data
;
155 for (k
= 0; k
< NCOEFF
; k
++) {
156 sk2
= (*hfccoeff
++)>>4;
157 sk
= (*hfccoeff
++)>>4;
158 if (sk
> 32767 || sk
< -32767 || sk2
> 32767
161 "DTMF-Detection overflow\n");
162 /* compute |X(k)|**2 */
165 (((cos2pik
[k
] * sk
) >> 15) * sk2
) +
173 dsp
->dtmf
.size
= size
;
175 if (size
< DSP_DTMF_NPOINTS
)
176 return dsp
->dtmf
.digits
;
180 /* now we have a full buffer of signed long samples - we do goertzel */
181 for (k
= 0; k
< NCOEFF
; k
++) {
185 buf
= dsp
->dtmf
.buffer
;
186 cos2pik_
= cos2pik
[k
];
187 for (n
= 0; n
< DSP_DTMF_NPOINTS
; n
++) {
188 sk
= ((cos2pik_
*sk1
)>>15) - sk2
+ (*buf
++);
194 if (sk
> 32767 || sk
< -32767 || sk2
> 32767 || sk2
< -32767)
195 printk(KERN_WARNING
"DTMF-Detection overflow\n");
196 /* compute |X(k)|**2 */
199 (((cos2pik
[k
] * sk
) >> 15) * sk2
) +
203 /* our (squared) coefficients have been calculated, we need to process
208 for (i
= 0; i
< NCOEFF
; i
++) {
211 if (result
[i
] > dsp
->dtmf
.treshold
) {
212 if (result
[i
] > tresh
)
222 if (dsp_debug
& DEBUG_DSP_DTMFCOEFF
)
223 printk(KERN_DEBUG
"a %3d %3d %3d %3d %3d %3d %3d %3d"
224 " tr:%3d r %3d %3d %3d %3d %3d %3d %3d %3d\n",
225 result
[0]/10000, result
[1]/10000, result
[2]/10000,
226 result
[3]/10000, result
[4]/10000, result
[5]/10000,
227 result
[6]/10000, result
[7]/10000, tresh
/10000,
228 result
[0]/(tresh
/100), result
[1]/(tresh
/100),
229 result
[2]/(tresh
/100), result
[3]/(tresh
/100),
230 result
[4]/(tresh
/100), result
[5]/(tresh
/100),
231 result
[6]/(tresh
/100), result
[7]/(tresh
/100));
233 /* calc digit (lowgroup/highgroup) */
236 treshl
= tresh
>> 3; /* tones which are not on, must be below 9 dB */
237 tresh
= tresh
>> 2; /* touchtones must match within 6 dB */
238 for (i
= 0; i
< NCOEFF
; i
++) {
239 if (result
[i
] < treshl
)
240 continue; /* ignore */
241 if (result
[i
] < tresh
) {
244 break; /* noise inbetween */
246 /* good level found. This is allowed only one time per group */
250 /* Bad. Another tone found. */
257 if (highgroup
>= 0) {
258 /* Bad. Another tone found. */
262 highgroup
= i
-(NCOEFF
/2);
266 /* get digit or null */
268 if (lowgroup
>= 0 && highgroup
>= 0)
269 what
= dtmf_matrix
[lowgroup
][highgroup
];
272 if (what
&& (dsp_debug
& DEBUG_DSP_DTMF
))
273 printk(KERN_DEBUG
"DTMF what: %c\n", what
);
275 if (dsp
->dtmf
.lastwhat
!= what
)
278 /* the tone (or no tone) must remain 3 times without change */
279 if (dsp
->dtmf
.count
== 2) {
280 if (dsp
->dtmf
.lastdigit
!= what
) {
281 dsp
->dtmf
.lastdigit
= what
;
283 if (dsp_debug
& DEBUG_DSP_DTMF
)
284 printk(KERN_DEBUG
"DTMF digit: %c\n",
286 if ((strlen(dsp
->dtmf
.digits
)+1)
287 < sizeof(dsp
->dtmf
.digits
)) {
288 dsp
->dtmf
.digits
[strlen(
289 dsp
->dtmf
.digits
)+1] = '\0';
290 dsp
->dtmf
.digits
[strlen(
291 dsp
->dtmf
.digits
)] = what
;
298 dsp
->dtmf
.lastwhat
= what
;