计算Stokes公式的快速Hartley变换(FHT)技术

本文提出了利用快速Hartley变换(FHT)计算Stokes公式的方法,这一算法最适合于用来计算实序列的积分变换,而快速Fourier变换(FFT)较适合于用来计算复序列的积分变换。计算Stokes公式只涉及实序列问题,用FHT计算Stokes公式比用FFT算法更有效。本文详细地描述了用FHΥ计算Stokes公式的算法,进行了数值计算,与相应的FFT计算结果作了比较。结果表明,两种算法可以得到相同的精度,但是,FHT的计算速度比FFT的计算速度快一倍以上,且所需要的内存空间只是后者的一半。     

便携式多波束测深系统波束形成快速算法与试验数据处理

便携式多波束测深系统既要保证测深精度的基本要求,又要尽可能减小设备体积、降低造价。FFT波束形成技术作为一种有效提高波束数目的手段,能够在DSP上实现,并且有很高的计算效率,有效解决了这一问题。本文对FFT波束形成算法进行了仿真,通过处理湖试数据,验证该算法的有效性,为解决多波束测深系统的小型化问题提供了技术支撑。     

区域地磁场的连续傅里叶分析建模方法

研究了利用快速傅里叶(FFT)拟合方法建立连续局部地磁场模型,给出了详细的计算方法.建立的局部地磁场表达式是连续的且形式十分简明,有利于地磁匹配辅助惯性导航的实现.最后,给出了某一地磁异常场的实例,用FFT拟合方法建立了局部地磁异常场模型并与传统的Taylor多项式建模方法进行了比较.仿真结果表明,FFT拟合建模方法精...     

基于FFT稀疏压缩感知域内遥感图像融合

压缩感知理论因其远低于乃奎斯特采样率的特性,减少了大量的采样数据。基于这一特性,提出一种在压缩感知域内进行遥感图像融合的方法。该方法首先对图像作快速傅里叶变换(FFT);然后进行测量采样获取压缩感知域数据;再采用权重法对数据进行融合;最后通过重构算法得到融合图像。通过实验得出压缩感知域内遥感图像融合具有数据量少,融合效果好等特点。     

基于部分输出FFT的CSK信号高效解调算法CSCD

为了实现精密星历数据的高速率播发,码移键控(CSK)调制技术将是下一代卫星导航系统的重要选项.CSK调制信号在解调时需要遍历计算各种码相位偏移的相关值,因此通常使用基于快速傅里叶变换(FFT)的频域解调算法.根据CSK频域解调仅需FFT部分输出结果的特点,提出了基于部分输出FFT的CSK信号频域解调算法.该算法对传统FFT的蝶形解算结构进行优化,通过定义计算节点以消除与输出结果无关的计算,从而降低解调的计算复杂度.以码率为1.023 Mcps的CSK(4,1023)调制信号为例,所提算法可节省约45.6%的计算量,这对下一代卫星导航接收机的设计具有重要的意义.     

重力梯度向量化调和分析的FFT算法

在利用卫星重力梯度数据求解地球重力场模型位系数时,为进一步提高调和分析法的计算效率,推导出了利用5种组合{Tzz}、{Txx+Tyy}、{Tzz-Txx-Tyy}、{Txz,Tyz}、{Txx,Tyy,Txy}构建重力场模型位系数的向量化调和分析法和向量化调和分析的FFT算法.实验表明,利用30′×30′格网Tzz数据最快可在1 s内反演300阶次重力场模型.与传统FFT算法相比,向量化调和分析的FFT算法计算效率最高可提高16倍.     

由重力场模型快速计算沿轨重力梯度观测值

提出了利用高阶地球重力场模型快速模拟GOCE卫星重力梯度沿轨道观测值的方法.首先,由快速傅立叶变换(fast Fourier transform,FFT)技术快速计算球面格网数据;然后,用球面格网数据内插沿卫星轨道重力梯度观测值.由球谐展开式直接计算的沿轨观测值与内插得到的观测值的比较结果说明,该方法快速有效.     

基于快速傅立叶变换的干涉SAR基线估计

