📄 logarearatio.h
字号:
// file: $isip/class/algo/LogAreaRatio/LogAreaRatio.h// version: $Id: LogAreaRatio.h,v 1.8 2002/01/22 20:45:05 zheng Exp $//// make sure definitions are only made once//#ifndef ISIP_LOG_AREA_RATIO#define ISIP_LOG_AREA_RATIO// isip include files//#ifndef ISIP_ALGORITHM_BASE#include <AlgorithmBase.h>#endif#ifndef ISIP_REFLECTION#include <Reflection.h>#endif// LogAreaRatio: a class that computes the log-area-ratio of a// signal. the input signal can either be the reflection coefficients// or the prediction coefficients. LATTICE algorithm and// KELLY_LOCHBAUM implementation have currently been supported.//class LogAreaRatio : public AlgorithmBase { //--------------------------------------------------------------------------- // // public constants // //---------------------------------------------------------------------------public: // define the class name // static const String CLASS_NAME; //---------------------------------------- // // other important constants // //---------------------------------------- // define the algorithm choices // enum ALGORITHM { LATTICE = 0, DEF_ALGORITHM = LATTICE }; // define the implementation choices // enum IMPLEMENTATION { KELLY_LOCHBAUM = 0, DEF_IMPLEMENTATION = KELLY_LOCHBAUM }; // define the static NameMap objects // static const NameMap ALGO_MAP; static const NameMap IMPL_MAP; //---------------------------------------- // // i/o related constants // //---------------------------------------- static const String DEF_PARAM; static const String PARAM_ALGORITHM; static const String PARAM_IMPLEMENTATION; //---------------------------------------- // // default values and arguments // //---------------------------------------- // define the default value(s) of the class data // static const long DEF_ORDER = -1; // define default argument(s) // static const AlgorithmData::COEF_TYPE DEF_COEF_TYPE = AlgorithmData::REFLECTION; //---------------------------------------- // // error codes // //---------------------------------------- static const long ERR = 70500; //--------------------------------------------------------------------------- // // protected data // //---------------------------------------------------------------------------protected: // algorithm name // ALGORITHM algorithm_d; // implementation name // IMPLEMENTATION implementation_d; // specify the analysis order // Long order_d; // static memory manager // static MemoryManager mgr_d; //--------------------------------------------------------------------------- // // required public methods // //---------------------------------------------------------------------------public: // method: name // static const String& name() { return CLASS_NAME; } // other static methods // static boolean diagnose(Integral::DEBUG debug_level); // method: setDebug // this method is inherited from the AlgorithmBase class // other debug methods // boolean debug(const unichar* msg) const; // method: destructor // ~LogAreaRatio() {} // method: default constructor // LogAreaRatio(ALGORITHM algorithm = DEF_ALGORITHM, IMPLEMENTATION implementation = DEF_IMPLEMENTATION, long order = DEF_ORDER) { algorithm_d = algorithm; implementation_d = DEF_IMPLEMENTATION; order_d = order; is_valid_d = false; } // method: copy constructor // LogAreaRatio(const LogAreaRatio& arg) { assign(arg); } // assign methods // boolean assign(const LogAreaRatio& arg); // method: operator= // LogAreaRatio& operator= (const LogAreaRatio& arg) { assign(arg); return *this; } // i/o methods // long sofSize() const; boolean read(Sof& sof, long tag, const String& name = CLASS_NAME); boolean write(Sof& sof, long tag, const String& name = CLASS_NAME) const; boolean readData(Sof& sof, const String& pname = DEF_PARAM, long size = SofParser::FULL_OBJECT, boolean param = true, boolean nested = false); boolean writeData(Sof& sof, const String& pname = DEF_PARAM) const; // equality methods // boolean eq(const LogAreaRatio& arg) const; // method: new // static void* operator new(size_t size) { return mgr_d.get(); } // method: new[] // static void* operator new[](size_t size) { return mgr_d.getBlock(size); } // method: delete // static void operator delete(void* ptr) { mgr_d.release(ptr); } // method: delete[] // static void operator delete[](void* ptr) { mgr_d.releaseBlock(ptr); } // method: setGrowSize // static boolean setGrowSize(long grow_size) { return mgr_d.setGrow(grow_size); } // other memory management methods // boolean clear(Integral::CMODE ctype = Integral::DEF_CMODE); //--------------------------------------------------------------------------- // // class-specific public methods: // set methods // //--------------------------------------------------------------------------- // method: setAlgorithm // boolean setAlgorithm(ALGORITHM algorithm) { algorithm_d = algorithm; is_valid_d = false; return true; } // method: setImplementation // boolean setImplementation(IMPLEMENTATION implementation) { implementation_d = implementation; is_valid_d = false; return true; } // method: setOrder // boolean setOrder(long order) { order_d = order; is_valid_d = false; return true; } // method: set // boolean set(ALGORITHM algorithm = DEF_ALGORITHM, IMPLEMENTATION implementation = DEF_IMPLEMENTATION, long order = DEF_ORDER) { algorithm_d = algorithm; implementation_d = implementation; order_d = order; is_valid_d = false; return true; } //--------------------------------------------------------------------------- // // class-specific public methods: // get methods // //--------------------------------------------------------------------------- // method: getAlgorithm // ALGORITHM getAlgorithm() const { return algorithm_d; } // method: getImplementation // IMPLEMENTATION getImplementation() const { return implementation_d; } // method: getOrder // long getOrder() const { return order_d; } // method: get // boolean get(ALGORITHM& algorithm, IMPLEMENTATION& implementation, long& order) { algorithm = algorithm_d; implementation = implementation_d; order = order_d; return true; } //--------------------------------------------------------------------------- // // class-specific public methods: // computational methods // //--------------------------------------------------------------------------- boolean compute(VectorFloat& output, const VectorFloat& input, AlgorithmData::COEF_TYPE input_coef_type = DEF_COEF_TYPE, long index = DEF_CHANNEL_INDEX); //--------------------------------------------------------------------------- // // class-specific public methods: // public methods required by the AlgorithmBase interface contract // //--------------------------------------------------------------------------- // assign method // boolean assign(const AlgorithmBase& arg); // equality method // boolean eq(const AlgorithmBase& arg) const; // method: className // const String& className() const { return CLASS_NAME; } // apply method // boolean apply(Vector<AlgorithmData>& output, const Vector< CircularBuffer<AlgorithmData> >& input); // method to set the parser // boolean setParser(SofParser* parser); //--------------------------------------------------------------------------- // // private methods // //---------------------------------------------------------------------------private: // common i/o methods // boolean readDataCommon(Sof& sof, const String& pname = DEF_PARAM, long size = SofParser::FULL_OBJECT, boolean param = true, boolean nested = false); boolean writeDataCommon(Sof& sof, const String& pname = DEF_PARAM) const; // common compute method // boolean computeLatticeKellyLochbaum(VectorFloat& output, const VectorFloat& input, AlgorithmData::COEF_TYPE input_coef_type = DEF_COEF_TYPE);};// end of include file// #endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -