逆運算 的英文怎麼說

中文拼音 [nìyùnsuàn]
逆運算 英文
inverse operation
  • 逆 : Ⅰ形容詞1 （方向相反） contrary; counter 2 [數學] inverse; converse Ⅱ動詞1 （抵觸; 不順從） go aga...
  • 運 : Ⅰ動詞1 （物體位置不斷變化） move; revolve 2 （搬運; 運輸） carry; transport 3 （運用） use; wield...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 運算 : [數學] operation; arithmetic; operating
  1. When calculous was at it ' s initial stage, newton computed the integral by contradictorily operation of differential, leibniz used the " tiny elements " method

    在微積分的初創時期， newton通過微分法的逆運算，即「反流數術』來解決求積問題，而leibniz則採用「微元法』 。
  2. We need to know how hard it is to reverse the exponentiation

    我們需要知道求冪運算的逆運算的難度。
  3. Considering the difference - resisting capacity of power function in classic s - box, we substitute the inverse function by better power function. we prove that these change do not influence the difference resisting capacity from the theory

    其次考慮到經典s盒中冪函數的抗差分攻擊能力，我們用冪函數取代rijndael演算法中s盒的求逆運算。
  4. Reflexive generalized inverse operator of hilbert space

    空間的自反廣義逆運算元
  5. In the receive site, we operate non - chaos synchronization in reverse and resume binary message sequence by the correlated rule of the sender

    接收端根據發送端的相關規則，進行非混沌同步的逆運算，恢復出二進制信息序列。
  6. Firstly, we generalize and analyze the advantages and present research of elliptic curve cryptography ; secondly, we study the basic theory of the ecc ; thirdly, we illustrate the safety of the ecc and discuss the elliptic curve key agreement scheme, elliptic curve encryption scheme and elliptic curve digital signature algorithm ; fourthly, we study fast algorithms of the multiplication and inversion multiplication of the element of in the underlying finite field f2m whose characteristic is two represented by the two basis of optimal normal basis and polynomial basis. we make improvements to the fast algorithm of the polynomial basis multiplication by hankerson and base on the experiments, we describe the properties and compare the advantages of the multiplication and inversion multiplication of the elements in f2m field under optimal normal bases and polynomial basis. results concluding from the study car be used as references in the realization of the elliptic curve cryptosystem ; fifthly, we overview the current fast algorithm of point multiplication, improve the fix base point comb algorithm, advance the speed of the whole system and remark the advantages and disadvantages of the popular algorithms based upon the experimental datas ; sixthly we realize the algorithm library of elliptic curve cryptography based on the f2m. only change slightly in our algorithm library can we realize the ecdh, eces, ecdsa based onf2m of anysize ; seventhly, we realize the ecc on two secure elliptic curves, including ecdh, eces, ecdsa

    本文首先介紹並分析了橢圓曲線密碼體制的優點及研究現狀；其次研究了橢圓曲線密碼體制的基本理論；第三，分析了橢圓曲線密碼的安全性並介紹了密鑰共享，加密，數字簽名等橢圓曲線密碼體制；第四，深入研究了特徵為2的有限域f _ 2m中的元素在多項式基和最優正規基表示下的乘法運算和乘法逆運算的快速演算法，並對hankerson等人提出的多項式基下的乘法運算的快速演算法作了改進，而且在實驗的基礎上不僅分析研究了f _ 2m域中元素在多項式基和最優正規基表示下的乘法和乘法逆運算的性能，還對這兩種基表示下的f _ 2m域中元素運算效率的優劣作了比較和研究，所得的結論可供在實現橢圓曲線密碼體制時參考；第五，研究了目前流行的計算橢圓曲線標量乘法的快速演算法，同時改進了固定基點梳形法，提高了整個系統的速度，並在實驗的基礎上分析研究了流行演算法的優劣；第六，實現了基於f _ 2m的橢圓曲線密碼體制的演算法庫，在我們的演算法庫中只需稍微改變便能實現基於任意尺寸的f _ 2m上的ecdh ， eces ， ecdsa等橢圓曲線密碼體制；第七，實現了兩條安全橢圓曲線上的橢圓曲線密碼體制，包括ecdh ， eces ， ecdsa 。
  7. The inversionless bm algorithm in rs decoder is implemented with serial mode, which avoids the inversion computation and only needs 3 finite - field multipliers. thus, the complexity of hardware implementation has been mostly reduced. a 3 - level pipe - line processing architecture is also used in the hardware and the coding circuit in rs coder is optimized by using the characteristics of the finite - field constant multiplier

    Rs解碼器的設計採用無逆bm演算法，並利用串列方式來實現，不僅避免了求逆運算，而且只需用3個有限域乘法器就可以實現，大大的降低了硬體實現的復雜度，並且因為在硬體實現上，採用了3級流水線（ pipe - line ）的處理結構。
  8. In the last part we discuss the relationship between the generalized inverse of an operator and mbekhta ' s subspaces and thet between ci operators and the generalized inverse of an operator. the main results are expressed bellow

    第四節主要討論了廣義逆運算元與ci運算元和m6ekhta子空間的關系。主要內容是： 1已知aen 。 b當下列條件之一成立時， ab是ci運算元
  9. We study the spectral theory of bounded linear operators and the characterization of ci operators by way of mbekhta ' s subspaces. we find a series of operators which are ci operators by the defination and the characterization of ci operators given by weibang gong in [ 3 ]

    利用mbekhta子空間研究一般有界線性運算元的譜理論以及描述ci運算元的特徵；用ci運算元的定義和判定方法尋找更廣泛的ci運算元；同時還討論了廣義逆運算元和ci運算元及mbekhta子空間的關系。
  10. It has been deduced that the search direction remains the same but that the step length decreases in optimizing the improved cost function with the conjugate gradient algorithm from the gradient of the cost function that the fir filter apporaches the contrary point spread function ( psf ) more, and that the estimated image is closer to the original one

    從代價函數的梯度入手推導出共軛梯度演算法，其搜索方向保持不變而搜索步長變小，使濾波系數更加退近於點擴展函數逆運算元，從而使估計圖像與原始圖像更加接近。
  11. This paper studies the inverse operation of the matrix power operation, namely the root operation

    摘要研究了矩陣冪運算的逆運算，即矩陣的開方運算。
  12. ( 3 ) for the first hierarchy mentioned above, the multiplication and inversion in gf ( pm ) are two key operations

    （ 3 ）對于第一層次的運算，關鍵是域元素的乘法和乘逆運算。
  13. In order to improve their speed, " fast polynomial multiplication algorithm " and " fast algorithm of r - circulant matrix inversion " are proposed, which offer obviously computational advantages

    本文提出了「快速多項式乘法運算」演算法和「 r -循環矩陣快速乘逆運算」演算法，用以提高這兩種運算的速度，具有明顯的速度優勢。
  14. It has good computational cost because of avoiding any inverse operation and optimal ordering. it also utilizes double - directional detection and diversity combine technology to migrate the error propagation, and then improve the ber performance

    它不需要進行任何形式的矩陣求逆運算和最優信號排序操作，因此具有良好的演算法復雜度，同時它利用雙向檢測策略與分集合併技術來抑制誤差傳遞，提高了演算法的檢測性能。
  15. Better performance are gained when the properties of balance and activity are combined in an attack of reduced variants of rijndael. 7. the optimisations of rijndael sbox, of columnmix and its inverse, and of the round trans formation are thoroughly studied for purpose of better performance

    7 、研究了rijndael演算法s盒、列變換及其逆運算、整個輪變換的優化方法，從運算單位、數據訪問時間和簡化矩陣運算等方面提高演算法的實現效率。
  16. In audio robust watermark algorithm, watermark is embedded in transform domain by using the speediness, simplicity and multi - resolution of wavelet transform. when extracting watermarking, the audio is decomposed by single - level discrete 1 - d wavelet transform, and watermarking is extracted by ica based on kurtosis maximization. this method ’ s computational cost is low

    音頻水印利用小波變換快速、簡單和多解析度的特點來嵌入水印，提取的時候，先對觀測音頻文件進行一級小波分解，然後用基於最大峰值的ica方法進行水印提取，這種方法避免了其他盲源分離方法必需的求逆運算，所以計算量小。
  17. In mmse based detection algorithms it ’ s inevitable to do the matrix inversion operation, and we have found by analysis that such matrices are all positive definition hermite matrices. so, in chapter three, by renumbers the looped variables we induce a new matrix inversion algorithm and based on the symmetry of the data we further

    由於基於mmse的檢測演算法中會不可避免地遇到矩陣求逆運算，經過分析發現此類矩陣均為正定hermite矩陣，根據此類矩陣的特點引入了變量循環重新編號法求逆演算法，並且根據運算過程中數據的對稱性提出了進一步的簡化方案。
  18. 3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition, which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ), is proposed for multi - path slow fading cdma channels. the computational complexity of this method is not only lower than that of the normal rls, but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection. and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods

    3 、針對多徑慢衰落通道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘演算法，該演算法完全避免因約束而引進的矩陣求逆運算（相對于常規的遞歸最小二乘演算法） ，不但運算量比常規的要低，而且比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時接收機演算法還低，且收斂速度比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時多用戶檢測都好，將提出的新的遞歸最小二乘演算法與提出的數據選擇方案結合起來可以進一步降低其運算量，具有很大的實用價值，最後通過模擬實驗進一步分析了其性能。
  19. Ecc is considered to be an alternative to rsa. this article provides a brief description of rsa public key cryptography and the associated knowledge, in particular introduces non - supersingular elliptic curves e which is established on the finite field fp with p > 3, in - depth studies present existed scalar multiplication, further proposes an improved signed sliding window algorithm on ecc under the mixed coordinates, the improved algorithm compatible the advantage of the naf, has the least number of zero window and avoid a large number of inverse operation, successfully reduce scalar multiplication calculation

    本文闡述了橢圓曲線及其相關知識，特別說明了建立在有限域fp （其中p是大於3的素數）上的非奇異橢圓曲線e ，深入研究目前已有的各種標量乘法，由此提出了橢圓曲線密碼演算法在混合坐標下改進的帶符號滑動窗口演算法，該演算法兼容了naf方法的優點，擁有最少數目的非零窗口數，又避免了域元素上的大量求逆運算，較成功地減少了標量乘法計算量。
  20. The second section discusses properties of left - invertible and right - invertible operator in use of mbekhta ' s subspaces and gives the necessary and sufficent condition. i get results as follows : theorem 2. 6 suppose a b ( x ) is the left - invertible

    第二節主要運用mbekhta子空間討論左可逆和右可逆運算元的性質，並給出運算元可逆的充要條件，得到下面的定理：定理26設aeb （ x ）為左可逆運算元
分享友人
分享到 Line

分享到臉書