In this paper, a new fast algorithm to calculate discrete cosine transform (DCT) with arbitrary length by means of the butterfly structure is presented.
本文提出离散余弦变换(DCT)的一种新的快速算法，其特点是变换长度任意，而且采用蝶形结构。
The properties of the wavelet transform and the discrete dyadic wavelet transform are discussed and a fast wavelet algorithm for one-dimensional signals is described.
论述了连续小波变换和离散小波变换的性质、方法，介绍了离散二进小波变换的快速算法。
In this paper, we extend the idea of DEDS (Discrete Event Dynamie System) theory and present a fast parallel algorithm for communication network random simulation.
引入现代控制科学离散事件动态系统摄动分析思想，提出通信网络随机模拟的快速并行算法。
The standard method for spectrum analysis in digital signal processing is the discrete Fourier transform(DFT), typically implemented using a fast Fourier transform(FFT) algorithm.
数字信号处理中标准的频谱分析方法是离散傅立叶变换（DFT），典型的实现方法是快速傅立叶变换（FFT）。
According to the characteristics of unbalance signal, the fast algorithm of discrete Fourier transform (DFT) is presented and accomplished by using microcomputer.
针对测试环境中不平衡量信号的特点，提出了离散傅里叶变换快速算法，并在通用微机上实现。
The fast algorithm based on discrete cosine transform (DCT) and its complexity are obtained and the selection of the best basis is discussed.
给出了用离散余弦变换(DCT)实现的快速算法及复杂度，并考查了最优基的选取。
In this paper a fast algorithm for channel estimation in downlink TD-SCDMA systems has been proposed by analyzing the discrete-time base-band transmission model.
本文在分析TD _SCDMA系统下行链路基带离散时间传输模型的基础上，提出了一种下行链路信道估计的快速算法，并结合终端联合检测算法进行了计算机仿真。
In this paper a fast algorithm for channel estimation in downlink TD-SCDMA systems has been proposed by analyzing the discrete-time base-band transmission model.
本文在分析TD _SCDMA系统下行链路基带离散时间传输模型的基础上，提出了一种下行链路信道估计的快速算法，并结合终端联合检测算法进行了计算机仿真。
应用推荐