Increasing the fft ’ s points can decrease the frequency interval , but it will increase the complexity of computation at large extent 如采用增大fft運算的點數(shù)來減小頻率采樣的間隔,將大大增加數(shù)字信號處理的運算量,從而影響到雷達工作的實時性。
Numerical results are compared with that of the analytical solution , it was shown that the complexity of computation was reduced drastically without sacrificing much accuracy 數(shù)值結(jié)果表明:標(biāo)準(zhǔn)拋物線方程算法在計算目標(biāo)雷達散射截面時具有較高精度,且計算速度大大提高。
The analysis is also given on the sphere of application , the complexity of computation . after the extraction of the precise tdoa signal , it is the major problem 在提取到準(zhǔn)確的時差信號后,論文第四部分就如何獲取精確的目標(biāo)輻射源位置,即定位算法進行了研究,主要分析了非線性定位方程組的求解技術(shù)
The experiments confirm this method is suitable for many kinds of images , its complexity of computation is less than traditional pixel - based methods , and also it can help do with the oversegmentation 實驗表明,該方法可以適合于多種類型的圖像并且其計算量遠小于傳統(tǒng)的基于像素的區(qū)域生長方法,同時有助于改善由圖像噪聲所引起的過分割現(xiàn)象。
In term of the orthogonal property of alamouti scheme and the character of the ofdm system equivalent model expression of receiver signal for stbc - ofdm system was obtained by flexible transform method so that the inverse of matrix was avoided using direct - decision mode and the complexity of computation and receiver was decreased . the simulation results show the validity and efficiency of the proposed receiver . ( 6 ) an adaptive equalization algorithm used in space - time block coded ofdm ( stbc - ofdm ) system with alamou 該算法充分利用了alamouti編碼的正交特性和多發(fā)射天線ofdm系統(tǒng)特點,通過靈活的變換對接收信號進行等價的表示;通過對11矩陣求逆的研究,將塊最小二乘遞推算法( brl )中的zkxzk的矩陣求逆分解為k個2x2矩陣的求逆,從而降低了自適應(yīng)算法的運算量和接收機的復(fù)雜度。
3 the concept of equivalence matrix , which expresses equivalence relation in rough set information system , is introduced ; the relations between equivalence matrix and equivalence classes are discussed . the algorithms for data cleaning and rules extraction in knowledge system based on matrix computation are proposed and their complexity of computation is analyzed 3 、在等價矩陣概念的基礎(chǔ)上,分析了粗糙集知識系統(tǒng)中等價劃分與等價摘要矩陣的關(guān)系,采用等價矩陣來表示粗糙集的等價關(guān)系,提出了一種對數(shù)據(jù)庫知識系統(tǒng)進行數(shù)據(jù)清洗以及從中提取決策規(guī)則的矩陣算法,分析了該算法的計算復(fù)雜性。
After deeply investigate and analysis , we found the drawback of clique lies in its inconsideration of the characteristic of the data being processed . it grid the data into a predefined grid and this adds up to the complexity of the computation . then it has to degrade the accuracy of the result to degrade the complexity of computation , 通過深入的研究和分析,發(fā)現(xiàn)由于clique算法沒有考慮到如何利用當(dāng)前挖掘數(shù)據(jù)的特性,而是進行一種硬性的網(wǎng)格劃分,因此增加了計算復(fù)雜程度,而為了降低計算的復(fù)雜程度就只能降低聚類結(jié)果的精確性。
Based on the introduction of the principles of takagi - sugeno ( t - s ) fuzzy model and generalized predictive control ( gpc ) algorithm , the fuzzy predictive control method combining gpc and t - s model is classified as three kinds of algorithms . the design method of these algorithms is presented in detail . a comparison of these fgpc strategies in control performance and complexity of computation is given by simulation 在介紹了t - s模糊模型和gpc基本原理的基礎(chǔ)上,將基于t - s模型的gpc歸納為三種算法,從理論上對這三種算法進行了詳細地推導(dǎo),并通過仿真研究比較了三種算法的控制性能和計算負擔(dān)上的差異;從而為這一類模糊預(yù)測控制的實際應(yīng)用提供了選擇的依據(jù),也為進一步的性能分析奠定了基礎(chǔ)。