演譯法 的英文怎麼說

中文拼音 [yǎnyìfǎ]
演譯法 英文
duction
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 譯 : 動詞（翻譯） translate; interpret
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. In the process of the construction of electric power industry informational, there are a great deal of historical data which cry for decision support system using technology of data mining ， and it would be used to resolve the pivotal 、 extrusive question. this paper bases on the need of electric power marketing decision support system, discuss a lot of kinds of arithmetic. and choose the fit arithmetic, make progress base on electric power marketing decision support system. design and realize some of the difficult data structure and arithmetic ， and encapsulate them into some api function, from a series of api function for the second exploitation

    電力行業信息化建設積累了大量歷史數據，迫切需要利用數據挖掘技術研發分析決策支持系統，以解決供電企業運營管理中關鍵和突出的問題。本論文根據決策支持系統的需要，對各種演算法進行了一定程度的探討，選擇適當的演算法，進行適當的改進，設計並實現了其中幾個比較困難的數據結構和演算法，並用vc + +把它們封裝成若干個的api函數，形成一系列可供二次開發使用的api函數，並編譯成dll文件。
  2. A sub - optimum decoding algorithm for system concatenated with turbo - tcm and space time block codes

    與時空分組碼的級聯系統的次優譯碼演算法
  3. Crackers will do a simple text search for this message inside the disassembled or decompiled output and chances are, when they find it, they will be very close to your sensitive time lock algorithm

    黑客會執行一個簡單的文本搜索，在反匯編或反編譯的輸出中查找此消息；如果他們找到此消息，則他們會很快破解敏感的時間鎖定演算法。
  4. An improved sova - based decoding scheme for turbo - stcm

    的并行級聯空時格碼的譯碼演算法
  5. Turbo codes represent the new code structures, which consist of pccc ( parallel serially convolutional code ) and sccc ( serially concatenated convolutional code ). in this paper, the background of turbo codes are firstly introduced, which includes the base principle of error correction code 、 block code and convolutional code ; the principle of turbo code and the iterative decoding is secondly expanded ; the key decoding algorithm : a revised map algorithm and iterative decoding theory are detailed ; then, a new turbo code structure : hccc ( hybrid concatenated convolutional code ) is presented, and the capacity of this code method is analyzed, the average capacity upper bound is derived ; at last, this code is simulated on awgn ( additive white gaussian noise ) channel and rayleigh fading channel

    本文首先介紹了turbo碼的背景知識，包括差錯控制的基本原理、分組碼和卷積碼；然後闡述了turbo碼的基本原理，包括turbo編譯碼器結構及迭代譯碼原理；較為詳細地描述了關鍵的譯碼演算法： ?種改進的最大后驗概率（ map ）譯碼演算法及迭代譯碼演算法；提出了一種新的turbo碼結構：混合turbo碼（混合級聯卷積碼） ；並用編碼性能聯合界分析方法對混合turbo碼進行了性能分析，得出了其平均性能上界；並在高斯白噪聲通道和瑞利衰落通道上分別作了一些應用研究及計算機模擬實驗。
  6. There are two decoding schemes for convolution code, such as sequence decoding algorithm and viterbi algorithm. because of simplicity 、 excellent performance, viterbi decoding algorithm is abroad applied

    卷積碼的譯碼演算法有序列譯碼和viterbi譯碼兩大類， viterbi譯碼演算法由於其簡單、性能優異等特性得以廣泛應用。
  7. The viterbi decoding algorithm, proposed in 1967 by viterbi, and it ’ s proved that viterbi decoding algorithm is the maximum likelihood decoder algorithm of convolution code and it has excellent decode performance

    Viterbi譯碼演算法在1967年由viterbi提出，經證明它是卷積碼譯碼得最大似然譯碼演算法，具有優異的譯碼性能。
  8. Based on the ( 3, 1, 5 ) convolution code in digital trunking system, this paper first studied the decoding depth of the convolution code and fund out the right decoding depth for digital trunking system, then proposed a modified viterbi decoding algorithm

    本文以數字集群中所用的（ 3 ， 1 ， 5 ）卷積碼為基礎，首先對卷積碼的解碼深度進行了研究，得出適合數字集群系統的解碼深度，然後提出了一種卷積碼的viterbi譯碼的改進演算法。
  9. Viterbi algorithm is a kind of maximum likelihood decoding method, which can obtain high decoding speed and cost fixed decoding time, so it is widely used in deep space communication

    維特比譯碼演算法是一種最大似然譯碼，它可以得到較高的譯碼速度以及譯碼計算時間固定，因而在深空通信中得到廣泛應用。
  10. In the project of constructing the platform, the design of the time - domian synchronization algorithm is in the charge of me, which has been realized on fpga. it is introduced detailedly in chapter 3 and chapter 4. additionally, the design of ldpc decoder based on fpga is another part of the project

    介於本人在該項目中的主要工作是時域同步演算法設計及fpga實現和ldpc碼譯碼器的fpga設計，在文章的第三章將系統的介紹測試平臺時域同步的演算法設計過程及matlab模擬分析，第四章將介紹時域同步的fpga設計、模擬及硬體調試。
  11. 5. according to the euclidean algorithm rs encoder and decoder are implemented in fpga

    根據euclid迭代譯碼演算法，用fpga設計實現了rs碼編譯碼器。
  12. In general, turbo equalization algorithms combine equalization and soft output channel decoding in an iterative process

    通常的turbo均衡演算法採用均衡與軟輸出譯碼的迭代運算。
  13. Cascaded low - density erasure codes are based on sparse random bipartite graphs. very efficient linear time encoding and erasure recover algorithms with the arbitrarily near erasure channel capacity performance of the codes with respect to the algorithms have made them one of the most optimal coding techniques up to now

    基於稀疏隨機二部圖的級聯型低密度糾刪碼因其線性時間的編譯碼演算法和可任意逼近刪除通道容量限而成為目前最佳編碼技術之一。
  14. In this paper, the common used encoding algorithms and basic finite - field opera - tions algorithms are introduced, and the decoding algorithms such as inverse - free ber - lekamp - massey ( ibm ) algorithm, reformulated inverse - free berlekamp - massey ( ribm ) algorithm and modified euclidean algorithm are analyzed in great detail. based on the ribm algorithm, a modified structure and a pipelined decoder scheme are presented. a tradeoff has been made between the hardware complexities and decoding latency, thus this scheme gains significant improvement in hardware complexity and maximum fre - quency

    本文簡要介紹了有限域基本運算的演算法和常用的rs編碼演算法，詳細分析了改進后的euclid演算法和改進后的bm演算法，針對改進后的bm演算法提出了一種流水線結構的譯碼器實現方案並改進了該演算法的實現結構，在譯碼器復雜度和譯碼延時上作了折衷，降低了譯碼器的復雜度並提高了譯碼器的最高工作頻率。
  15. 2. aiming at the convolutional code with long encoding restriction we adopt the fano sequential decoding algorithm to implement the decoder

    2 、針對編碼約束度比較大的卷積碼，採用fano序列譯碼演算法來實現譯碼。
  16. We mainly improve the calculation of the fano metric on the basis of the original decoding algorithm, which enhance the decoder ’ s speed

    並在原有演算法的基礎上進行了一些改進，主要是針對其fano度量計算的改進，提高了譯碼器的工作速度。
  17. The iess 309 standard indicates two decoding methods, we focus on the systemic convolutional code with long encoding restriction which is 36 bit and adopt the fano sequential decoding algorithm to implement the decoder

    在協議中規定了兩種譯碼的方式，我們主要是針對編碼約束度為36的系統卷積碼，採用fano序列譯碼演算法來實現其譯碼，並進行了模擬。
  18. There are many decoding schemes for convolutional code, such as sequence decoding algorithm, fano algorithm, viterbi algorithm. but in fact, what ' s used widely is viterbi decoding algorithm. the viterbi decoding algorithm, proposed in 1967 by viterbi, is a decoding process for convolutional codes in memory - less channel, which takes full advantage of convolutional codes. since viterbi algorithm is proposed, it has obtained rapid development whether in theoretics or in practice and been applied to all kinds of data transmission systems, especially to digital wireless communications and deep space communications

    卷積碼的譯碼演算法方案有很多，如序列譯碼演算法、 fano演算法、 viterbi演算法，但是真正大規模應用的還是viterbi演算法。 viterbi譯碼演算法是1967年viterbi提出的，它是一種對無記憶通道卷積碼進行譯碼的演算法。它充分發揮了卷積碼的特點，因而自viterbi演算法提出以來，無論在理論上還是在實踐上都得到了極其迅速的發展，並廣泛的應用於各種數據傳輸系統，特別是無線通信和衛星通信系統中。
  19. An improved viterbi algorithm of dsp generat ion is brought up to, and a new coding gain testing system is designed. the system tests the coding gain of the error - control system, and the coding gain is 9. 4db which exceeds the proposed index. at last, some suggestions are presented for the work in the future

    在對維特比譯碼演算法研究的基礎上，提出了維特比譯碼演算法基於dsp的改進方法，並且設計出一種新的編碼增益測試系統，對卷積編碼和維特比譯碼組成的差錯控制系統的編碼增益進行了測量，測試結果為9 . 4db ，優于設計指標，最後提出了一些對將來工作的建議。
  20. At the same time, a greedy algorithm is used to eliminate the crossing - conflicts between translation boundaries of source language phrases

    同時利用貪心演算法消除源語言短語譯文邊界之間的交叉沖突。
分享友人
分享到 Line

分享到臉書