Decoding algorithm for any structure of stbc is derived . the decoding result discovered by tarokh is a special case . then the channel capacity of stbc over rayleigh fading channels is derived 第五章研究了空時分組編碼的問題,推導(dǎo)出任意結(jié)構(gòu)的空時分組編碼的譯碼算法, tarokh給出的譯碼結(jié)果可以看作特例。
However , the sequential decoding algorithm is not fully developed because of its complication and limited range of application , which lead to relatively few materials particularly in board 而卷積碼的序列譯碼方法因為其硬件復(fù)雜度高和應(yīng)用范圍小,并不十分流行,相關(guān)的參考文獻也很少,尤其在國內(nèi),相關(guān)的研究非常少。
There are two decoding schemes for convolution code , such as sequence decoding algorithm and viterbi algorithm . because of simplicity 、 excellent performance , viterbi decoding algorithm is abroad applied 卷積碼的譯碼算法有序列譯碼和viterbi譯碼兩大類, viterbi譯碼算法由于其簡單、性能優(yōu)異等特性得以廣泛應(yīng)用。
The viterbi decoding algorithm , proposed in 1967 by viterbi , and it ’ s proved that viterbi decoding algorithm is the maximum likelihood decoder algorithm of convolution code and it has excellent decode performance Viterbi譯碼算法在1967年由viterbi提出,經(jīng)證明它是卷積碼譯碼得最大似然譯碼算法,具有優(yōu)異的譯碼性能。
In these years , many new technologies are developed and applied to joint coded modulation systems , such as new error - correcting codes , space - time modulation on mimo channels and iterative decoding algorithm 近年來,隨著新的糾錯編碼、 mimo空時調(diào)制以及迭代譯碼方式的出現(xiàn),聯(lián)合編碼調(diào)制方案的設(shè)計正成為普遍關(guān)注的熱點。
First , the paper briefly introduces theories of convolutional coding , viterbi decoding algorithm and rake receiver . then , the paper focuses on methods to implement viterbi decoder and rake receiver in fpga 本文簡要介紹了卷積碼、 viterbi譯碼和rake接收機的原理,詳細描述了在fpga中實現(xiàn)viterbi譯碼和rake接收機的方法。
The definition and the factor graph model for ldpc codes are summarized . message passing decoding algorithm is presented in details on bsc channel , and the convergence conditions of the algorithm are analyzed 闡述了ldpc碼的定義及因子圖模型,以bsc信道為例,具體介紹了消息傳遞譯碼算法,并給出了其譯碼收斂條件的分析。