decoding complexity 中文意思是什麼
-
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演算法提出了一種流水線結構的譯碼器實現方案並改進了該演算法的實現結構，在譯碼器復雜度和譯碼延時上作了折衷，降低了譯碼器的復雜度並提高了譯碼器的最高工作頻率。 -
Causes small transmission delay, but computation is complex. the other is called dsova, which does not need to know csi, with low - computation complexity and small transmission delay, and is more suitable in the case when side information is unknown. these two algorithms effectively combine the ofdm technology and the sova algorithm in rayleigh channel, resulting in an efficient sova decoding under frequency - selective channel
另一種是不含通道估計的差分sova演算法（簡稱dsova ） ，該演算法不必知道csi ，計算復雜度低，傳輸時延小，適用於邊沿信息（ sideinformation ， si ）未知的情況，這兩種演算法將ofdm技術和rayleigh通道下的sova譯碼演算法有機的結合起來，很好地實現了頻率選擇通道下的sova譯碼。 -
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碼確實是一種很好的通道糾錯編碼方式，它適用於要求功耗低或信噪比低的深空通信系統中。 -
Turbo code was introduced by c. berrou in 1993. turbo code can achieve the error correcting capacity close to the shannon - limit with reasonable decoding complexity, provided that the code words are long enough
1993年， c . berrou提出了一種新的通道編碼方案? ? turbo碼， turbo碼能夠在編碼長度較長的情況下得到接近香農極限的糾錯性能。 -
Serial algorithm improves decoding performance greatly ; serial algorithm finds the better trade - off between performance and complexity, it is a good decoding algorithm with high application value. ( 5 ) introduce the background of quantized decoding and basic theory. analyse effect of quantized decoding, research the impact of limited quantized to serial decoding, and present feasible project for quantized decoding
（ 5 ）介紹了量化譯碼的背景和量化原理，分析了量化譯碼對譯碼器實現的重要作用，基於串列譯碼演算法，以消息種類的不同分別研究了有限長量化對譯碼性能的影響，並提出可行的串列量化譯碼方案，其性能接近連續譯碼性能。 -
When the number of the antennae is not changed, the complexity of sttc decoding would increase on index with the acceleration of the transmission rate
空時格形碼在天線數目固定時，譯碼復雜度隨發射速率的增大呈指數增加。 -
All nonzero elements of gf ( 2m ) must be verified by the conventional step - by - step decoding algorithm, which increases the computational complexity of decoding, so the conventional step - by - step decoding algorithm ca n ' t be adapt to the requirement of rapid decoding
因此標準的step - by - step譯碼演算法對gf （ 2 ~ m ）域中所有的非零元素全部檢驗，將造成計算量巨大，難以滿足快速譯碼的要求。本論文基於t -
Two ways of complexity reduced decoding algorithms ( log - map and sova ) are developed and simulated
進一步比較和分析了兩種能夠減小解碼演算法（ log - map演算法和sova ）復雜度的方法並給出了他們的計算機模擬曲線。 -
The fifth chapter analyzes the fixed - point error of bp - based and normalized bp - based decoding algorithm, and gives the final simulation results of each decoding algorithm. with the simulation results and the considering the tradeoff between hardware complexity and error performance, some key parameters and finite precision analysis for the hardware implementation of ldpc decoder have been performed
第五章對bp - based和normalizedbp - based演算法進行了定點模擬，對ldpc譯碼器的關鍵參數、硬體實現中的定點量化與字長精度問題進行了深入的研究，給出了對譯碼器硬體實現具有參考意義的研究結果。 -
And complex rotary codes take charge of encoding and decoding the information bits again. though the rate is a bit lower and the complexity is a bit higher than the original rs codes, the error - correcting capability of rs - complex rotary codes is improved greatly compared with rs codes. because rs - complex rotary codes can be adjusted according to the practical request, it is a class of practical code
該碼以rs碼為主體結構，同時對信息元進行復轉碼編譯碼，雖然碼率較之原來的rs碼有一定降低，復雜度也略有提高，但是糾錯性能卻由此獲得了較大幅度的提高，同時也使碼字糾錯能力可根據通道要求而進行調節，從而大大增強了實用性。 -
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分佈信息，優化解碼迭代過程，能有效提高系統性能;並且該方案構造的校驗矩陣更易於實際的編譯碼硬體實現。 -
Three decoder architectures, parallel, serial and partially - parallel approaches, are analyzed in this thesis. a kind of novel partially - parallel architecture for decoding ldpc code is proposed. the trade - off between the performance of the decoder, hardware complexity and data throughout can be achieved with this partially - parallel architecture for the random parity check matrix
論文分析了三種不同的譯碼器結構:并行結構、串列結構以及部分并行結構，並提出了一種新穎的部分并行結構的ldpc譯碼器，較好地解決了當校驗矩陣為隨機結構時，譯碼性能、硬體資源和數據吞吐量平衡的問題。 -
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碼己成為通道編碼理論界的研究熱點之一。 -
The principles of rs coding are fully studied. several classical algebraic algorithms for decoding reed - solomon codes are investigated, and the implementation complexity of these algorithms is compared. 3
詳細研究了rs碼的編譯碼原理，論述了幾種經典的rs碼的代數譯碼演算法，並且比較了它們的實現復雜度。 -
3. by theoretical analysis and simulation, quantization decoding of ldpc codes is studied. an efficient quantization - decoding scheme is proposed which can greatly reduce the decoding complexity with a little performance loss
採用理論分析和模擬相結合的方法研究了ldpc碼的量化譯碼，提出了一種高效的量化譯碼實現方案，該方案能夠大大降低譯碼復雜度，同時譯碼性能非常接近連續譯碼。 -
Space - time block codes ( stbc ) based on orthogonal design has attracts enough attentions in its applications in mimo - ofdm systems for its full diversity exploiting and low coding / decoding complexity. these applications include not only system performance improvement, but also reduction of the peak to average power ratio in mimo - ofdm systems. under these backgrounds, this paper first studies space - time block codes under the single carrier, flat fading situation, discusses the encoding / decoding principle and its performance under different channels. then, the author focused on the performance of space - time codes under time selective and frequency selective channels, uncovered the fundamental cause of how maximum doppler shift and power delay profile influences the performance of space - time codes through deduction and simulation
在上述背景下，本文以單載波，平坦衰落通道下的空時分組碼為切入點，深入分析了其編譯碼原理和在不同通道情況下的性能;以此為基礎，後文展開了對空時分組碼在多載波，時間選擇性和頻率選擇性衰落通道下的性能研究，通過理論推導和充分的模擬，揭示了空時/頻分組碼在時頻選擇性衰落通道中的性能變化的根本原因;在以上對多載波系統中空時分組碼的研究的過程中，作者發現了空時分組碼在降低系統峰平比方面應用的可行性，提出了一種降低峰平比的新方法。 -
Designing codes with approaching shannon ' s capacity performance and low coding and decoding complexity is a challenging and meaningful issue in channel coding field
設計性能逼近通道容量、編譯碼復雜度較低的實用好碼是通道編碼領域中最重要的工作之一。 -
Its decoding complexity is also lower than turbo code. recently, ldpc code has drawn the worldwide attentions in channel coding community due to its high performance and strong potential applications in practice
Ldpc碼的數學定義非常簡單，具有較大的靈活性，當碼長足夠長時的非正規ldpc碼具有比turbo碼更為良好的性能，其譯碼復雜度低於turbo碼。 -
Low density parity check ( ldpc ) codes are shown to be one class of shannon limit approaching codes. with advantages of high encoding gain, low decoding complexity and flexible code rates, etc., the research of these codes has become a hot spot of coding academia
低密度校驗碼（ ldpc ）性能接近香農限，具有編碼增益高、譯碼簡單快捷、碼率靈活等優點，是當前編碼界的研究熱點。 -
In this paper, the constraint viterbi algorithm is studied from the project research on a novel product code and decode which is a project of national natural science foundation of china, experiment results show that it can overcome the drawback and reduce the decoding complexity while keeping the good characteristic of conventional viterbi algorithm
本文所研究的約束維特比演算法基於國家科學基金項目《新一代乘積編碼（ productcode ）及解碼方法的研究》 ，不但保持了原有維特比演算法的特性，而且在減少譯碼路徑的情況下，能較好地解決上述問題。
分享友人