迭代演算法譯碼 的英文怎麼說

中文拼音 [diědàiyǎnsuànfǎyìmǎ]
迭代演算法譯碼 英文
iterated algorithm decoding
  • 迭 : Ⅰ動詞（輪流; 替換） alternate; change Ⅱ副詞1 （屢次） repeatedly; again and again 2 （及） in tim...
  • 代 : Ⅰ動詞1 （代替） take the place of; be in place of 2 （代理） act on behalf of; acting Ⅱ名詞1 （歷...
  • 演 : 動詞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 （標...
  • 譯 : 動詞（翻譯） translate; interpret
  • 碼 : Ⅰ名詞（表示數目的符號或用具） a sign or object indicating number; code Ⅱ量詞1 （指一件事或一類的...
  1. 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碼進行了性能分析，得出了其平均性能上界；並在高斯白噪聲通道和瑞利衰落通道上分別作了一些應用研究及計算機模擬實驗。
  2. 5. according to the euclidean algorithm rs encoder and decoder are implemented in fpga

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

    通常的turbo均衡演算法採用均衡與軟輸出譯碼的迭代運算。
  4. Space - time iterative equalization and decoding system and algorithm in mimo channel

    通道下空時迭代均衡譯碼系統及演算法
  5. Based on tanner graph, the representation and construction of ldpc codes are addressed, and the two decoding algorithm for ldpc codes, i. e, bit - flipping algorithm and sum - product algorithm, are discussed. from two aspects - minimum distance and the failure of independence assumption, the impacts of cycles to the performance of ldpc codes are analyzed. 2

    基於tanner圖模型，詳細介紹了ldpc碼的表示和構造；介紹了ldpc碼的硬判決譯碼（比特翻轉演算法）和軟判決迭代譯碼（和積演算法） ；從最小距離和獨立性假設失效兩個方面分析了環的存在對ldpc碼譯碼性能的影響； 2
  6. The bit - interleaved coded modulation with iterative decoding for bandwidth - efficient transmission over rayleigh fading channel is studied

    該方案利用ldpc碼校驗矩陣作為系統迭代終止判決準則，可大幅度降低譯碼演算法的平均復雜度。
  7. The research for key techniques of turbo codes is processed. it includes, ? the design of optimal component codes and the performance of asymmetric turbo codes are analyzed ; ? a search algorithm for short random interleaver based on the distance spectrum and ids criteria is carried out and simplified ; ? random puncturing method to improve the weight distribution of turbo codes with some special code rates is analyzed and simulated. ? the effect of different schemes of trellis termination to the performance of turbo codes is analyzed ; ? a new low complexity decoder structure is provided ; 5

    對turbo碼的部分關鍵問題進行分析和改進，主要包括： ?分析了最優分量碼的設計和非對稱turbo碼的性能； ?設計了基於距離譜和ids的短隨機交織器搜索演算法並進行了簡化； ?提出了採用隨機刪余方式改善特定高碼率turbo碼重量分佈特性的方法； ?分析了不同編碼器狀態歸零方案對turbo碼性能的影響； ?提出了一種降低實現復雜性的turbo迭代譯碼器結構。
  8. The parameters include generator polynomial of component codes, interleave length and the type of interleavers, iterative decoding algorithms and iteration number, code rates and channel models et al

    這些參數主要包括分量碼、交織長度和交織器類型、迭代譯碼演算法和譯碼迭代次數、編碼速率以及通道條件等。
  9. Since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research. among them, the decoding algorithm and its implementation design are the focus of this thesis

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼，研究結果表明，採用迭代的概率譯碼演算法， ldpc碼可以達到接近香農極限的性能。
  10. This class of codes decoded with soft - in soft - out ( siso ) iterative decoding performs amazingly well. since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼，研究結果表明，採用迭代的概率譯碼演算法， ldpc碼可以達到接近香農極限的性能。
  11. Iterative decoding algorithm for turbo - dfh system

    迭代譯碼演算法
  12. Then, the principle and the iterative decoding algorithm of turbo codes are introduced

    介紹了turbo碼的原理和迭代譯碼演算法。
  13. The principles of soft decoding and message passing are discussed. based on normal graph, the update formulas for message passing are derived and further the optimality of message passing algorithm for cycle - free graphs is proved. finally, the issues affecting message passing in graphs with cycles are analyzed

    介紹了軟判決譯碼和消息傳遞的基本思想；基於normal圖，推導了消息傳遞演算法的迭代公式，論述了無環圖上消息傳遞演算法的最優性，並分析了影響有環圖上消息傳遞的因素； 3
  14. In the thesis, from a new point of view, we investigate the application of non - linear dynamics into the turbo codes and mud area, namely, how the chaos dynamics can be applied in turbo codes development, and how the chaos and neural networks dynamics can be applied in mud. the main contribution of the thesis can be summarized as follows : 1. an iterative decoding algorithm based on map ( maximum a priority ) and soya ( soft output of viterbi algorithm ) in awgn ( additive white gauss noise ) channel is proposed, and the effectiveness of the algorithm is justified by simulation performed on awgn and rayleigh fading channels

    為介紹本文作者的創新工作，在論文簡要講述3g 4g的發展過程及其關鍵技術，其中著重介紹turbo碼和多用戶檢測的發展過程、研究內容和基本原理之後詳細介紹了作者的如下貢獻和創新： 1 、根據turbo碼的迭代譯碼原理，系統地推導出awgn通道中turbo碼基於map和sova的迭代譯碼演算法，演算法的有效性由awgn通道和rayleigh衰落通道下的性能模擬得到證實。
  15. 5. for different decoding algorithm and different signaling schemes, different quantization schemes are used. the nonuniform quantization method for the special property signal is put forward for the first time

    系統地研究了turbo碼的各種迭代譯碼演算法的原理，對演算法中參數的取值進行了討論，並在awgn通道上進行了模擬比較。
  16. The ldpc code ’ s parity check matrix generated by this scheme has high girth and can be used to coding directly, the coding complexity is lower. as to the decoding algorithm, i modify the message passing algorithm based on the girth that i can get in the structure of parity check matrix to improve the decoding performance. what is more, the new structure of the parity check matrix is easy to implement with the hardware

    接著著重圍繞ldpc碼的校驗矩陣構造方法和譯碼演算法展開討論，在比特填充演算法的基礎上提出了一種ldpc碼聯合編譯碼方案，通過該方案構造的校驗矩陣不僅具有良好的girth分佈，而且能直接用於編碼，編碼的計算復雜度低;在譯碼方面，利用構造奇偶矩陣過程中girth分佈信息，優化解碼迭代過程，能有效提高系統性能;並且該方案構造的校驗矩陣更易於實際的編譯碼硬體實現。
  17. Low density parity check ( ldpc ) codes are good error - correcting codes, which can approach shannon ' s capacity limit. due to the sparsity of its check matrix, ldpc codes can be decoded only with linear time complexity using iterative decoding algorithm. therefore, ldpc codes have become one of the most attractive fields in the channel coding community

    低密度校驗碼是一種逼近香農限的好碼，由於其校驗矩陣的稀疏特性，採用迭代譯碼演算法，它的譯碼僅具有線性時間復雜度，所以目前ldpc碼己成為通道編碼理論界的研究熱點之一。
  18. In the awgn channel, the effect to the ra code and ara code ’ s performance of some simulation parameters is considered, which include code length, iteration number, decoding algorithms, different rate and so on, and the performance of the ra code and ara code is compared

    在awgn通道中，考慮了ra碼和ara碼的一些設計參數，如碼長、迭代次數、譯碼演算法、碼率等對誤碼性能的影響，以及ra碼和ara碼的性能比較。
  19. The optimum decoding algorithm - map algorithm and its improved algorithm in logarithm domain used in turbo codes were derived, combining them with the stop criteria of iteration hi realization of decoding, an improved algorithm using fading factor was introduced

    推導了turbo碼的最優譯碼演算法? ? map演算法及其在對數域中的相關改進演算法，並結合譯碼實現的迭代停止準則，提出了一種應用了衰減因子的改進譯碼演算法。
  20. After that it illustrates the realization arithmetic for the rs decoder. furthermore it gives the detail time domain iterative decoding process and its flowchart

    最後闡述rs譯碼器的實現演算法，給出時域譯碼迭代過程和迭代的流程圖。
分享友人
分享到 Line

分享到臉書