首先论述干涉SAR初始基线估计的基本原理；接着对用2维快速傅立叶变换（FFT）功率谱进行干涉SAR初始基线估计的具体算法进行了详细阐述；最后，基于1994年10月9日和10日的SIR－C L波段单视复雷达数据，用该算法进行了干涉SAR初始基线的垂直分量估计，并结合用航天飞机轨道数据得到的初始基线平行分量估计值进行去平地相位的试验。将结果与只用航天飞机轨道数据得到的初始基线进行去平地相位的结果及本区域的地形图进行比较分析。     

GPS中频信号快速捕获技术分析

为解决GPS中频信号快速捕获问题,在介绍GPS码相位和载频信号捕获原理的基础上,重点阐述了基于FFT的并行GPS中频信号快速捕获方法,同时在非相干累加、接收信噪比、先验信息等方面分析了提高中频信号快速捕获的可能性,最后利用一组GPS实测数据对上述分析进行了的仿真计算。仿真结果表明基于FFT技术的中频信号快速捕获方法具有抗干扰、捕获速度快和检测低信噪比信号的能力,可以满足GPS软件接收机定位的要求。     

一种消除stokes积分卷积化近似误差影响的有效方法

在应用快速Hartly变换(FHT)或快速Fourier变换(FFT)计算Stokes积分公式时,总是先将Stokes 公式化成卷积形式,然后用 FHT或 FFT完成卷积运算,从而避免了复杂费时的积分计算。但由于 Stokes公式不严格满足卷积定义,欲将其化成卷积形式必须作一些近似。这种近似虽能在一定精度范围满足要求,但对于高精度要求仍有不能允许的计算误差。本文建议采用球面坐标转换方法,能有效地消除无论是用 FHT或 FFT 计算Stokes 积分卷积化所带来的误差影响。     

在FFT中实现同址运算的一种快速方法

提出了一种在时间抽取和频率抽取的基－２ＦＦＴ算法中实现同址运算的快速方法。以一维的ＦＦＴ为例来说明这个方法的应用,给出了用Ｃ语言编制的程序。     

APPLICATION OF THE HARTLEY TRANSFORM IN THE COMPUTATION OF THE GEOID IN CHINA

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.     

On the evaluation of deflections of the vertical using FFT technique

There exist three types of convolution formulae for the efficient evaluation of gravity field convolution integrals, i.e., the planar 2D convolution, the spherical 2D convolution and the spherical 1D convolution. The largest drawback of both the planar and the spherical 2D FFT methods is that, due to the approximations in the kernel function, only inexact results can be achieved. Apparently, the reason is the meridian convergence at higher latitudes. As the meridians converge, the ??,?λ blocks do not form a rectangular grid, as is assumed in 2D FFT methods. It should be pointed out that the meridian convergence not only leads to an approximation error in the kernel function, but also causes an approximation error during the implementation of 2D FFT in computer. In order to meet the increasing need for precise determination of the vertica deflections, this paper derives a more precise planar 2D FFT formula for the computation of the vertical deflections. After having made a detailed comparison between the planar and the spherical 2D FFT formulae, we find out the main source of errors causing the loss in accuracy by applying the conventional spherical 2D FFT method. And then, a modified spherical 2D FFT formula for the computation of the vertical deflections is developed in this paper. A series of numerical tests have been carried out to illustrate the improvement made upon the old spherical 2D FFT. The second part of this paper is to discuss the influences of the spherical harmonic reference field, the limited capsize, and the singular integral on the computation of the vertical deflections. The results of the vertical deflections over China by applying the spherical 1D FFT formula with different integration radii have been compared to the astro-observed vertical deflections in the South China Sea to obtain a set of optimum deflection computation parameters.     

ON THE EVALUATION OF DEFLECTIONS OF THE VERTICAL USING FFT TECHNIQUE

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｆａｓｔＦｏｕｒｉｅｒｔｒａｎｓｆｏｒｍ (ＦＦＴ)ｔｅｃｈｎｉｑｕｅｉｓａｖｅｒｙｐｏｗｅｒｆｕｌｔｏｏｌｆｏｒｔｈｅｅｆｆｉｃｉｅｎｔｅｖａｌｕａｔｉｏｎｏｆｇｒａｖｉｔｙｆｉｅｌｄｃｏｎｖｏｌｕｔｉｏｎｉｎｔｅｇｒａｌｓ.Ｔｈａｎｋｓｔｏｔｈｅｇｏｏｄｃｏｍｐｕｔａｔｉｏｎｅｆｆｉｃｉｅｎｃｙ ,ｔｈｅＦＦＴｔｅｃｈｎｉｑｕｅ ,ｉｎｔｈｅｍｉｄ＿1 980ｓ ,ｂｅｇａｎｔｏｆｉｎｄｗｉｄｅｓｐｒｅａｄｕｓｅｉｎｇｅｏｉｄｄｅｔｅｒｍｉｎａｔｉｏｎ ,ｗｈｅｎｃｏｍｐａｒ…     

