ehwutl.c 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280
  1. /**********************************************************************
  2. Each of the companies; Lucent, Motorola, Nokia, and Qualcomm (hereinafter
  3. referred to individually as "Source" or collectively as "Sources") do
  4. hereby state:
  5. To the extent to which the Source(s) may legally and freely do so, the
  6. Source(s), upon submission of a Contribution, grant(s) a free,
  7. irrevocable, non-exclusive, license to the Third Generation Partnership
  8. Project 2 (3GPP2) and its Organizational Partners: ARIB, CCSA, TIA, TTA,
  9. and TTC, under the Source's copyright or copyright license rights in the
  10. Contribution, to, in whole or in part, copy, make derivative works,
  11. perform, display and distribute the Contribution and derivative works
  12. thereof consistent with 3GPP2's and each Organizational Partner's
  13. policies and procedures, with the right to (i) sublicense the foregoing
  14. rights consistent with 3GPP2's and each Organizational Partner's policies
  15. and procedures and (ii) copyright and sell, if applicable) in 3GPP2's name
  16. or each Organizational Partner's name any 3GPP2 or transposed Publication
  17. even though this Publication may contain the Contribution or a derivative
  18. work thereof. The Contribution shall disclose any known limitations on
  19. the Source's rights to license as herein provided.
  20. When a Contribution is submitted by the Source(s) to assist the
  21. formulating groups of 3GPP2 or any of its Organizational Partners, it
  22. is proposed to the Committee as a basis for discussion and is not to
  23. be construed as a binding proposal on the Source(s). The Source(s)
  24. specifically reserve(s) the right to amend or modify the material
  25. contained in the Contribution. Nothing contained in the Contribution
  26. shall, except as herein expressly provided, be construed as conferring
  27. by implication, estoppel or otherwise, any license or right under (i)
  28. any existing or later issuing patent, whether or not the use of
  29. information in the document necessarily employs an invention of any
  30. existing or later issued patent, (ii) any copyright, (iii) any
  31. trademark, or (iv) any other intellectual property right.
  32. With respect to the Software necessary for the practice of any or
  33. all Normative portions of the Enhanced Variable Rate Codec (EVRC) as
  34. it exists on the date of submittal of this form, should the EVRC be
  35. approved as a Specification or Report by 3GPP2, or as a transposed
  36. Standard by any of the 3GPP2's Organizational Partners, the Source(s)
  37. state(s) that a worldwide license to reproduce, use and distribute the
  38. Software, the license rights to which are held by the Source(s), will
  39. be made available to applicants under terms and conditions that are
  40. reasonable and non-discriminatory, which may include monetary compensation,
  41. and only to the extent necessary for the practice of any or all of the
  42. Normative portions of the EVRC or the field of use of practice of the
  43. EVRC Specification, Report, or Standard. The statement contained above
  44. is irrevocable and shall be binding upon the Source(s). In the event
  45. the rights of the Source(s) in and to copyright or copyright license
  46. rights subject to such commitment are assigned or transferred, the
  47. Source(s) shall notify the assignee or transferee of the existence of
  48. such commitments.
  49. *******************************************************************/
  50. /*======================================================================*/
  51. /* Enhanced Variable Rate Codec - Bit-Exact C Specification */
  52. /* Copyright (C) 1997-1998 Telecommunications Industry Association. */
  53. /* All rights reserved. */
  54. /*----------------------------------------------------------------------*/
  55. /* Note: Reproduction and use of this software for the design and */
  56. /* development of North American Wideband CDMA Digital */
  57. /* Cellular Telephony Standards is authorized by the TIA. */
  58. /* The TIA does not authorize the use of this software for any */
  59. /* other purpose. */
  60. /* */
  61. /* The availability of this software does not provide any license */
  62. /* by implication, estoppel, or otherwise under any patent rights */
  63. /* of TIA member companies or others covering any use of the */
  64. /* contents herein. */
  65. /* */
  66. /* Any copies of this software or derivative works must include */
  67. /* this and all other proprietary notices. */
  68. /*======================================================================*/
  69. #include "ehwutl.h"
  70. //#include "mathevrc.h"
  71. #include "dsp_math.h"
  72. #include <math.h>
  73. static int nfirst;
  74. double sFrct[32 + 8];
  75. double dFrct[32 + 8];
  76. static double maxSfrct;
  77. static double minSfrct;
  78. static int msb ={15};
  79. static int lsb ={0};
  80. char line[200];
  81. static void init()
  82. {
  83. int n;
  84. nfirst = 1;
  85. /*wprintf("%d %d signed max\n",INT_MAX,INT_MIN);
  86. * wprintf("%U unsigned max\n",UINT_MAX);
  87. * if (UINT_MAX < 4294967295U){
  88. * wprintf("you need to convert ints to INT32 ints \n");
  89. * exit(1);
  90. * }
  91. */
  92. for (n = 0; n < 16; n++)
  93. {
  94. sFrct[n] = pow(2.0, -((double) 15.0 - (double) n));
  95. }
  96. maxSfrct = 1.0 - sFrct[0];
  97. minSfrct = -1.0;
  98. for (n = 0; n < 32; n++)
  99. {
  100. dFrct[n] = pow(2.0, -((double) 31.0 - (double) n));
  101. }
  102. for (n = 31; n < 40; n++)
  103. {
  104. dFrct[n] = pow(2.0, -(31.0 - (double) n));
  105. }
  106. }
  107. static void pHex(char *in, int num)
  108. {
  109. /* The first num characters are checked for ' ' and
  110. * replaced with '0' */
  111. int i;
  112. for (i = 0; i < num; i++)
  113. {
  114. if (line[i] == ' ')
  115. wprintf("0");
  116. else
  117. wprintf("%c", line[i]);
  118. }
  119. }
  120. void xDispSw(Shortword in)
  121. {
  122. wprintf("0x");
  123. sprintf(line, "%4x", in);
  124. pHex(line, 4);
  125. wprintf(" ");
  126. }
  127. void xDispSns(struct NormSw snsIn)
  128. {
  129. wprintf("0x");
  130. sprintf(line, "%4x", snsIn.man);
  131. pHex(line, 4);
  132. wprintf(" ");
  133. sprintf(line, "%2d", snsIn.sh);
  134. pHex(line, 2);
  135. wprintf(" ");
  136. }
  137. void xDispLw(Longword in)
  138. {
  139. wprintf("0x");
  140. sprintf(line, "%4x", (in >> 16) & 0xffff);
  141. pHex(line, 4);
  142. wprintf(" ");
  143. sprintf(line, "%4x", in & 0xffff);
  144. pHex(line, 4);
  145. wprintf(" ");
  146. }
  147. double toFloatLw(Longword lwIn)
  148. {
  149. /* convert signed fractional number to a double */
  150. double output;
  151. int i;
  152. UINT32 mask;
  153. int negative;
  154. if (!nfirst)
  155. init();
  156. output = 0.0;
  157. negative = 0;
  158. if (lwIn < 0)
  159. {
  160. /* negative */
  161. negative = 1;
  162. lwIn = -lwIn;
  163. }
  164. if (lwIn >= 0)
  165. {
  166. /* now positive */
  167. for (mask = 0x1, i = 0; i < 32; i++)
  168. {
  169. if (mask & lwIn)
  170. output += dFrct[i];
  171. mask <<= 1;
  172. }
  173. if (negative)
  174. output *= -1.0;
  175. }
  176. else
  177. {
  178. output = -1.0;
  179. }
  180. return (output);
  181. }
  182. double toFloatSw(Shortword swIn)
  183. {
  184. return (toFloatLw((Longword) swIn * (Longword) 0x10000));
  185. }
  186. double toFloatSns(struct NormSw snsIn)
  187. {
  188. double dOut;
  189. dOut = toFloatSw(snsIn.man);
  190. if (snsIn.sh == 0)
  191. return (dOut);
  192. else if (snsIn.sh < 0)
  193. return (dOut * pow(2.0, -snsIn.sh));
  194. else
  195. return (dOut / pow(2.0, snsIn.sh));
  196. }
  197. void fDispSw(Shortword swIn)
  198. {
  199. wprintf("%11.8f ", toFloatSw(swIn));
  200. }
  201. void fDispLw(Longword lwIn)
  202. {
  203. wprintf("%11.8f ", toFloatLw(lwIn));
  204. }
  205. void fDispSns(struct NormSw snsIn)
  206. {
  207. wprintf("%11.8f ", toFloatSns(snsIn));
  208. }
  209. Longword toLwFloat(double dIn)
  210. {
  211. INT32 l1;
  212. INT32 liExt, liInt;
  213. UINT32 ulExt = 0;
  214. Longword L_Out;
  215. if (dIn > -(double) (1 << 0) / 2147483648.0 && dIn < 0)
  216. {
  217. L_Out = 0;
  218. }
  219. else
  220. {
  221. liInt = dIn; /* integer portion */
  222. if (liInt != 0)
  223. {
  224. if (liInt < 0)
  225. {
  226. L_Out = LW_MIN;
  227. }
  228. else
  229. {
  230. L_Out = LW_MAX;
  231. }
  232. }
  233. else
  234. {
  235. /*
  236. * shift up, perform limiting and convergent rounding
  237. */
  238. dIn *= 2147483648.0; /* 2**31 */
  239. /* round */
  240. dIn += (dIn >= 0.0) ? 0.5 : -0.5;
  241. l1 = dIn;
  242. if (dIn == (double) l1)
  243. {
  244. l1 -= l1 % 2;
  245. }
  246. /* assign the fractional portion to frac */
  247. L_Out = l1;
  248. }
  249. }
  250. return (L_Out);
  251. }
  252. Shortword toSwFloat(double dIn)
  253. {
  254. return (round32(toLwFloat(dIn)));
  255. }