⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 log.h

📁 WinCE平台上的语音识别程序
💻 H
字号:
/* ==================================================================== * Copyright (c) 1999-2001 Carnegie Mellon University.  All rights * reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer.  * * 2. Redistributions in binary form must reproduce the above copyright *    notice, this list of conditions and the following disclaimer in *    the documentation and/or other materials provided with the *    distribution. * * * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND  * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * ==================================================================== * *//* * log.h -- LOG based probability ops *  * ********************************************** * CMU ARPA Speech Project * * Copyright (c) 1996 Carnegie Mellon University. * ********************************************** */#ifndef _LOG_H_#define _LOG_H_#include <math.h>/* Pull in the definitions from sphinxbase and redefine them for convenience here */#include <fixpoint.h>#define BASE		FE_BASE#define LOG_BASE	FE_LOG_BASE#define MIN_LOG		FE_MIN_LOG#define MIN_DOUBLE	1e-300#define LOG(x) FE_LOG(x)#define EXP(x)	(exp ((double) (x) * FE_LOG_BASE))#define ADD(x,y) FE_LOG_ADD(x,y)#define FAST_ADD(res, x, y, table, table_size)		\{							\	int32 _d = (x) - (y);				\	if (_d > 0) { /* x >= y */			\		if (_d >= (table_size))			\			res = (x);			\		else					\			res = (table)[_d] + (x);	\	} else { /* x < y */				\		if (-_d >= (table_size))		\			res = (y);			\		else					\			res = (table)[-_d] + (y);	\	}						\}/* * Note that we always deal with quantities < 0.0, there for we round * using -0.5 instead of +0.5 */ #define LOG10TOLOG(x)	((int32)((x * (2.30258509 / LOG_BASE)) - 0.5))/* * In terms of already shifted and negated quantities (i.e. dealing with * 8-bit quantized values): */#define LOG_ADD(p1,p2)	(logadd_tbl[(p1<<8)+(p2)])extern const unsigned char logadd_tbl[];#endif /* _LOG_H_ */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -