算法对信号进行局部余弦变换时采用动态规划算法计算最佳局部余弦树，通过获得信号在时间轴上的最佳划分来获得信号的最优嫡编码。
In this algorithm, dynamic programming is used to calculate optimal local cosine tree during the LCT for signals, and the optimal entropy code is gained by the best partition of time axes.
本文改进的偶函数和奇函数的AFT算法还分别可以用来计算离散余弦变换(DCT)和离散正弦变换(DST)。
The improved AFT algorithms for even and odd functions can also be used for computing discrete cosine transform (DCT) and discrete sine transform (DST), respectively.
本文在研究DCT快速算法的基础上，比较了32点dct分解和利用余弦函数特性两种快速计算dct的方法。
This paper compares between the 32-point DCT decomposition method and the property of cosine function to find the latter more efficient for DCT fast algorithm.
通过沿时间轴对采样信号加窗的方式构造向量集合，利用余弦相似度进行向量间亲合度的匹配计算，实现在实数域进行匹配计算的实数值负向选择算法。
The matching affinity between two vectors was measured using cosine similarity to develop a real-valued negative selection algorithm with the matching calculation in the real domain.
摘要：CORDIC算法是实现快速精确的正、余弦函数计算的主要方法，在工程实际中有着广泛应用。
Absrtact: CORDIC (Coordinate Rotation Digital Computer) algorithm is the main method to realize the fast and accurate trigonometric function, and is widely used in modern engineering.
摘要：CORDIC算法是实现快速精确的正、余弦函数计算的主要方法，在工程实际中有着广泛应用。
Absrtact: CORDIC (Coordinate Rotation Digital Computer) algorithm is the main method to realize the fast and accurate trigonometric function, and is widely used in modern engineering.
应用推荐