File size: 22,367 Bytes
5610573 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 | /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 1996-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.
*
* ====================================================================
*
*/
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
/* Public headers. */
#include <pocketsphinx.h>
#include "util/byteorder.h"
#include "util/genrand.h"
#include "util/ckd_alloc.h"
#include "fe/fixpoint.h"
#include "fe/fe_internal.h"
#include "fe/fe_warp.h"
int
fe_parse_general_params(cmd_ln_t *config, fe_t * fe)
{
int j, frate, window_samples;
fe->config = ps_config_retain(config);
fe->sampling_rate = ps_config_int(config, "samprate");
frate = ps_config_int(config, "frate");
if (frate > MAX_INT16 || frate > fe->sampling_rate || frate < 1) {
E_ERROR
("Frame rate %d can not be bigger than sample rate %.02f\n",
frate, fe->sampling_rate);
return -1;
}
fe->frame_rate = (int16)frate;
if (ps_config_bool(config, "dither")) {
fe->dither = 1;
fe->dither_seed = ps_config_int(config, "seed");
}
#ifdef WORDS_BIGENDIAN
/* i.e. if input_endian is *not* "big", then fe->swap is true. */
fe->swap = strcmp("big", ps_config_str(config, "input_endian"));
#else
/* and vice versa */
fe->swap = strcmp("little", ps_config_str(config, "input_endian"));
#endif
fe->window_length = ps_config_float(config, "wlen");
fe->pre_emphasis_alpha = ps_config_float(config, "alpha");
fe->num_cepstra = (uint8)ps_config_int(config, "ncep");
fe->fft_size = (int16)ps_config_int(config, "nfft");
window_samples = (int)(fe->window_length * fe->sampling_rate);
E_INFO("Frames are %d samples at intervals of %d\n",
window_samples, (int)(fe->sampling_rate / frate));
if (window_samples > MAX_INT16) {
/* This is extremely unlikely! */
E_ERROR("Frame size exceeds maximum FFT size (%d > %d)\n",
window_samples, MAX_INT16);
return -1;
}
/* Set FFT size automatically from window size. */
if (fe->fft_size == 0) {
fe->fft_order = 0;
fe->fft_size = (1<<fe->fft_order);
while (fe->fft_size < window_samples) {
fe->fft_order++;
fe->fft_size <<= 1;
}
E_INFO("FFT size automatically set to %d\n", fe->fft_size);
}
else {
/* Check FFT size, compute FFT order (log_2(n)) */
for (j = fe->fft_size, fe->fft_order = 0; j > 1; j >>= 1, fe->fft_order++) {
if (((j % 2) != 0) || (fe->fft_size <= 0)) {
E_ERROR("fft: number of points must be a power of 2 (is %d)\n",
fe->fft_size);
return -1;
}
}
/* Verify that FFT size is greater or equal to window length. */
if (fe->fft_size < window_samples) {
E_ERROR("FFT: Number of points must be greater or "
"equal to frame size\n");
return -1;
}
}
fe->remove_dc = ps_config_bool(config, "remove_dc");
if (0 == strcmp(ps_config_str(config, "transform"), "dct"))
fe->transform = DCT_II;
else if (0 == strcmp(ps_config_str(config, "transform"), "legacy"))
fe->transform = LEGACY_DCT;
else if (0 == strcmp(ps_config_str(config, "transform"), "htk"))
fe->transform = DCT_HTK;
else {
E_ERROR("Invalid transform type (values are 'dct', 'legacy', 'htk')\n");
return -1;
}
if (ps_config_bool(config, "logspec"))
fe->log_spec = RAW_LOG_SPEC;
if (ps_config_bool(config, "smoothspec"))
fe->log_spec = SMOOTH_LOG_SPEC;
return 0;
}
static int
fe_parse_melfb_params(cmd_ln_t *config, fe_t *fe, melfb_t * mel)
{
mel->sampling_rate = fe->sampling_rate;
mel->fft_size = fe->fft_size;
mel->num_cepstra = fe->num_cepstra;
mel->num_filters = ps_config_int(config, "nfilt");
if (fe->log_spec)
fe->feature_dimension = mel->num_filters;
else
fe->feature_dimension = fe->num_cepstra;
mel->upper_filt_freq = ps_config_float(config, "upperf");
mel->lower_filt_freq = ps_config_float(config, "lowerf");
mel->doublewide = ps_config_bool(config, "doublebw");
mel->warp_type = ps_config_str(config, "warp_type");
mel->warp_params = ps_config_str(config, "warp_params");
mel->lifter_val = ps_config_int(config, "lifter");
mel->unit_area = ps_config_bool(config, "unit_area");
mel->round_filters = ps_config_bool(config, "round_filters");
if (fe_warp_set(mel, mel->warp_type) != FE_SUCCESS) {
E_ERROR("Failed to initialize the warping function.\n");
return -1;
}
fe_warp_set_parameters(mel, mel->warp_params, mel->sampling_rate);
return 0;
}
void
fe_print_current(fe_t const *fe)
{
E_INFO("Current FE Parameters:\n");
E_INFO("\tSampling Rate: %f\n", fe->sampling_rate);
E_INFO("\tFrame Size: %d\n", fe->frame_size);
E_INFO("\tFrame Shift: %d\n", fe->frame_shift);
E_INFO("\tFFT Size: %d\n", fe->fft_size);
E_INFO("\tLower Frequency: %g\n",
fe->mel_fb->lower_filt_freq);
E_INFO("\tUpper Frequency: %g\n",
fe->mel_fb->upper_filt_freq);
E_INFO("\tNumber of filters: %d\n", fe->mel_fb->num_filters);
E_INFO("\tNumber of Overflow Samps: %d\n", fe->num_overflow_samps);
E_INFO("Will %sremove DC offset at frame level\n",
fe->remove_dc ? "" : "not ");
if (fe->dither) {
E_INFO("Will add dither to audio\n");
E_INFO("Dither seeded with %d\n", fe->dither_seed);
}
else {
E_INFO("Will not add dither to audio\n");
}
if (fe->mel_fb->lifter_val) {
E_INFO("Will apply sine-curve liftering, period %d\n",
fe->mel_fb->lifter_val);
}
E_INFO("Will %snormalize filters to unit area\n",
fe->mel_fb->unit_area ? "" : "not ");
E_INFO("Will %sround filter frequencies to DFT points\n",
fe->mel_fb->round_filters ? "" : "not ");
E_INFO("Will %suse double bandwidth in mel filter\n",
fe->mel_fb->doublewide ? "" : "not ");
}
fe_t *
fe_init_auto_r(cmd_ln_t *config)
{
fe_t *fe;
fe = (fe_t*)ckd_calloc(1, sizeof(*fe));
fe->refcount = 1;
/* transfer params to front end */
if (fe_parse_general_params(config, fe) < 0) {
fe_free(fe);
return NULL;
}
/* compute remaining fe parameters */
/* We add 0.5 so approximate the float with the closest
* integer. E.g., 2.3 is truncate to 2, whereas 3.7 becomes 4
*/
fe->frame_shift = (int32) (fe->sampling_rate / fe->frame_rate + 0.5);
fe->frame_size = (int32) (fe->window_length * fe->sampling_rate + 0.5);
fe->pre_emphasis_prior = 0;
assert (fe->frame_shift > 1);
if (fe->frame_size < fe->frame_shift) {
E_ERROR
("Frame size %d (-wlen) must be greater than frame shift %d (-frate)\n",
fe->frame_size, fe->frame_shift);
fe_free(fe);
return NULL;
}
if (fe->frame_size > (fe->fft_size)) {
E_ERROR
("Number of FFT points has to be a power of 2 higher than %d, it is %d\n",
fe->frame_size, fe->fft_size);
fe_free(fe);
return NULL;
}
if (fe->dither)
fe_init_dither(fe->dither_seed);
/* establish buffers for overflow samps and hamming window */
fe->overflow_samps = ckd_calloc(fe->frame_size, sizeof(float32));
fe->hamming_window = ckd_calloc(fe->frame_size/2, sizeof(window_t));
/* create hamming window */
fe_create_hamming(fe->hamming_window, fe->frame_size);
/* init and fill appropriate filter structure */
fe->mel_fb = ckd_calloc(1, sizeof(*fe->mel_fb));
/* transfer params to mel fb */
fe_parse_melfb_params(config, fe, fe->mel_fb);
if (fe->mel_fb->upper_filt_freq > fe->sampling_rate / 2 + 1.0) {
E_ERROR("Upper frequency %.1f is higher than samprate/2 (%.1f)\n",
fe->mel_fb->upper_filt_freq, fe->sampling_rate / 2);
fe_free(fe);
return NULL;
}
fe_build_melfilters(fe->mel_fb);
fe_compute_melcosine(fe->mel_fb);
if (ps_config_bool(config, "remove_noise"))
fe->noise_stats = fe_init_noisestats(fe->mel_fb->num_filters);
/* Create temporary FFT, spectrum and mel-spectrum buffers. */
/* FIXME: Gosh there are a lot of these. */
fe->spch = ckd_calloc(fe->frame_size, sizeof(*fe->spch));
fe->frame = ckd_calloc(fe->fft_size, sizeof(*fe->frame));
fe->spec = ckd_calloc(fe->fft_size, sizeof(*fe->spec));
fe->mfspec = ckd_calloc(fe->mel_fb->num_filters, sizeof(*fe->mfspec));
/* create twiddle factors */
fe->ccc = ckd_calloc(fe->fft_size / 4, sizeof(*fe->ccc));
fe->sss = ckd_calloc(fe->fft_size / 4, sizeof(*fe->sss));
fe_create_twiddle(fe);
if (ps_config_bool(config, "verbose")) {
fe_print_current(fe);
}
/*** Initialize the overflow buffers ***/
fe_start_utt(fe);
return fe;
}
cmd_ln_t *
fe_get_config(fe_t *fe)
{
return fe->config;
}
void
fe_init_dither(int32 seed)
{
E_INFO("You are using %d as the seed.\n", seed);
s3_rand_seed(seed);
}
int32
fe_start_utt(fe_t * fe)
{
fe->num_overflow_samps = 0;
// Does the same thing as above, but whatever...
memset(fe->overflow_samps, 0,
fe->frame_size * sizeof(*fe->overflow_samps));
fe->pre_emphasis_prior = 0;
return 0;
}
int
fe_get_output_size(fe_t *fe)
{
return (int)fe->feature_dimension;
}
void
fe_get_input_size(fe_t *fe, int *out_frame_shift,
int *out_frame_size)
{
if (out_frame_shift)
*out_frame_shift = fe->frame_shift;
if (out_frame_size)
*out_frame_size = fe->frame_size;
}
int32
fe_process_frame(fe_t * fe, int16 const *spch, int32 nsamps, mfcc_t * fr_cep)
{
fe_read_frame_int16(fe, spch, nsamps);
return fe_write_frame(fe, fr_cep);
}
int
fe_process_frames_int16(fe_t *fe,
int16 const **inout_spch,
size_t *inout_nsamps,
mfcc_t **buf_cep,
int32 *inout_nframes)
{
int32 frame_count;
int outidx, i, n_overflow, orig_n_overflow;
int16 const *orig_spch;
/* In the special case where there is no output buffer, return the
* maximum number of frames which would be generated. */
if (buf_cep == NULL) {
if (*inout_nsamps + fe->num_overflow_samps < (size_t)fe->frame_size)
*inout_nframes = 0;
else
*inout_nframes = 1
+ ((*inout_nsamps + fe->num_overflow_samps - fe->frame_size)
/ fe->frame_shift);
return *inout_nframes;
}
/* Are there not enough samples to make at least 1 frame? */
if (*inout_nsamps + fe->num_overflow_samps < (size_t)fe->frame_size) {
if (*inout_nsamps > 0) {
/* Append them to the overflow buffer. */
memcpy(fe->overflow_samps + fe->num_overflow_samps,
*inout_spch, *inout_nsamps * (sizeof(**inout_spch)));
fe->num_overflow_samps += *inout_nsamps;
/* Update input-output pointers and counters. */
*inout_spch += *inout_nsamps;
*inout_nsamps = 0;
}
/* We produced no frames of output, sorry! */
*inout_nframes = 0;
return 0;
}
/* Can't write a frame? Then do nothing! */
if (*inout_nframes < 1) {
*inout_nframes = 0;
return 0;
}
/* Keep track of the original start of the buffer. */
orig_spch = *inout_spch;
orig_n_overflow = fe->num_overflow_samps;
/* How many frames will we be able to get? */
frame_count = 1
+ ((*inout_nsamps + fe->num_overflow_samps - fe->frame_size)
/ fe->frame_shift);
/* Limit it to the number of output frames available. */
if (frame_count > *inout_nframes)
frame_count = *inout_nframes;
/* Index of output frame. */
outidx = 0;
/* Start processing, taking care of any incoming overflow. */
if (fe->num_overflow_samps) {
int offset = fe->frame_size - fe->num_overflow_samps;
/* Append start of spch to overflow samples to make a full frame. */
memcpy(fe->overflow_samps + fe->num_overflow_samps,
*inout_spch, offset * sizeof(**inout_spch));
fe_read_frame_int16(fe, fe->overflow_samps, fe->frame_size);
assert(outidx < frame_count);
fe_write_frame(fe, buf_cep[outidx]);
outidx++;
/* Update input-output pointers and counters. */
*inout_spch += offset;
*inout_nsamps -= offset;
fe->num_overflow_samps -= fe->frame_shift;
}
else {
fe_read_frame_int16(fe, *inout_spch, fe->frame_size);
assert(outidx < frame_count);
fe_write_frame(fe, buf_cep[outidx]);
outidx++;
/* Update input-output pointers and counters. */
*inout_spch += fe->frame_size;
*inout_nsamps -= fe->frame_size;
}
/* Process all remaining frames. */
for (i = 1; i < frame_count; ++i) {
assert(*inout_nsamps >= (size_t)fe->frame_shift);
fe_shift_frame_int16(fe, *inout_spch, fe->frame_shift);
assert(outidx < frame_count);
fe_write_frame(fe, buf_cep[outidx]);
outidx++;
/* Update input-output pointers and counters. */
*inout_spch += fe->frame_shift;
*inout_nsamps -= fe->frame_shift;
/* Amount of data behind the original input which is still needed. */
if (fe->num_overflow_samps > 0)
fe->num_overflow_samps -= fe->frame_shift;
}
/* How many relevant overflow samples are there left? */
if (fe->num_overflow_samps <= 0) {
/* Maximum number of overflow samples past *inout_spch to save. */
n_overflow = *inout_nsamps;
if (n_overflow > fe->frame_shift)
n_overflow = fe->frame_shift;
fe->num_overflow_samps = fe->frame_size - fe->frame_shift;
/* Make sure this isn't an illegal read! */
if (fe->num_overflow_samps > *inout_spch - orig_spch)
fe->num_overflow_samps = *inout_spch - orig_spch;
fe->num_overflow_samps += n_overflow;
if (fe->num_overflow_samps > 0) {
memcpy(fe->overflow_samps,
*inout_spch - (fe->frame_size - fe->frame_shift),
fe->num_overflow_samps * sizeof(**inout_spch));
/* Update the input pointer to cover this stuff. */
*inout_spch += n_overflow;
*inout_nsamps -= n_overflow;
}
}
else {
/* There is still some relevant data left in the overflow buffer. */
/* Shift existing data to the beginning. */
memmove(fe->overflow_samps,
fe->overflow_samps + orig_n_overflow - fe->num_overflow_samps,
fe->num_overflow_samps * sizeof(*fe->overflow_samps));
/* Copy in whatever we had in the original speech buffer. */
n_overflow = *inout_spch - orig_spch + *inout_nsamps;
if (n_overflow > fe->frame_size - fe->num_overflow_samps)
n_overflow = fe->frame_size - fe->num_overflow_samps;
memcpy(fe->overflow_samps + fe->num_overflow_samps,
orig_spch, n_overflow * sizeof(*orig_spch));
fe->num_overflow_samps += n_overflow;
/* Advance the input pointers. */
if (n_overflow > *inout_spch - orig_spch) {
n_overflow -= (*inout_spch - orig_spch);
*inout_spch += n_overflow;
*inout_nsamps -= n_overflow;
}
}
/* Finally update the frame counter with the number of frames we procesed. */
*inout_nframes = outidx; /* FIXME: Not sure why I wrote it this way... */
return 0;
}
int
fe_process_frames(fe_t *fe,
int16 const **inout_spch,
size_t *inout_nsamps,
mfcc_t **buf_cep,
int32 *inout_nframes)
{
return fe_process_frames_int16(fe, inout_spch, inout_nsamps, buf_cep, inout_nframes);
}
int
fe_process_utt(fe_t * fe, int16 const * spch, size_t nsamps,
mfcc_t *** cep_block, int32 * nframes)
{
mfcc_t **cep;
int rv;
/* Figure out how many frames we will need. */
fe_process_frames_int16(fe, NULL, &nsamps, NULL, nframes);
/* Create the output buffer (it has to exist, even if there are no output frames). */
if (*nframes)
cep = (mfcc_t **)ckd_calloc_2d(*nframes, fe->feature_dimension, sizeof(**cep));
else
cep = (mfcc_t **)ckd_calloc_2d(1, fe->feature_dimension, sizeof(**cep));
/* Now just call fe_process_frames() with the allocated buffer. */
rv = fe_process_frames_int16(fe, &spch, &nsamps, cep, nframes);
*cep_block = cep;
return rv;
}
int32
fe_end_utt(fe_t * fe, mfcc_t * cepvector, int32 * nframes)
{
/* Process any remaining data. */
if (fe->num_overflow_samps > 0) {
fe_read_frame_int16(fe, fe->overflow_samps,
fe->num_overflow_samps);
fe_write_frame(fe, cepvector);
*nframes = 1;
}
else {
*nframes = 0;
}
/* reset overflow buffers... */
fe->num_overflow_samps = 0;
return 0;
}
fe_t *
fe_retain(fe_t *fe)
{
++fe->refcount;
return fe;
}
int
fe_free(fe_t * fe)
{
if (fe == NULL)
return 0;
if (--fe->refcount > 0)
return fe->refcount;
/* kill FE instance - free everything... */
if (fe->mel_fb) {
if (fe->mel_fb->mel_cosine)
fe_free_2d((void *) fe->mel_fb->mel_cosine);
ckd_free(fe->mel_fb->lifter);
ckd_free(fe->mel_fb->spec_start);
ckd_free(fe->mel_fb->filt_start);
ckd_free(fe->mel_fb->filt_width);
ckd_free(fe->mel_fb->filt_coeffs);
ckd_free(fe->mel_fb);
}
ckd_free(fe->spch);
ckd_free(fe->frame);
ckd_free(fe->ccc);
ckd_free(fe->sss);
ckd_free(fe->spec);
ckd_free(fe->mfspec);
ckd_free(fe->overflow_samps);
ckd_free(fe->hamming_window);
if (fe->noise_stats)
fe_free_noisestats(fe->noise_stats);
ps_config_free(fe->config);
ckd_free(fe);
return 0;
}
/**
* Convert a block of mfcc_t to float32 (can be done in-place)
**/
int32
fe_mfcc_to_float(fe_t * fe,
mfcc_t ** input, float32 ** output, int32 nframes)
{
int32 i;
#ifndef FIXED_POINT
if ((void *) input == (void *) output)
return nframes * fe->feature_dimension;
#endif
for (i = 0; i < nframes * fe->feature_dimension; ++i)
output[0][i] = MFCC2FLOAT(input[0][i]);
return i;
}
/**
* Convert a block of float32 to mfcc_t (can be done in-place)
**/
int32
fe_float_to_mfcc(fe_t * fe,
float32 ** input, mfcc_t ** output, int32 nframes)
{
int32 i;
#ifndef FIXED_POINT
if ((void *) input == (void *) output)
return nframes * fe->feature_dimension;
#endif
for (i = 0; i < nframes * fe->feature_dimension; ++i)
output[0][i] = FLOAT2MFCC(input[0][i]);
return i;
}
int32
fe_logspec_to_mfcc(fe_t * fe, const mfcc_t * fr_spec, mfcc_t * fr_cep)
{
#ifdef FIXED_POINT
fe_spec2cep(fe, fr_spec, fr_cep);
#else /* ! FIXED_POINT */
powspec_t *powspec;
int32 i;
powspec = ckd_malloc(fe->mel_fb->num_filters * sizeof(powspec_t));
for (i = 0; i < fe->mel_fb->num_filters; ++i)
powspec[i] = (powspec_t) fr_spec[i];
fe_spec2cep(fe, powspec, fr_cep);
ckd_free(powspec);
#endif /* ! FIXED_POINT */
return 0;
}
int32
fe_logspec_dct2(fe_t * fe, const mfcc_t * fr_spec, mfcc_t * fr_cep)
{
#ifdef FIXED_POINT
fe_dct2(fe, fr_spec, fr_cep, 0);
#else /* ! FIXED_POINT */
powspec_t *powspec;
int32 i;
powspec = ckd_malloc(fe->mel_fb->num_filters * sizeof(powspec_t));
for (i = 0; i < fe->mel_fb->num_filters; ++i)
powspec[i] = (powspec_t) fr_spec[i];
fe_dct2(fe, powspec, fr_cep, 0);
ckd_free(powspec);
#endif /* ! FIXED_POINT */
return 0;
}
int32
fe_mfcc_dct3(fe_t * fe, const mfcc_t * fr_cep, mfcc_t * fr_spec)
{
#ifdef FIXED_POINT
fe_dct3(fe, fr_cep, fr_spec);
#else /* ! FIXED_POINT */
powspec_t *powspec;
int32 i;
powspec = ckd_malloc(fe->mel_fb->num_filters * sizeof(powspec_t));
fe_dct3(fe, fr_cep, powspec);
for (i = 0; i < fe->mel_fb->num_filters; ++i)
fr_spec[i] = (mfcc_t) powspec[i];
ckd_free(powspec);
#endif /* ! FIXED_POINT */
return 0;
}
|