/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
 * Copyright (c) 1999-2004 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 work was supported in part by funding from the Defense Advanced 
 * Research Projects Agency and the National Science Foundation of the 
 * United States of America, and the CMU Sphinx Speech Consortium.
 *
 * 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.
 *
 * ====================================================================
 *
 */
/*
 * Interface for "semi-continuous vector quantization", a.k.a. Sphinx2
 * fast GMM computation.
 */

#ifndef __S2_SEMI_MGAU_H__
#define __S2_SEMI_MGAU_H__

#include "s3types.h"
#include "fe.h"
#include "ascr.h"
#include "fast_algo_struct.h"
#include "kdtree.h"

#define S2_NUM_ALPHABET	256
#define S2_NUM_FEATURES	4
#define S2_MAX_TOPN	6	/* max number of TopN codewords */

typedef struct {
    union {
        int32	score;
        int32	dist;	/* distance to next closest vector */
    } val;
    int32 codeword;		/* codeword (vector index) */
} vqFeature_t;
typedef vqFeature_t *vqFrame_t;

typedef float32 mean_t;
typedef float32 var_t;
#define GMMSUB(a,b) ((a)-(b))
#define GMMADD(a,b) ((a)+(b))

typedef struct s2_semi_mgau_s s2_semi_mgau_t;
struct s2_semi_mgau_s {
    int32   detArr[S2_NUM_FEATURES*S2_NUM_ALPHABET];	/* storage for det vectors */
    int32   *dets[S2_NUM_FEATURES];	/* det values foreach feature */
    mean_t  *means[S2_NUM_FEATURES];	/* mean vectors foreach feature */
    var_t   *vars[S2_NUM_FEATURES];	/* var vectors foreach feature */

    unsigned char **OPDF_8B[4]; /* mixture weights */

    int32 topN;
    int32 CdWdPDFMod;

    kd_tree_t **kdtrees;
    uint32 n_kdtrees;
    uint32 kd_maxdepth;
    int32 kd_maxbbi;
    float64 dcep80msWeight;
    int32 use20ms_diff_pow;

    int32 num_frames;
    int32 frame_ds_ratio;

    vqFeature_t f[S2_NUM_FEATURES][S2_MAX_TOPN];
    vqFeature_t lcfrm[S2_MAX_TOPN];
    vqFeature_t ldfrm[S2_MAX_TOPN];
    vqFeature_t lxfrm[S2_MAX_TOPN];
    vqFeature_t vtmp;
};

s2_semi_mgau_t *s2_semi_mgau_init(const char *mean_path, const char *var_path,
				  float64 varfloor, const char *mixw_path,
				  float64 mixwfloor, int32 topn);

void s2_semi_mgau_free(s2_semi_mgau_t *s);

int32 s2_semi_mgau_frame_eval(s2_semi_mgau_t *s,
			      ascr_t *ascr,
			      fast_gmm_t *fgmm,
			      mfcc_t **feat,
			      int32 frame);

int32 s2_semi_mgau_load_kdtree(s2_semi_mgau_t *s, const char *kdtree_path,
			       uint32 maxdepth, int32 maxbbi);


#endif /*  __S2_SEMI_MGAU_H__ */
