/********************************************************************** Each of the companies; Lucent, Motorola, Nokia, and Qualcomm (hereinafter referred to individually as "Source" or collectively as "Sources") do hereby state: To the extent to which the Source(s) may legally and freely do so, the Source(s), upon submission of a Contribution, grant(s) a free, irrevocable, non-exclusive, license to the Third Generation Partnership Project 2 (3GPP2) and its Organizational Partners: ARIB, CCSA, TIA, TTA, and TTC, under the Source's copyright or copyright license rights in the Contribution, to, in whole or in part, copy, make derivative works, perform, display and distribute the Contribution and derivative works thereof consistent with 3GPP2's and each Organizational Partner's policies and procedures, with the right to (i) sublicense the foregoing rights consistent with 3GPP2's and each Organizational Partner's policies and procedures and (ii) copyright and sell, if applicable) in 3GPP2's name or each Organizational Partner's name any 3GPP2 or transposed Publication even though this Publication may contain the Contribution or a derivative work thereof. The Contribution shall disclose any known limitations on the Source's rights to license as herein provided. When a Contribution is submitted by the Source(s) to assist the formulating groups of 3GPP2 or any of its Organizational Partners, it is proposed to the Committee as a basis for discussion and is not to be construed as a binding proposal on the Source(s). The Source(s) specifically reserve(s) the right to amend or modify the material contained in the Contribution. Nothing contained in the Contribution shall, except as herein expressly provided, be construed as conferring by implication, estoppel or otherwise, any license or right under (i) any existing or later issuing patent, whether or not the use of information in the document necessarily employs an invention of any existing or later issued patent, (ii) any copyright, (iii) any trademark, or (iv) any other intellectual property right. With respect to the Software necessary for the practice of any or all Normative portions of the Enhanced Variable Rate Codec (EVRC) as it exists on the date of submittal of this form, should the EVRC be approved as a Specification or Report by 3GPP2, or as a transposed Standard by any of the 3GPP2's Organizational Partners, the Source(s) state(s) that a worldwide license to reproduce, use and distribute the Software, the license rights to which are held by the Source(s), will be made available to applicants under terms and conditions that are reasonable and non-discriminatory, which may include monetary compensation, and only to the extent necessary for the practice of any or all of the Normative portions of the EVRC or the field of use of practice of the EVRC Specification, Report, or Standard. The statement contained above is irrevocable and shall be binding upon the Source(s). In the event the rights of the Source(s) in and to copyright or copyright license rights subject to such commitment are assigned or transferred, the Source(s) shall notify the assignee or transferee of the existence of such commitments. *******************************************************************/ /*======================================================================*/ /* Enhanced Variable Rate Codec - Bit-Exact C Specification */ /* Copyright (C) 1997-1998 Telecommunications Industry Association. */ /* All rights reserved. */ /*----------------------------------------------------------------------*/ /* Note: Reproduction and use of this software for the design and */ /* development of North American Wideband CDMA Digital */ /* Cellular Telephony Standards is authorized by the TIA. */ /* The TIA does not authorize the use of this software for any */ /* other purpose. */ /* */ /* The availability of this software does not provide any license */ /* by implication, estoppel, or otherwise under any patent rights */ /* of TIA member companies or others covering any use of the */ /* contents herein. */ /* */ /* Any copies of this software or derivative works must include */ /* this and all other proprietary notices. */ /*======================================================================*/ #include "ehwutl.h" //#include "mathevrc.h" #include "dsp_math.h" #include static int nfirst; double sFrct[32 + 8]; double dFrct[32 + 8]; static double maxSfrct; static double minSfrct; static int msb ={15}; static int lsb ={0}; char line[200]; static void init() { int n; nfirst = 1; /*wprintf("%d %d signed max\n",INT_MAX,INT_MIN); * wprintf("%U unsigned max\n",UINT_MAX); * if (UINT_MAX < 4294967295U){ * wprintf("you need to convert ints to INT32 ints \n"); * exit(1); * } */ for (n = 0; n < 16; n++) { sFrct[n] = pow(2.0, -((double) 15.0 - (double) n)); } maxSfrct = 1.0 - sFrct[0]; minSfrct = -1.0; for (n = 0; n < 32; n++) { dFrct[n] = pow(2.0, -((double) 31.0 - (double) n)); } for (n = 31; n < 40; n++) { dFrct[n] = pow(2.0, -(31.0 - (double) n)); } } static void pHex(char *in, int num) { /* The first num characters are checked for ' ' and * replaced with '0' */ int i; for (i = 0; i < num; i++) { if (line[i] == ' ') wprintf("0"); else wprintf("%c", line[i]); } } void xDispSw(Shortword in) { wprintf("0x"); sprintf(line, "%4x", in); pHex(line, 4); wprintf(" "); } void xDispSns(struct NormSw snsIn) { wprintf("0x"); sprintf(line, "%4x", snsIn.man); pHex(line, 4); wprintf(" "); sprintf(line, "%2d", snsIn.sh); pHex(line, 2); wprintf(" "); } void xDispLw(Longword in) { wprintf("0x"); sprintf(line, "%4x", (in >> 16) & 0xffff); pHex(line, 4); wprintf(" "); sprintf(line, "%4x", in & 0xffff); pHex(line, 4); wprintf(" "); } double toFloatLw(Longword lwIn) { /* convert signed fractional number to a double */ double output; int i; UINT32 mask; int negative; if (!nfirst) init(); output = 0.0; negative = 0; if (lwIn < 0) { /* negative */ negative = 1; lwIn = -lwIn; } if (lwIn >= 0) { /* now positive */ for (mask = 0x1, i = 0; i < 32; i++) { if (mask & lwIn) output += dFrct[i]; mask <<= 1; } if (negative) output *= -1.0; } else { output = -1.0; } return (output); } double toFloatSw(Shortword swIn) { return (toFloatLw((Longword) swIn * (Longword) 0x10000)); } double toFloatSns(struct NormSw snsIn) { double dOut; dOut = toFloatSw(snsIn.man); if (snsIn.sh == 0) return (dOut); else if (snsIn.sh < 0) return (dOut * pow(2.0, -snsIn.sh)); else return (dOut / pow(2.0, snsIn.sh)); } void fDispSw(Shortword swIn) { wprintf("%11.8f ", toFloatSw(swIn)); } void fDispLw(Longword lwIn) { wprintf("%11.8f ", toFloatLw(lwIn)); } void fDispSns(struct NormSw snsIn) { wprintf("%11.8f ", toFloatSns(snsIn)); } Longword toLwFloat(double dIn) { INT32 l1; INT32 liExt, liInt; UINT32 ulExt = 0; Longword L_Out; if (dIn > -(double) (1 << 0) / 2147483648.0 && dIn < 0) { L_Out = 0; } else { liInt = dIn; /* integer portion */ if (liInt != 0) { if (liInt < 0) { L_Out = LW_MIN; } else { L_Out = LW_MAX; } } else { /* * shift up, perform limiting and convergent rounding */ dIn *= 2147483648.0; /* 2**31 */ /* round */ dIn += (dIn >= 0.0) ? 0.5 : -0.5; l1 = dIn; if (dIn == (double) l1) { l1 -= l1 % 2; } /* assign the fractional portion to frac */ L_Out = l1; } } return (L_Out); } Shortword toSwFloat(double dIn) { return (round32(toLwFloat(dIn))); }