积分半径可控地形改正FFT算法的研究

地形改正等地球重力场元量的FFT算法(平面二维、球面近似二维、球面单带)研究已基本成熟,并广泛应用于科研与工程实践。但是FFT算法也有其固有的缺陷,即存在着频谱混迭、泄漏等现象。本文利用离散卷积分具有Toeplitz矩阵的性质,将其拓展为循环Toeplitz与拓展观测数据矢量的乘积,利用循环Toeplitz的Fourier表示,实现离散卷积分的快速算法。该算法与离散求和等价,当数据量较大时,可明显地提高计算速度。     

基于预平均处理的导航信号捕获技术

针对传统导航信号捕获算法资源消耗大、多普勒分辨率低的问题,提出了一种基于预平均处理的变系数匹配滤波的快速捕获方法. 该方法将经过预平均处理后的导航中频信号和本地信号主码存入相应存储器,然后经变系数匹配滤波器完成相关累加,再经快速傅里叶变换(FFT)频率估计器完成数据的频谱分析,最后利用验证模块对FFT输出结果的最大值进行二次验证,完成捕获检测. 所提方法在达到相同积分时间的同时节省了50%硬件资源,能够提高捕获多普勒分辨率以提高转跟踪成功率,通过软件灵活配置可以实现多系统多频点全球卫星导航系统(GNSS)信号的兼容处理.      

Determination of Precise Instantaneous Height at Multibeam Transducer

To overcome the shortcomings of the traditional multibeam survey and data processing, a new method is presented for the precise determination of the instantaneous height at the multibeam transducer by ...     

Comparison of Two Data Smoothing Techniques for Vegetation Spectra Derived From EO-1 Hyperion

Hyperspectral data are generally noisier compared to broadband multispectral data because their narrow bandwidth can only capture very little energy that may be overcome by the self-generated noise inside the sensors. It is desirable to smoothen the reflectance spectra. This study was carried out to see the effect of smoothing algorithms - Fast-Fourier Transform (FFT) and Savitzky–Golay (SG) methods on the statistical properties of the vegetation spectra at varying filter sizes. The data used in the study is the reflectance spectra data obtained from Hyperion sensor over an agriculturally dominated area in Modipuram (Uttar Pradesh). The reflectance spectra were extracted for wheat crop at different growth stages. Filter sizes were varied between 3 and 15 with the increment of 2. Paired t-test was carried out between the original and the smoothed data for all the filter sizes in order to see the extent of distortion with changing filter sizes. The study showed that in FFT, beyond filter size 11, the number of locations within the spectra where the smooth spectra were statistically different from its original counterpart increased to 14 and reaches 21 at the filter size 15. However, in SG method, number of statistically different locations were more than those found in the FFT, but the number of locations did not changing drastically. The number of statistically disturbed locations in SG method varied between 16 and 19. The optimum filter size for smoothing the vegetation spectra was found to be 11 in FFT and 9 in SG method.     

NUFFT-Based Iterative Reconstruction Algorithm for Synthetic Aperture Imaging Radiometers

Synthetic aperture imaging radiometers (SAIRs) are powerful sensors for high-resolution observation of the Earth at low microwave frequencies. However, the future application of this new technology is limited by its large number of element antennas and receiving channels. In order to further reduce the complexity of the whole system, the circular and rotating array configurations have been proposed. Their disadvantages lie primarily in more complicated image reconstruction, because the conventional fast Fourier transform (FFT) method could not be used directly for image reconstruction. This letter introduces an iterative method for the reconstruction of radiometric brightness temperature maps from nonuniform visibility function samples. This method combines the conjugate gradient algorithm with min-max nonuniform FFT approach, which has been shown to provide considerably improved image quality relative to the traditional gridding method. Simulations for SAIRs were performed and showed better image quality in comparison to the traditional frequency interpolation method.