編譯演算法 的英文怎麼說

中文拼音 [biānyǎnsuàn]
編譯演算法 英文
compiler algorithm
  • : Ⅰ動詞1 (編織) weave; plait; braid 2 (組織; 排列) make a list; arrange in a list; organize; gr...
  • : 動詞(翻譯) translate; interpret
  • : 動詞1 (演變; 演化) develop; evolve 2 (發揮) deduce; elaborate 3 (依照程式練習或計算) drill;...
  • : Ⅰ動詞1 (計算數目) calculate; reckon; compute; figure 2 (計算進去) include; count 3 (謀劃;計...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  • 編譯 : [計算機] compile; translate and edit編譯程序 compiler; compile programme; compiling routine; 編譯...
  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. 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

    黑客會執行一個簡單的文本搜索,在反匯或反的輸出中查找此消息;如果他們找到此消息,則他們會很快破解敏感的時間鎖定
  3. 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碼進行了性能分析,得出了其平均性能上界;並在高斯白噪聲通道和瑞利衰落通道上分別作了一些應用研究及計機模擬實驗。
  4. 5. according to the euclidean algorithm rs encoder and decoder are implemented in fpga

    根據euclid迭代,用fpga設計實現了rs碼碼器。
  5. 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

    基於稀疏隨機二部圖的級聯型低密度糾刪碼因其線性時間的和可任意逼近刪除通道容量限而成為目前最佳碼技術之一。
  6. 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提出了一種流水線結構的碼器實現方案並改進了該的實現結構,在碼器復雜度和碼延時上作了折衷,降低了碼器的復雜度並提高了碼器的最高工作頻率。
  7. 2. aiming at the convolutional code with long encoding restriction we adopt the fano sequential decoding algorithm to implement the decoder

    2 、針對碼約束度比較大的卷積碼,採用fano序列來實現碼。
  8. 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序列來實現其碼,並進行了模擬。
  9. 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 ,優于設計指標,最後提出了一些對將來工作的建議。
  10. Keywords results in a value outside the range of the data type, and

    關鍵字范圍內的整數語句產生的值超出數據類型範圍,並且中使用了
  11. It also discusses the code and decode theory for rs error - correcting codes, then summarizing the design and debug experience for the rs ( 31, 15 ) coder and decoder through fpga

    文章中還討論了rs糾錯碼的碼原理和,總結了基於fpga實現一個rs ( 31 , 15 )碼和碼器的設計經驗和調試經驗。
  12. Finally yet importantly, sctcm is researched which combines sccc with high bandwidth efficiency modular method tcm. besides, the corresponding schemes of encoding and modulating of sctcm, the corresponding demodulating and decoding algorithm, and the performance simulation are also presented

    最後討論了sccc與高頻帶利用率調制方式結合的sctcm ,研究了適用於sctcm系統的碼調制方案和解調,並給出了性能模擬。
  13. Convolutional coding is an error - control coding to process continuous data stream. the viterbi decoding algorithm is a type of maximum likelihood algorithm for memoryless channel. the convolutional coding employed with viterbi decoding algorithm has already become indispensable channel coding scheme in modern communication systems

    卷積碼是一種糾錯碼,它可以對連續的數據流進行處理; viterbi是一種對無記憶通道卷積碼進行碼的最大似然,使用viterbi的卷積碼已成為現代通信系統不可缺少的通道碼方案。
  14. We put the emphases on the soft output viterbi algorithm ( sova ), which is one of turbo code ’ s decoding algorithms, and presents the derivation and computation step of the sova decoding algorithm. after presenting sova and map decoding algorithms and analyzing four kinds of decoding algorithms, the paper makes a comparison among the different decoding algorithms by emulation analysis, and analyzes the time complexity of various algorithms, and then contrasts them. in the last part of this paper, according to the criterion recommended by the consultative committee for space data systems ( ccsds ), including code rate,

    根據空間數據系統顧問委員會( ccsds )為turbo碼應用於深空通信系統推薦的標準,包括碼率、碼塊大小、分量碼類型、約束長度、碼生成多項式,以及交織器的選擇等參數的建議以及sova的理論基礎,設計了sova的實現結構,通過模擬驗證了本文所採用的turbo碼的性能,從而證明turbo碼確實是一種很好的通道糾錯碼方式,它適用於要求功耗低或信噪比低的深空通信系統中。
  15. In improving the performance of stbc, turbo code is concatenated to stbc. the structure and decoding algorithm of concatenation of turbo - tcm and stbc are studied

    為進一步提高空時分組碼性能,選用turbo碼對空時分組碼進行擴展,分析了turbo - tcm和空時分組碼的碼形式和
  16. This month, our columnist discusses the compilation algorithm

    本月,我們的專欄作家要討論編譯演算法
  17. Humans write and employ decompilers to automate decompilation algorithms that are too challenging for the mind to follow

    人類寫和使用反器是為了自動執行人類難以勝任的反編譯演算法
  18. Based on the timing constraints event model of rtl ( real time logic ), the compiling algorithms for timing constraints event transform the problem of how to detect timing constraints event to the problem of how to find negative cycle in weighted directed graph, which is named as constraints graph. by simplifying constraints graph, the efficient detecting algorithms for timing constraints event have been developed, which not only has good time complexity but also can find events that violate timing constraints as early as possible. in order to verify the event detecting methods based on dynamic rules and to check its efficiency in application, experiment schemes are designed and performed on the implemented prototype system in linux environment

    帶時間約束事件的編譯演算法以rtl ( realtimelogic )事件模型為基礎,將帶時間約束事件的檢測轉化為在帶權值的有向圖(此即受限圖)中尋找負圈的問題,它通過化簡受限圖得到最小有效約束集;運行時事件檢測在最小有效約束集上檢查事件的時間約束,不但有較好的執行效率,而且能盡早地發現違反時間約束的事件。
  19. The novel mechanism dynamically participates register functions, as well as overcomes static general register pressure for software pipelining ; ( 3 ) a cost model for software pipelining is proposed in the dissertation, and quantitative evaluation is also performed ; ( 4 ) a dependence based cost testing ( dbct ) algorithm and decision framework are proposed

    軟體流水的性能會受到計機體系結構、編譯演算法和程序特性的限制,該模型提出了軟體流水是一種有損策略的新觀點,並在確定體系結構和編譯演算法的條件下對軟體流水的開銷進行了量化分析; ( 4 )提出了一種基於相關性分析的軟體流水開銷測試( dbct )以及軟體流水的決策框架。
  20. Then discusses conventional encoding and efficient encoding using special sparse parity check matrix in encoding algorithm, and expatiates the principle of message passing and spa which has the best performance in decoding algorithm

    里詳細討論了傳統的以及使用特殊形式奇偶校驗矩陣的快速。在里介紹了mp集的基本原理和碼性能最好的和乘積
分享友人