隨機編碼限 的英文怎麼說

中文拼音 [suíjībiānmǎxiàn]
隨機編碼限 英文
random-coding bound
  • 隨 : Ⅰ動詞1 （跟; 跟隨） follow 2 （順從） comply with; adapt to 3 （任憑; 由著） let （sb do as he li...
  • 機 : machineengine
  • 編 : Ⅰ動詞1 （編織） weave; plait; braid 2 （組織; 排列） make a list; arrange in a list; organize; gr...
  • 碼 : Ⅰ名詞（表示數目的符號或用具） a sign or object indicating number; code Ⅱ量詞1 （指一件事或一類的...
  • 限 : Ⅰ名詞（指定的范圍; 限度） limit; bounds Ⅱ動詞（指定范圍, 不許超過） set a limit; limit; restrict
  • 隨機 : random stochasticrandom
  • 編碼 : encoded; code; coded; encrypt; codogram; coding編碼表 encode table; 編碼程序 builder; 編碼尺 code...
  1. 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

    基於稀疏隨機二部圖的級聯型低密度糾刪碼因其線性時間的編譯碼演算法和可任意逼近刪除通道容量限而成為目前最佳編碼技術之一。
  2. Turbo code, which utilizes the condition of random coding and decoding of shannon noisy channel coding theorem, has obtained the performance near to shannon theoretic limit. the performance of turbo code is the best one in all presented coding methods

    Turbo碼由於很好地應用了shannon有噪通道編碼定理中的隨機性編譯碼條件而獲得了接近shannon理論極限的譯碼性能。
  3. 4 lee c y, lu e h, lee j y. bit - parallel systolic multipliers for gf fields defined by all - one and equally - spaced polynomials. ieee trans. computers, 2001, 50 : 385 - 393

    近些年來，有限場數值運算被廣泛應用在編碼理論計算機密碼數字訊號處理，邏輯設計，和隨機數產生器等領域上，受到相當大注意。
  4. Turbo codes were presented by c. berrou in international conference on communications in 1993. they hang convolutional code and random interleaver together to realize the idea of random coding, and adopt soft input / soft output ( siso ) iterated decoding to approach maximum likelihood decoding ( mld ). turbo codes come closer to approaching shannon ' s limit

    Turbo碼，由c . berrou等在icc 』 93會議上提出，它巧妙地將卷積碼和隨機交織器結合在一起，實現了隨機編碼的思想，同時，採用軟輸入軟輸出迭代譯碼來逼近最大似然譯碼，具有近shannon限的性能。
  5. 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的性能。
  6. The major tasks include : ( 1 ) expand the schema theorem for ga. the schema theorem with binary coding advanced by professor holland is expanded to limited integer, letter, floating point numbers the number of which value is limited, and their hybrid coding. ( 2 ) put forward replacing by the excellent chromosome ga ( recga ), superiority colony first ga ( scfga ) and improve the ga ; ( 3 ) make probability convergence analysis of recga using the theory of markov chain, random process ; ( 4 ) make convergence analysis of scfga using the principle of contractive mapping in functional analysis theory ; ( 5 ) design the test programs ( cap ) to resolve np problems ( course arrangement ) with gas ; based on recga, modify the arithmetic and then conduct tests

    主要有以下幾方面工作： （ 1 ）將二進制編碼遺傳演算法的模式定理擴展到由有限整數、字母或取值個數有限的浮點數編碼，或它們混合編碼的遺傳演算法范圍； （ 2 ）提出最佳個體替換策略遺傳演算法（ recga ） 、優勢群體優先策略遺傳演算法（ scfga ） ，對遺傳演算法進行改進； （ 3 ）使用隨機過程理論markov鏈對recga進行了收斂性分析； （ 4 ）使用泛函分析理論壓縮映射原理對scfga進行了收斂性分析； （ 5 ）使用遺傳演算法設計了解決np類問題（排課問題）的測試程序（ cap ） ，並根據recga對演算法進行改進並進行測試。
分享友人
分享到 Line

分享到臉書