大定源回线瞬变电磁法以其高效的工作方式,一直备受野外工作者青睐。这里从基本理论出发,给出了大定源回线发射源在均匀层状介质的电磁响应计算公式,利用Quadrature With Extrapolation(QWE)算法计算了线框内、外的垂向磁场响应,并将其...大定源回线瞬变电磁法以其高效的工作方式,一直备受野外工作者青睐。这里从基本理论出发,给出了大定源回线发射源在均匀层状介质的电磁响应计算公式,利用Quadrature With Extrapolation(QWE)算法计算了线框内、外的垂向磁场响应,并将其与传统的Fast Hankel Transform(FHT)算法进行了对比分析,两者对于虚部的计算都比较准确。当发射线框位于地表以上一定高度时,两者的计算结果吻合的较好。在发射线圈位于地表的时候,QWE算法的计算结果比较稳定,适用性优于FHT。展开更多
This paper presents a method for the computation of the Stokes for-mula using the Fast Hartley Transform（FHT）techniques.The algorithm is mostsuitable for the computation of real sequence transform,while the Fast Fou...This paper presents a method for the computation of the Stokes for-mula using the Fast Hartley Transform（FHT）techniques.The algorithm is mostsuitable for the computation of real sequence transform,while the Fast FourierTransform（FFT）techniques are more suitable for the computaton of complex se-quence transform.A method of spherical coordinate transformation is presented inthis paper.By this method the errors,which are due to the approximate term inthe convolution of Stokes formula,can be effectively eliminated.Some numericaltests are given.By a comparison with both FFT techniques and numerical integra-tion method,the results show that the resulting values of geoidal undulations byFHT techniques are almost the same as by FFT techniques,and the computation-al speed of FHT techniques is about two times faster than that of FFT techniques.展开更多
A more efficient permutation algorithm which has less computer operation and better structure is presented here for radix-2 FFT(FHT). It can fasten the FFT and FHT efficiently when N becomes large.
The ＇polar coding＇ proposed by Dr. Ankan can achieve channels （B-DMC）. The generator matrix of polar codes is the symmetric capacity of binary-input discrete memoryless Gu = BuF^n for N=2n, BN was a permutation ma...The ＇polar coding＇ proposed by Dr. Ankan can achieve channels （B-DMC）. The generator matrix of polar codes is the symmetric capacity of binary-input discrete memoryless Gu = BuF^n for N=2n, BN was a permutation matrix. In the article it was realized with an interleaver, so the matrix production of GN was avoided; then the generator matrix was just determined by the matrix F^n which was constructed with three sub-matrixes of F^n-1 and one 2^N-1 order zero matrix, it was deal with fast Hadamard transform （FHT） algorithm. The complexity of the new scheme was reduced sharply, and an iterative algorithm also can be used. The example showed that when N=8, complexity of the encoding scheme was just 16 which is obviously less than that of original encoding scheme 36.展开更多
文摘大定源回线瞬变电磁法以其高效的工作方式,一直备受野外工作者青睐。这里从基本理论出发,给出了大定源回线发射源在均匀层状介质的电磁响应计算公式,利用Quadrature With Extrapolation(QWE)算法计算了线框内、外的垂向磁场响应,并将其与传统的Fast Hankel Transform(FHT)算法进行了对比分析,两者对于虚部的计算都比较准确。当发射线框位于地表以上一定高度时,两者的计算结果吻合的较好。在发射线圈位于地表的时候,QWE算法的计算结果比较稳定,适用性优于FHT。
文摘This paper presents a method for the computation of the Stokes for-mula using the Fast Hartley Transform（FHT）techniques.The algorithm is mostsuitable for the computation of real sequence transform,while the Fast FourierTransform（FFT）techniques are more suitable for the computaton of complex se-quence transform.A method of spherical coordinate transformation is presented inthis paper.By this method the errors,which are due to the approximate term inthe convolution of Stokes formula,can be effectively eliminated.Some numericaltests are given.By a comparison with both FFT techniques and numerical integra-tion method,the results show that the resulting values of geoidal undulations byFHT techniques are almost the same as by FFT techniques,and the computation-al speed of FHT techniques is about two times faster than that of FFT techniques.
文摘A more efficient permutation algorithm which has less computer operation and better structure is presented here for radix-2 FFT(FHT). It can fasten the FFT and FHT efficiently when N becomes large.
基金supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China(2012ZX03001025-004)the National Natural Science Foundation of China (61271276)the Natural Science Foundation of Shaanxi Education Bureau (09Jk726)
文摘The ＇polar coding＇ proposed by Dr. Ankan can achieve channels （B-DMC）. The generator matrix of polar codes is the symmetric capacity of binary-input discrete memoryless Gu = BuF^n for N=2n, BN was a permutation matrix. In the article it was realized with an interleaver, so the matrix production of GN was avoided; then the generator matrix was just determined by the matrix F^n which was constructed with three sub-matrixes of F^n-1 and one 2^N-1 order zero matrix, it was deal with fast Hadamard transform （FHT） algorithm. The complexity of the new scheme was reduced sharply, and an iterative algorithm also can be used. The example showed that when N=8, complexity of the encoding scheme was just 16 which is obviously less than that of original encoding scheme 36.
