計算復雜度 的英文怎麼說

中文拼音 [jìsuànfùzádù]
計算復雜度 英文
computational complexity theory
  • 計 : Ⅰ動詞1 （計算） count; compute; calculate; number 2 （設想; 打算） plan; plot Ⅱ名詞1 （測量或計算...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 復 : Ⅰ形容詞1 （重復） repeated; double; duplicate 2 （繁復） complex; compound Ⅱ動詞1 （轉過去或轉過...
  • 雜 : Ⅰ形容詞（多種多樣的; 混雜的） miscellaneous; varied; sundry; mixed Ⅱ動詞（混合在一起; 攙雜） mix; blend; mingle
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 計算 : 1 （求得未知數） count; compute; calculate; reckon; enumerate 2 （考慮; 籌劃） consideration; pla...
  1. In all kinds of complicated network, oriented linking and unlinking, communication frequency resource is strained, and bandwith to transmitting audio frequency signal is too restricted, complicated and fluky, while audio frequency data exponential have been increased in the last several years. under the circumstances, based on the research of predecessor, this paper studies wavelet analysis ' s maths gist and practices significance on signal process, and puts forward a optimized wavelet package condensation arithmetic to process audio frequency data, which gives attention to coding efficiency, multirate and compression delay. simulation experiment on the arithmetic has been done by matlab

    針對無連接和面向連接的各種復雜網路環境下，通信頻帶資源緊張，音頻傳輸帶寬有限且復雜多變，而各種音頻數據又日益增多的局面，本文研究小波分析在信號處理方面的數學依據和在數據壓縮方面的實際意義，在前人不斷工作的基礎上，提出了一種優化小波包變換編碼方案用於音頻數據的壓縮演算法，兼考慮了編碼效率、多碼率和壓縮時延多個方面，並在matlab環境下做了模擬實驗，對各種音頻信號及多種小波函數做了模擬結果比較，實驗結果證明該演算法可以在一定計算復雜度下可以很好地改進壓縮效果，達到多碼率下實現實時編解碼的過程，在高速dsp晶元等硬體設備支持下，可以有效應用於實際復雜多變信源編碼。
  2. The simulation results show that the proposed algorithm can accomplish the multilevel group formation in real time with lower calculation complexity, and better performance can be achieved in the situation assessment for space group formation

    模擬結果表明，所提演算法能實時完成多個級別的空間合群融合，其計算復雜度也比較低，而且在空間合群的態勢評估中獲得了比較好的結果。
  3. Though maximum likelihood detection ( mld ) can obtain optimum detection performance in mimo communication systems, the ergodic search increases the complexity exponentially with the number of the antennas, which lead to implemental difficulty

    在mimo通信系統信號檢測中，最大似然檢測（ mld ）可以獲得最佳的誤碼性能，然而遍歷式搜索方式使得mld的計算復雜度隨天線數呈指數形式遞增，在實際系統中，往往難以實時實現或者不能實現。
  4. A good algorithm is one that has a low computational complexity, provides a high quality of motion compensation and also ensures that the bitstream is as small as possible

    一個好的運動估計方法應當是：估計性能高、計算復雜度低、比特傳輸速率低。
  5. Experimental results show that the proposed method can reduce the computational complexity significantly compared with the full search method, and maintain similar decode visual quality and coding bit rate, then improve the ray - space data coding efficiency

    實驗結果表明，與全搜索方法相比，該方法計算復雜度明顯降低，同時保持了近似的解碼圖像質量和編碼碼率，進一步提高光線空間數據的編碼效率。
  6. The proposed method can improve location accuracy without increasing communication traffic and computing complexity

    該演算法在不增加原演算法通信量及計算復雜度的基礎上提高了定位精度。
  7. Therefore, a new low - complexity mmse time domain equalization algorithm is proposed which focuses on lowing the complexity of time domain equalizer and optimizing performance

    文從降低時域均衡器計算復雜度和優化性能角度本文提出一種低復雜度wse時域均衡演算法。
  8. In recent years, it is due to the modification and improvement of the algorithms and especially the development of computer science and technology both in hardware and software that lead to the advent of such practical analytic tools as blast, fasta, clustalw, which can relatively cater for the need of research in both efficiency and accuracy. the fundamental way to improve computation efficiency and accuracy is to better the alignment algorithms in principle so as to minish the computation complexity

    雖然近年來由於演算法自身的不斷改進以及計算機科學的發展，其實現程序依靠計算機硬體和軟體開發技術的提高得到了效率和精度上的改善，從而使現在應用廣泛的序列比對或數據庫搜索程序如blast 、 fasta 、 clustalw等才獲得了相對滿意的計算效率，但是從理論基礎和思想原理上改善序列比對演算法以期降低計算復雜度，才是提高計算效率和精度的根本途徑。
  9. A retiming algorithm fam which based on simple retiming is introduced in the paper, the time computation complexity of the algorithm is better than the classical algorithm feas

    本文在基於簡單重定時的基礎上提出了一種重定時演算法fam ，此演算法的時間計算復雜度較經典演算法feas有所改善。
  10. This paper investigated and compared the main algorithms of audio watermarking and their performance including imperceptibility, roubustness, complexity degree and embedding quantity in detail

    摘要對目前音頻水印中的主要演算法進行了系統的描述，並對其在不可見性、魯棒性、計算復雜度以及嵌入量，四個方面作了比較。
  11. The basic idea of this method is to produce particles from the posterior densities, and these weighted samples provide approximations to the densities. in this dissertation, sequential monte carlo method and its applications in communication are investigated. firstly, its basic idea, method and improved method are introduced, then induce the bound of particles, which determines the performance of the system, and the more particles are chosen, the higher computation is done, finally, a new detector based on new importance function is proposed, which deals with the joint channel estimation and detection in flat fading channels

    首先介紹了它的基本思想、基本方法、及當前研究現狀；在此基礎上推導出樣本數選擇的界，樣本數的選擇決定了系統的性能，但是若選的太多，計算復雜度也會隨之增大，因而給出這個界是十分有意義的；最後提出了一種基於新的重要函數的檢測器用來解決平坦衰落通道下的聯合通道估計和檢測問題，並通過模擬證明了我們提出的新檢測器的有效性。
  12. Based on knowledge reasoning, fuzzy theory, extraction of sub - assembly and cluster, and hierarchical connection relation graph, an assembly sequence generation algorithm is studied in this paper, which breaks down the original complex assembly sequence generation problem into several small scale assembly sequence planning problems to reduce the computing complexity caused by cut - set theory. a hierarchical and / or graph to store all the generated sequences is also employed for this purpose

    本文提出基於知識推理及模糊理論，結合子裝配與聚族提取以及裝配樹，利用層次聯接關系圖，將一個復雜的裝配序列求解問題轉化為若干個相關的小規模裝配序列求解問題，並用一種層次與或圖結構存儲裝配序列，使割集法求解裝配序列的計算復雜度大大降低。
  13. Two sova decoding algorithms in ofdm system based on bpsk modulation with fading channel were presented. one is called bce _ sova, which is based on adaptive blind channel recognization. it can adaptively estimate the channel state information ( csi )

    其中一種是基於自適應盲通道識別演算法的sova譯碼演算法（簡稱bce _ sova ） ，該演算法可以自適應地估計通道狀態信息（ channelstateinformation ， csi ） ，由於不用訓練，傳輸時延小，但計算復雜度高。
  14. Causes small transmission delay, but computation is complex. the other is called dsova, which does not need to know csi, with low - computation complexity and small transmission delay, and is more suitable in the case when side information is unknown. these two algorithms effectively combine the ofdm technology and the sova algorithm in rayleigh channel, resulting in an efficient sova decoding under frequency - selective channel

    另一種是不含通道估計的差分sova演算法（簡稱dsova ） ，該演算法不必知道csi ，計算復雜度低，傳輸時延小，適用於邊沿信息（ sideinformation ， si ）未知的情況，這兩種演算法將ofdm技術和rayleigh通道下的sova譯碼演算法有機的結合起來，很好地實現了頻率選擇通道下的sova譯碼。
  15. But the original blast algorithm has a very high computational cost because of the nulling and cancellation step. on the other hand, the algorithm also needs an optimal detection ordering to restrain the effect of error propagation and improve the detection reliability

    常規blast演算法由於需要進行大量的線性迫零（矩陣求逆）和串列符號刪除等運算，計算復雜度非常高，另一方面，演算法還需要尋找最優的信號檢測順序來消除誤差傳遞的影響。
  16. However, there still exists correlation between coefficients of sub - matrices after 4d - mdct. this thesis proposes a four dimensional matrix video coding method based on context to get rid of the correlation between coefficient sub - matrices further. it includes three parts as follows : firstly, this thesis presents a four - dimensional matrix video encoder and decoder model, which contains components of prediction, transform and entropy coding

    實驗結果表明，該方法與傳統的二維編碼方法相比，具有高壓縮比和高圖象質量的優點;與矢量量化編碼相比，具有碼表體積小，計算復雜度低的特點;與霍夫曼編碼方法相比，在相同信噪比的條件下，對運動相對劇烈的視頻序列壓縮效果要更好。
  17. The time complexity will be different according to the number and value of input properties, such as cobweb algorithm

    如cob場王b ，計算復雜度會因輸入屬性的數目和屬性值的不同而劇烈變化。
  18. The computing complexity and computing time of this algorithm is lower than that of existed algorithms

    該演算法比已有的塊三對角矩陣求逆演算法的計算復雜度和計算時間低。
  19. 2 ) the concept of space frequency distribution is introduced into reevaluation of incoherently distributed source model. based on the model, two low - complexity robust bearing estimators are developed. it is proved theoretically that their estimates are asymptotically unbiased and consistent

    2 ）從空間頻率分佈的角度重新評價了非相干分佈源模型，提出了兩種低計算復雜度的穩健的分佈源波達方向估計器，並從理論上證明了它們的漸近無偏性和漸近一致性。
  20. Incremental length diffraction coefficients ( ildc ) is adopted to calculate the contribution of edge diffraction. in order to improve the accuracy of calculation, multi - scattering is discussed, based on the two former contributions and ray - tracing method. geometrical optics ( go ) and physical optics ( po ) are used to calculate the multi - reflection between facets and facets

    對于鏡面反射採用物理光學法計算其散射貢獻，結合基於面元的目標模型的表示，採用離散的積分形式，將面電流積分化簡為線積分，簡化計算復雜度；對于邊緣繞射，運用增量長度繞射系數理論計算目標邊緣繞射場；在多次反射中，則以光線跟蹤方法為基礎，採用幾何光學、物理光學相結合的方法分析考慮多次散射場。
分享友人
分享到 Line

分享到臉書