本文中提出的改进的符号多项式模型方法能在一定程度上解决这一难题。
In this paper, a modified polynomial method is presented, which can solve this difficult problem to a certain degree.
由此，以多项式符号代数为理论基础，提出了一个高层次数据通路的等价验证算法。
So in this paper, a new algorithm for the equivalence verification of high-level data paths based on polynomial symbolic algebra is proposed.
但是，由于行列式中的元素通常是符号化的，即其中每个元素都是关于变元（或参数）的多项式，导致行列式展开时的中间计算过程膨胀（甚至爆炸）。
However, as each entry in the determinant is symbolic, that is, a polynomial in variable(s), this leads to the intermediate expression swell(or explosion) problem in the expansion of determinant.
使用多项式相消编码（PCC）训练符号进行信道估计，利用其频谱陡降的特点减少保护边带宽度，进而降低CIR泄漏。
To overcome the leakage of CIR, the frequency guard bands are reduced by using the polynomial cancellation coding(PCC) training symbols.
使用多项式相消编码（PCC）训练符号进行信道估计，利用其频谱陡降的特点减少保护边带宽度，进而降低CIR泄漏。
To overcome the leakage of CIR, the frequency guard bands are reduced by using the polynomial cancellation coding(PCC) training symbols.
应用推荐