• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 
2 /* -----------------------------------------------------------------------------------------------------------
3 Software License for The Fraunhofer FDK AAC Codec Library for Android
4 
5 � Copyright  1995 - 2012 Fraunhofer-Gesellschaft zur F�rderung der angewandten Forschung e.V.
6   All rights reserved.
7 
8  1.    INTRODUCTION
9 The Fraunhofer FDK AAC Codec Library for Android ("FDK AAC Codec") is software that implements
10 the MPEG Advanced Audio Coding ("AAC") encoding and decoding scheme for digital audio.
11 This FDK AAC Codec software is intended to be used on a wide variety of Android devices.
12 
13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
14 audio codecs. AAC-ELD is considered the best-performing full-bandwidth communications codec by
15 independent studies and is widely deployed. AAC has been standardized by ISO and IEC as part
16 of the MPEG specifications.
17 
18 Patent licenses for necessary patent claims for the FDK AAC Codec (including those of Fraunhofer)
19 may be obtained through Via Licensing (www.vialicensing.com) or through the respective patent owners
20 individually for the purpose of encoding or decoding bit streams in products that are compliant with
21 the ISO/IEC MPEG audio standards. Please note that most manufacturers of Android devices already license
22 these patent claims through Via Licensing or directly from the patent owners, and therefore FDK AAC Codec
23 software may already be covered under those patent licenses when it is used for those licensed purposes only.
24 
25 Commercially-licensed AAC software libraries, including floating-point versions with enhanced sound quality,
26 are also available from Fraunhofer. Users are encouraged to check the Fraunhofer website for additional
27 applications information and documentation.
28 
29 2.    COPYRIGHT LICENSE
30 
31 Redistribution and use in source and binary forms, with or without modification, are permitted without
32 payment of copyright license fees provided that you satisfy the following conditions:
33 
34 You must retain the complete text of this software license in redistributions of the FDK AAC Codec or
35 your modifications thereto in source code form.
36 
37 You must retain the complete text of this software license in the documentation and/or other materials
38 provided with redistributions of the FDK AAC Codec or your modifications thereto in binary form.
39 You must make available free of charge copies of the complete source code of the FDK AAC Codec and your
40 modifications thereto to recipients of copies in binary form.
41 
42 The name of Fraunhofer may not be used to endorse or promote products derived from this library without
43 prior written permission.
44 
45 You may not charge copyright license fees for anyone to use, copy or distribute the FDK AAC Codec
46 software or your modifications thereto.
47 
48 Your modified versions of the FDK AAC Codec must carry prominent notices stating that you changed the software
49 and the date of any change. For modified versions of the FDK AAC Codec, the term
50 "Fraunhofer FDK AAC Codec Library for Android" must be replaced by the term
51 "Third-Party Modified Version of the Fraunhofer FDK AAC Codec Library for Android."
52 
53 3.    NO PATENT LICENSE
54 
55 NO EXPRESS OR IMPLIED LICENSES TO ANY PATENT CLAIMS, including without limitation the patents of Fraunhofer,
56 ARE GRANTED BY THIS SOFTWARE LICENSE. Fraunhofer provides no warranty of patent non-infringement with
57 respect to this software.
58 
59 You may use this FDK AAC Codec software or modifications thereto only for purposes that are authorized
60 by appropriate patent licenses.
61 
62 4.    DISCLAIMER
63 
64 This FDK AAC Codec software is provided by Fraunhofer on behalf of the copyright holders and contributors
65 "AS IS" and WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, including but not limited to the implied warranties
66 of merchantability and fitness for a particular purpose. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
67 CONTRIBUTORS BE LIABLE for any direct, indirect, incidental, special, exemplary, or consequential damages,
68 including but not limited to procurement of substitute goods or services; loss of use, data, or profits,
69 or business interruption, however caused and on any theory of liability, whether in contract, strict
70 liability, or tort (including negligence), arising in any way out of the use of this software, even if
71 advised of the possibility of such damage.
72 
73 5.    CONTACT INFORMATION
74 
75 Fraunhofer Institute for Integrated Circuits IIS
76 Attention: Audio and Multimedia Departments - FDK AAC LL
77 Am Wolfsmantel 33
78 91058 Erlangen, Germany
79 
80 www.iis.fraunhofer.de/amm
81 amm-info@iis.fraunhofer.de
82 ----------------------------------------------------------------------------------------------------------- */
83 
84 /*!
85   \file
86   \brief  Sbr miscellaneous helper functions
87 */
88 #include "sbr_misc.h"
89 
90 
FDKsbrEnc_Shellsort_fract(FIXP_DBL * in,INT n)91 void FDKsbrEnc_Shellsort_fract (FIXP_DBL *in, INT n)
92 {
93   FIXP_DBL v;
94   INT i, j;
95   INT inc = 1;
96 
97   do
98     inc = 3 * inc + 1;
99   while (inc <= n);
100 
101   do {
102     inc = inc / 3;
103     for (i = inc + 1; i <= n; i++) {
104       v = in[i-1];
105       j = i;
106       while (in[j-inc-1] > v) {
107         in[j-1] = in[j-inc-1];
108         j -= inc;
109         if (j <= inc)
110           break;
111       }
112       in[j-1] = v;
113     }
114   } while (inc > 1);
115 
116 }
117 
118 /* Sorting routine */
FDKsbrEnc_Shellsort_int(INT * in,INT n)119 void FDKsbrEnc_Shellsort_int (INT *in, INT n)
120 {
121 
122   INT i, j, v;
123   INT inc = 1;
124 
125   do
126     inc = 3 * inc + 1;
127   while (inc <= n);
128 
129   do {
130     inc = inc / 3;
131     for (i = inc + 1; i <= n; i++) {
132       v = in[i-1];
133       j = i;
134       while (in[j-inc-1] > v) {
135         in[j-1] = in[j-inc-1];
136         j -= inc;
137         if (j <= inc)
138           break;
139       }
140       in[j-1] = v;
141     }
142   } while (inc > 1);
143 
144 }
145 
146 
147 
148 /*******************************************************************************
149  Functionname:  FDKsbrEnc_AddVecLeft
150  *******************************************************************************
151 
152  Description:
153 
154  Arguments:   INT* dst, INT* length_dst, INT* src, INT length_src
155 
156  Return:      none
157 
158 *******************************************************************************/
159 void
FDKsbrEnc_AddVecLeft(INT * dst,INT * length_dst,INT * src,INT length_src)160 FDKsbrEnc_AddVecLeft (INT *dst, INT *length_dst, INT *src, INT length_src)
161 {
162   INT i;
163 
164   for (i = length_src - 1; i >= 0; i--)
165     FDKsbrEnc_AddLeft (dst, length_dst, src[i]);
166 }
167 
168 
169 /*******************************************************************************
170  Functionname:  FDKsbrEnc_AddLeft
171  *******************************************************************************
172 
173  Description:
174 
175  Arguments:   INT* vector, INT* length_vector, INT value
176 
177  Return:      none
178 
179 *******************************************************************************/
180 void
FDKsbrEnc_AddLeft(INT * vector,INT * length_vector,INT value)181 FDKsbrEnc_AddLeft (INT *vector, INT *length_vector, INT value)
182 {
183   INT i;
184 
185   for (i = *length_vector; i > 0; i--)
186     vector[i] = vector[i - 1];
187   vector[0] = value;
188   (*length_vector)++;
189 }
190 
191 
192 /*******************************************************************************
193  Functionname:  FDKsbrEnc_AddRight
194  *******************************************************************************
195 
196  Description:
197 
198  Arguments:   INT* vector, INT* length_vector, INT value
199 
200  Return:      none
201 
202 *******************************************************************************/
203 void
FDKsbrEnc_AddRight(INT * vector,INT * length_vector,INT value)204 FDKsbrEnc_AddRight (INT *vector, INT *length_vector, INT value)
205 {
206   vector[*length_vector] = value;
207   (*length_vector)++;
208 }
209 
210 
211 
212 /*******************************************************************************
213  Functionname:  FDKsbrEnc_AddVecRight
214  *******************************************************************************
215 
216  Description:
217 
218  Arguments:   INT* dst, INT* length_dst, INT* src, INT length_src)
219 
220  Return:      none
221 
222 *******************************************************************************/
223 void
FDKsbrEnc_AddVecRight(INT * dst,INT * length_dst,INT * src,INT length_src)224 FDKsbrEnc_AddVecRight (INT *dst, INT *length_dst, INT *src, INT length_src)
225 {
226   INT i;
227   for (i = 0; i < length_src; i++)
228     FDKsbrEnc_AddRight (dst, length_dst, src[i]);
229 }
230 
231 
232 /*****************************************************************************
233 
234   functionname: FDKsbrEnc_LSI_divide_scale_fract
235 
236   description:  Calculates division with best precision and scales the result.
237 
238   return:       num*scale/denom
239 
240 *****************************************************************************/
FDKsbrEnc_LSI_divide_scale_fract(FIXP_DBL num,FIXP_DBL denom,FIXP_DBL scale)241 FIXP_DBL FDKsbrEnc_LSI_divide_scale_fract(FIXP_DBL num, FIXP_DBL denom, FIXP_DBL scale)
242 {
243   FIXP_DBL tmp = FL2FXCONST_DBL(0.0f);
244   if (num != FL2FXCONST_DBL(0.0f)) {
245 
246     INT shiftCommon;
247     INT shiftNum   = CountLeadingBits(num);
248     INT shiftDenom = CountLeadingBits(denom);
249     INT shiftScale = CountLeadingBits(scale);
250 
251     num   = num   << shiftNum;
252     scale = scale << shiftScale;
253 
254     tmp = fMultDiv2(num,scale);
255 
256     if ( denom > (tmp >> fixMin(shiftNum+shiftScale-1,(DFRACT_BITS-1))) ) {
257       denom = denom << shiftDenom;
258       tmp = schur_div(tmp,denom,15);
259       shiftCommon = fixMin((shiftNum-shiftDenom+shiftScale-1),(DFRACT_BITS-1));
260       if (shiftCommon < 0)
261         tmp <<= -shiftCommon;
262       else
263         tmp >>=  shiftCommon;
264     }
265     else {
266       tmp = /*FL2FXCONST_DBL(1.0)*/ (FIXP_DBL)MAXVAL_DBL;
267     }
268   }
269 
270   return (tmp);
271 }
272 
273