comparison celp_math.h @ 8048:ecb1962c12f3 libavcodec

Rename acelp_math.[ch] to celp_math.[ch] to prepare for QCELP decoder merge. patch by Kenan Gillet, kenan.gillet gmail com
author diego
date Fri, 24 Oct 2008 21:20:29 +0000
parents acelp_math.h@c4a4495715dd
children 1c07635d7334
comparison
equal deleted inserted replaced
8047:ed8906ba4bea 8048:ecb1962c12f3
1 /*
2 * Various fixed-point math operations
3 *
4 * Copyright (c) 2008 Vladimir Voroshilov
5 *
6 * This file is part of FFmpeg.
7 *
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 *
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 */
22
23 #ifndef AVCODEC_CELP_MATH_H
24 #define AVCODEC_CELP_MATH_H
25
26 #include <stdint.h>
27
28 /**
29 * fixed-point implementation of cosine in [0; PI) domain.
30 * @param arg fixed-point cosine argument, 0 <= arg < 0x4000
31 *
32 * @return value of (1<<15) * cos(arg * PI / (1<<14)), -0x8000 <= result <= 0x7fff
33 */
34 int16_t ff_cos(uint16_t arg);
35
36 /**
37 * fixed-point implementation of exp2(x) in [0; 1] domain.
38 * @param power argument to exp2, 0 <= power <= 0x7fff
39 *
40 * @return value of (1<<20) * exp2(power / (1<<15))
41 * 0x8000c <= result <= 0xfffea
42 */
43 int ff_exp2(uint16_t power);
44
45 /**
46 * Calculates log2(x).
47 * @param value function argument, 0 < value <= 7fff ffff
48 *
49 * @return value of (1<<15) * log2(value)
50 */
51 int ff_log2(uint32_t value);
52
53 /**
54 * returns the dot product.
55 * @param a input data array
56 * @param b input data array
57 * @param length number of elements
58 * @param shift right shift by this value will be done after multiplication
59 *
60 * @return dot product = sum of elementwise products
61 */
62 static int dot_product(const int16_t* a, const int16_t* b, int length, int shift)
63 {
64 int sum = 0;
65 int i;
66
67 for(i=0; i<length; i++)
68 sum += (a[i] * b[i]) >> shift;
69
70 return sum;
71 }
72
73 /**
74 * Shift value left or right depending on sign of offset parameter.
75 * @param value value to shift
76 * @param offset shift offset
77 *
78 * @return value << offset, if offset>=0; value >> -offset - otherwise
79 */
80 static inline int bidir_sal(int value, int offset)
81 {
82 if(offset < 0) return value >> -offset;
83 else return value << offset;
84 }
85
86 #endif /* AVCODEC_CELP_MATH_H */