編譯時運算 的英文怎麼說

中文拼音 [biānyìshíyùnsuàn]
編譯時運算 英文
compile-time operation
  • 編 : Ⅰ動詞1 （編織） weave; plait; braid 2 （組織; 排列） make a list; arrange in a list; organize; gr...
  • 譯 : 動詞（翻譯） translate; interpret
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 運 : Ⅰ動詞1 （物體位置不斷變化） move; revolve 2 （搬運; 運輸） carry; transport 3 （運用） use; wield...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 編譯 : [計算機] compile; translate and edit編譯程序 compiler; compile programme; compiling routine; 編譯...
  • 運算 : [數學] operation; arithmetic; operating
  1. 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演算法提出了一種流水線結構的譯碼器實現方案並改進了該演算法的實現結構，在譯碼器復雜度和譯碼延時上作了折衷，降低了譯碼器的復雜度並提高了譯碼器的最高工作頻率。
  2. The time interval for computer to complete a task. e. g., assemble duration, compile duration, response duration, run duration, translate duration

    計算完成一項作業所需的時間。例如，匯編時間、編譯期、響應時間、運行時間、翻譯變換時間。
  3. 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 ）事件模型為基礎，將帶時間約束事件的檢測轉化為在帶權值的有向圖（此即受限圖）中尋找負圈的問題，它通過化簡受限圖得到最小有效約束集；運行時事件檢測演算法在最小有效約束集上檢查事件的時間約束，不但有較好的執行效率，而且能盡早地發現違反時間約束的事件。
  4. The algorithm inserts the dynamic voltage scaling code before the condition statements and after the loop statements, which affect the program execution time. the algorithm makes full use of the slack time for the running program and effectively reduces system power consumption

    該演算法在編譯器的幫助下，在條件語句，循環語句等影響程序實際執行時間的控制語句結構中設置電壓調節點，插入電壓調節代碼，從而最大限度的利用了程序運行時的空閑時間，達到了降低系統功耗的效果。
  5. If the proxy configuration script is found, the script is downloaded, compiled, and run on the local computer when proxy information, the request stream, or the response is obtained for a request that uses a

    實例的請求獲取代理信息、請求流或響應時，在本地計算機上下載、編譯和運行該腳本。
  6. In a checked context, a compile - time error occurs if the operation is a constant expression. otherwise, an

    在所檢查的上下文中，如果該運算是常數表達式，則發生編譯時錯誤。
  7. Some garbage collection algorithms require significant cooperation from the compiler or runtime environment, such as updating reference counts whenever a pointer assignment is performed

    一些垃圾收集演算法要求編譯器或者運行時環境的重要配合，如當進行指針分配時更新引用計數。
  8. Operator, you will generate a compile - time error

    運算符，將生成編譯時錯誤。
  9. When you press f5 to run a program, visual basic compiles your code into a binary language that the computer understands

    當您按f5運行程序時， visual basic將您的代碼編譯為計算機可以理解的二進制語言。
  10. The extended finite state automation ( efsa ) is adopted to match pattern written by asl in the thesis. it is also said that the rules are translated into efsa while compiling the rules, the method have high performance in the run time, the pattern matching time is insensitive to the numbers of rules

    文中模式匹配採用了擴展的有限狀態自動機（ efsa ）演算法，也就是在編譯規則的時候將規則轉換成擴展的有限狀態自動機，這個方法提高了運行時執行的效率，使得匹配的時間與規則的多少基本無關。
  11. A compile - time constant is computed at the time the code is compiled, while a run - time constant can only be computed while the application is running

    編譯時常數和運行時常數編譯時常數在編譯代碼時進行計算，而運行時常數則只能在應用程序運行時進行計算。
分享友人
分享到 Line

分享到臉書