~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

Open Mash Cross Reference
mash/audio/gsm.h

Component: ~ [ mash ] ~ [ apps ] ~ [ gsm ] ~ [ lib ] ~ [ otcl ] ~ [ srm ] ~ [ tcl8.3 ] ~ [ tclcl ] ~ [ tk8.3 ] ~ [ tutorials ] ~

  1 /*
  2  * gsm.h --
  3  *
  4  *      FIXME: This file needs a description here.
  5  *
  6  * Copyright (c) 1996-2002 The Regents of the University of California.
  7  * All rights reserved.
  8  *
  9  * Redistribution and use in source and binary forms, with or without
 10  * modification, are permitted provided that the following conditions are met:
 11  *
 12  * A. Redistributions of source code must retain the above copyright notice,
 13  *    this list of conditions and the following disclaimer.
 14  * B. Redistributions in binary form must reproduce the above copyright notice,
 15  *    this list of conditions and the following disclaimer in the documentation
 16  *    and/or other materials provided with the distribution.
 17  * C. Neither the names of the copyright holders nor the names of its
 18  *    contributors may be used to endorse or promote products derived from this
 19  *    software without specific prior written permission.
 20  *
 21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
 22  * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 23  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 24  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE
 25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 31  * POSSIBILITY OF SUCH DAMAGE.
 32  */
 33 
 34 #ifndef VAT_GSM_H
 35 #define VAT_GSM_H
 36 
 37 #ifndef PRIVATE_H
 38 typedef short           word;                   /* 16 bit signed int    */
 39 typedef int             longword;               /* 32 bit signed int    */
 40 
 41 typedef unsigned short  uword;                  /* unsigned word        */
 42 typedef unsigned int    ulongword;              /* unsigned longword    */
 43 
 44 struct gsm_state {
 45 
 46         word            dp0[ 280 ];
 47 
 48         word            z1;             /* preprocessing.c, Offset_com. */
 49         longword        L_z2;           /*                  Offset_com. */
 50         int             mp;             /*                  Preemphasis */
 51 
 52         word            u[8];           /* short_term_aly_filter.c      */
 53         word            LARpp[2][8];    /*                              */
 54         word            j;              /*                              */
 55 
 56         word            ltp_cut;        /* long_term.c, LTP crosscorr.  */
 57         word            nrp; /* 40 */   /* long_term.c, synthesis       */
 58         word            v[9];           /* short_term.c, synthesis      */
 59         word            msr;            /* decoder.c,   Postprocessing  */
 60 
 61         char            verbose;
 62         char            fast;
 63 };
 64 #endif
 65 
 66 typedef struct gsm_state        gsm_state;
 67 typedef unsigned char           gsm_byte;
 68 typedef unsigned char           ulaw_byte;
 69 
 70 #define GSM_MAGIC       0xD                             /* 13 kbit/s RPE-LTP */
 71 
 72 extern void Vat_Gsm_InitS(gsm_state *);
 73 extern void Vat_Gsm_InitR(gsm_state *);
 74 extern void Vat_Gsm_Encoder(gsm_state *, const ulaw_byte *, gsm_byte*);
 75 extern void Vat_Gsm_Decoder(gsm_state *, ulaw_byte *, const gsm_byte *);
 76 
 77 #endif  /* GSM_H */
 78 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

This page was automatically generated by the LXR engine.
Visit the LXR main site for more information.