结果表明，合理地选择连接块的复杂度可以有效地降低功耗。
The result shows that reasonable selection of connection block flexibility can effectively lower power consumption.
之前每个if块占用3行代码（并贡献了1 个点的圈复杂度）。
Each of the former if blocks took 3 lines of code (and contributed 1 cyclomatic complexity point).
提出了一种基于小波变换域的块匹配运动估计搜索的新算法，模拟实验表明，利用此算法可获得比一般运动块匹配方法更大的峰值信噪比，具有更好的性能复杂度比。
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.
为了减少块匹配过程中每个待匹配位置的运算次数，保持块匹配的精度，又引入了连续排除算法，降低了计算复杂度。
In order to reduce the calculation number of matching position and keep the precision, we make use of the successive elimination algorithm. Therefore, the complexity was reduced.
对于PS K调制下的空频块码，复数球形译码相对实数球形译码有较低的复杂度。
The complex sphere decoding has lower complexity compared with real sphere decoding for space-frequency block codes with PSK modulation.
提出了基于宏块空间复杂度的宏块类型判断算法，有效地降低了视频压缩算法的计算复杂度。
Macro Block (MB) type judging algorithm is proposed based on MB′s space complexity. It reduces effectively the computational complexity of the video compression.
利用时空掩盖效应计算视频帧的复杂度与宏块的感知度。
The spatial and temporal masking effect is used to compute the frame complexity and the MB focus.
在保持了该算法快速收敛优点的同时，利用相关矩阵块三对角的特殊结构，降低了该算法的计算复杂度。
This new method reduces the computational complexity by using the block tridiagonal structure of the input sample correlation matrix, and at the same time keeps the property of fast convergence.
该算法比已有的块三对角矩阵求逆算法的计算复杂度和计算时间低。
The computing complexity and computing time of this algorithm is lower than that of existed algorithms.
根据各个块模式和纹理复杂度，采用不同的零块预先判决算法和及时终止策略。
Then, based on each block's size and texture complexity, the proposed algorithm intelligently USES different all zero block detection methods and early termination strategies.
研究表明：由正交块循环矩阵构造出的多路寻址驱动矩阵的实现复杂度由原来的与矩阵的阶数平方成正比下降为与矩阵的阶数成正比。
It is indicated by the research that making up driving matrix of MLA-LCD by Orthogonal Block Circulant matrix can make the design scale down from square of matrix dimension to matrix dimension.
本文给出了一种基于宏块的差图像直方图法，并根据图像复杂度在编码单元之间合理分配比较率。
First of all, a macroblock-based histogram of difference is introduced, and bits are allocated rationally among coding units according to image complexities.
为了得到最优模式，H . 264采用了率失真优化(rdo)技术计算宏块的每种模式的代价，但是这样增加了计算复杂度。
In order to gain the optimal mode, H. 264 adopts Rate Distortion Optimization (RDO) technique to compute the cost of every mode for each macroblock, but it increases computational complexity.
针对帧内预测宏块，提出了“参考块缩放法”，在不明显增加解码复杂度的情况下，有效减少误差漂移。
And the method of reference block scaling was proposed for inter coded macroblocks, which can reduce error drift effectively without increasing decoding complexity.
针对帧内预测宏块，提出了“参考块缩放法”，在不明显增加解码复杂度的情况下，有效减少误差漂移。
And the method of reference block scaling was proposed for inter coded macroblocks, which can reduce error drift effectively without increasing decoding complexity.
应用推荐