遞歸碼 的英文怎麼說

中文拼音 [guī]
遞歸碼 英文
recurrence code
  • : Ⅰ動詞(傳送;傳遞) hand over; pass; give Ⅱ副詞(順著次序) in the proper order; successively
  • : Ⅰ動詞1 (返回) return; go back to 2 (還給; 歸還) return sth to; give back to 3 (趨向或集中於...
  • : Ⅰ名詞(表示數目的符號或用具) a sign or object indicating number; code Ⅱ量詞1 (指一件事或一類的...
  1. In the proposed scheme, the outer code comprising several block codes for error detection in parallel, and the inner code employing a recursive systematic convolutional ( rsc ) code for error correction, are linked by an interleaver

    本文所討論的體制中,串列級連的外由多個分組檢錯子構成,內是一個系統卷積
  2. Using the theories of probability, algebra and number theory comprehensively, we investigate a class of boolean functions with three - valued walsh spectrum in the first part of this dissertation : the properties of the extended semi - bent functions, which are constructed from any two bent functions, are studied, followed by the structure characteristics of the boolean functions satisfying propagation criterion with respect to all but two vectors ; the definition and cryptographic properties of k - order quasi - bent functions are proposed whose walsh spectrum takes on only three values. some sufficient and necessary conditions are offered to decide whether a boolean function is a k - order quasi - bent function ; a special method is presented to construct the k - order quasi - bent functions, whose cryptographic properties are explored by the matrix method, which is different from the method of walsh spectrum and that of autocorrelation of boolean functions ; the application of this kind of boolean functions in the fields of stream cipher, communications and block ciphers is discussed, which shows the great importance of the fc - order quasi - bent functions ; some methodology are proposed to construct the k - order quasi - bent functions, including the complete construction by using the characteristic matrices of boolean functions, and the recursive method by two known k - order quasi - bent functions we further extend our investigation to the ring zp, where p is a prime, and the similar results are presented as far as the p - valued quasi - generalized - bent functions are considered

    本文首先綜合運用概率論、代數學、數論等基礎學科的理論知識,並以頻譜理論作為主要研究工具,對一類譜值分佈相對均勻的函數? ?廣半bent函數、 k階擬bent函數和p值k階擬廣義bent函數進行了系統、深入的研究,給出了廣半bent函數定義,並探討了廣半bent函數的密學性質;給出了k階擬bent函數和p值k階擬廣義bent函數的定義及等價判別條件;討論了k階擬bent函數和p值k階擬廣義bent函數與部分bent函數和p值廣義部分bent函數的關系,探討了它們的密學性質;給出了k階擬bent函數和p值k階擬廣義bent函數的典型構造方法,並將對k階擬bent函數的密性質的研究轉化到對一類特殊的矩陣的研究上;利用布爾函數的特徵矩陣原則上給出了k階擬bent函數的一種完全構造方法,還給出了從已有的p值k階擬廣義bent函數出發,構造變元個數更多的p值k階擬廣義bent函數的方法;初步探討了k階擬bent函數在序列密、分組密以及通信中的應用;給出了一類布爾函數walsh譜的分解式,並利用這類布爾函數的walsh譜分解式給出了一類近似穩定的布爾函數的構造,特殊情形下為k階擬bent函數;利用代數數論的知識考察了p值k階擬廣義bent函數的譜特徵,並給出了k階擬廣義bent函數與所有仿射函數的符合率特徵等等。
  3. The simulation shows that under the fast fading channel circumstance, the wrls - svm channel estimation can acquire the high error performance

    模擬結果表明,在快衰落通道條件下,小波最小二乘支持向量機導頻通道估計方法可以獲得較好誤性能。
  4. The output sinr limitations of mmse and constrained mmoe optimal filter are derived in the cirsumstance aforementioned. these limitations constitute the base of the code - aided optimal filtering and nbi estimate - subtract filtering. this dissertation summarize the recursive least squares ( rls ) algorithm, blind recursive least squares algorithm and the qr decomposing for these two algorithms

    為自適應實現輔助最優濾波,本文系統總結了最小二乘( rls )和盲最小二乘( brls )演算法,以及兩者基於正交三角分解( qrd )的并行計算結構。
  5. He pays special attention to the recursive nature of xslt coding

    他特別強調了xslt編性。
  6. Such code is also called gradually good code or shannon code. in 1993, c. berro etc. firstly proposed a new channel code method - turbo code, which employed recursive systematic code 、 the random interleaver 、 map ( maximum a posteriori ) algorithm and iterative decoding algorithm obtained the capacity that had only 0. 7db difference compared to the shannon limitation

    1993年c . berro等首先提出了一種全新的通道編方式? turbo,採用系統與隨機交織器構造turbo,並將map ( maximumaposteriori )演算法和迭代演算法應用於解過程,獲得了與香農理論極限僅差0 . 7db的性能。
  7. Since 1980s, many mathematicians have been engaged in studying the applications of the grobner basis such as solving the system of algebraic equations, factoring polynomials, testing primary ideals, factoring algebraic manifolds, decoding circular codes in corrected codes and algebraically geometrical codes, analyzing and synthesizing high dimensional linear recurring arrays in cryptology, dealing with multidimensional systematic theory, signaling, solving integer programming and so on

    ) bner基的應用研究包括代數方程組求解,多項式的因子分解,素理想的檢驗,代數流形的分解,糾錯中循環和代數幾何的譯,密學中高維線性陣列的分析與綜合,多維系統理論,信號處理和求解整數規劃等諸多領域。
  8. Remember : we can t rely on our code to always be running on a jvm that will transform tail - recursive calls

    記住:我們不能寄希望於我們的代會總是運行在會轉換尾調用的jvm上。
  9. Can your jit transform tail recursion on code while preserving language semantics

    清單4 .您的jit會在保持語言語義的同時轉換尾嗎?
  10. So, as the example in listing 3 shows, we cannot expect static compilers to perform transformation of tail recursion on java code while preserving the semantics of the language

    因此,如清單3中的示例所示,我們不能期望靜態編譯器會在保持語言語義的同時對java代執行尾轉換。
  11. He shows why this matters and offers a bit of code to help you determine whether your just - in - time compiler can transform tail recursion on code while preserving semantics

    他說明了為什麼這是一個重要問題,並提供了一段代來幫助判斷您的即時( jit )編譯器是否會在保持語言語義的同時做尾轉換。
  12. We give a clear mathematical description of it and prove that it can be used in current avs standard. pcbe build up a mapping using recursion, and this mapping can help to reduce these redundancies. because multi - tables switch and escape code technologies are employed in avs, pcbe is improved to support multi - tables switch and escape code, and we get some new recursion expressions and code tables for avs

    由於avs標準中的2d - vlc演算法使用了多表切換以及escape等技術,所以針對avs標準的特點對演算法進行了面向多表切換以及escape處理的修改,推導出了適用於avs標準的公式並統計了修改後pcbe編器的表,然後在avs標準的參考軟體中實現了本演算法。
  13. Therefore, to guarantee reasonable performance across jvms, you should always try to write code that most naturally fits a tail - recursive pattern in an iterative style instead

    因此,為了保證您的程序在所有jvm上都有適當的性能,您應始終努力把那些最自然地符合尾模式的代按迭代風格編寫。
  14. Parse xml recursively - this code will parse any structure of xml documents using recursion using 15 - 20 lines of code

    這段代能使用具有15 - 20行代函數來分析xml文檔的任何一種結構。
  15. System design for bit - interleaved coded modulation with iterative detection

    檢測的比特交織編調制系統設計
  16. ( 2 ) in order to validate the efficiency of algorithm, this paper design and implement a testing, platform rule processor based on sql server. the main function of the processor is to translate the first order logic rule into embedded - sql programs, which make sql server dbms possess the capability in expressing recursive query with logic language

    ( 2 )為驗證演算法的有效性,該文設計實現了一個測試平臺? ?基於sqlserver的規則處理器,其主要功能為自動把一階邏輯規則轉換為含有sql語句的過程代,這使得sqlserver數據庫管理系統有了用邏輯數據語言表示查詢的能力。
  17. A recursive cte can greatly simplify the code required to run a recursive query within a select, insert, update, delete, or create view statement

    cte可以極大地簡化在select 、 insert 、 update 、 delete或create view語句中運行查詢所需的代
分享友人