1) g-circulant matrix
g循环矩阵
2) g-circulant matricx
g-循环矩阵
1.
In this paper,an algorithm is given for solving g-circulant matricx multiple by using the Distributed Fast Fourier Transform(DFT),and its computation time complexity is O(nlog2n).
利用快速离散傅立叶变换(DFT)给出了n阶g-循环矩阵相乘的快速算法,它的时间复杂性是O(nlog2n)。
4) m-g lump cyclic matrices
m-g块循环矩阵
5) elementary strong g-circulant matrices
初等强g-循环矩阵
6) circulant matrices
循环矩阵
1.
Eigenvalues of a kind of circulant matrices and its application on subdivision;
一类循环矩阵的特征值及其在细分方法中的应用
2.
VLSI decoding design of low-density parity-check codes based on circulant matrices
基于循环矩阵的低密度校验码的VLSI译码设计
3.
Making use of some relations between discrete Fourier transformation and convolution, I give a sufficiency and necessary condition which estimates that a matrix is a circulant matrix, and give concretely an accounting formula of m-orders circulant matrices.
利用离散Fourier变换与卷积的关系,给出了判断一个矩阵为循环矩阵的充要条件,并具体给出了一种求循环矩阵的m次幂通项的计算公式。
补充资料：循环系统的进化鱼的循环系统
李瑞端绘
[图]
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条