并研究了基于此类FRM结构FIR滤波器的采样率变换算法、实现结构、计算复杂度及其设计问题等。
Then, the sampling rate alteration method based on FIR filter with FRM structure, its architecture, computational complexity and the problem in designing are studied.
实验证明，基于3维小波变换的3维SPIHT编码算法在对超光谱图像压缩时，表现出了优良的率失真性能。 并且算法复杂度适中，具有嵌入式特性。
The test results show that the 3D SPIHT algorithm based on 3D DWT for hyperspectral images compression is very efficient, the algorithm is embedded and has modest complexity.
提出了一种基于小波变换域的块匹配运动估计搜索的新算法，模拟实验表明，利用此算法可获得比一般运动块匹配方法更大的峰值信噪比，具有更好的性能复杂度比。
The authors present a new algorithm for block-matching motion estimation based on wavelet transform. The simulation shows that this algorithm has better PSNR and performance-to-complexity ratio.
在设计方向滤波器时，对滤波器的旋转引入了方—圆变换的方法，进而减少了计算的复杂度，同时避免引入误差。
While designing orientation filter, we introduced the square-circle transform to rotate filter, thus we reduced computing complexity and avoided imported errors.
基于对数字电视地面传输系统复杂度和性能代价的综合考虑，提出以符号变换为基础的IC I自消除模块替换卷积码模块。
Based on synthesis consideration of complexity and performance cost, this paper proposed a modified scheme of using the ICI self-cancellation module to replace the convolutional coding module.
然后对解码器进行复杂度分析，找出解码耗时的关键部分分别为运动补偿、反变换、环路滤波等模块。
Then analyses the complexity of AVS decoder and finds out the the critical modules are motion compensation, integer transform, quantization and loop filter.
对感兴趣区域(ROI)进行无损压缩编码过程中，采用整数小波变换然后进行算术编码的方案降低运算复杂度、保证图像质量。
In the process of compressing the ROI, to decrease the complexity of computation and ensure the quality of the image, integer wavelets transform and arithmetic algorithm are used.
为此，我们引入过程蓝图改进该方法，降低程序的空间复杂度，并避免将源代码变换为后缀树这一复杂过程。
In order to reduce the space complexity of the arithmetic and avoid transforming the source code top-suffix tree, the method is improved based-on process blueprint.
利用延拓矩阵范数的理论与性质，并结合矩阵范数与图像小波变换低频分量稳健性的特点，提出了一种低复杂度的无损水印方案。
Using robust property of matrix norms and DWT for low frequency component, a new lossless watermarking method with low computational complexity via the theory and property and wavelet is proposed.
给出了用离散余弦变换(DCT)实现的快速算法及复杂度，并考查了最优基的选取。
The fast algorithm based on discrete cosine transform (DCT) and its complexity are obtained and the selection of the best basis is discussed.
针对上述情况，提出了通过局部空间变换的方法，简化直线段之间的求交过程，且在一定程度上可降低算法的复杂度，提高算法的效率。
Our study established a method called "Local space transform", can simplify the procession of intersection between line segments, improve the efficiency and decrease the complicacy.
为了用较低算法复杂度使数字水印具有较好的鲁棒性与掩蔽性，提出了一种基于整数DCT变换的新的鲁棒水印算法。
In order to design a complicated scheme with both preferable robustness and invisibility with low complexity, in this paper, a new watermarking based on Integer DCT scheme is proposed.
其控制算法与交—直—交变换器控制算法的复杂度相当，电压传输比在理论上可达到0.955。
The complexity of control strategy is equivalent with that of ac-dc-ac converter, and the voltage transfer ratio is theoretically up to 0.955.
最后简要介绍了实现3780点快速傅立叶变换(FFT)的算法。其计算复杂度和容量复杂度都与标准的4096点FFT算法相当。
Finally a3780-point FFT algorithm is introduced in brief, whose capacity complexity and computation complexity are close to the conventional4096-point FFT.
最后简要介绍了实现3780点快速傅立叶变换(FFT)的算法。其计算复杂度和容量复杂度都与标准的4096点FFT算法相当。
Finally a3780-point FFT algorithm is introduced in brief, whose capacity complexity and computation complexity are close to the conventional4096-point FFT.
应用推荐