空時(shí)網(wǎng)格碼的聯(lián)合迭代最大似然估計(jì)和譯碼
Jointly Iterative Maximum-Likelihood Estimation and Decoding for Space-Time Trellis Coding
-
摘要: 該文提出了一種適合空時(shí)網(wǎng)格碼的聯(lián)合迭代最大似然估計(jì)和譯碼的方法，利用較少的導(dǎo)頻，能夠獲得比傳統(tǒng)非迭代最大似然譯碼更好的系統(tǒng)性能，仿真結(jié)果顯示經(jīng)過(guò)4次迭代，其性能與接收機(jī)已知理想信道信息下的最大似然譯碼比較只有不到1dB的損失，最后根據(jù)仿真結(jié)果給出一個(gè)導(dǎo)頻數(shù)目和迭代次數(shù)的合理選擇。
-
關(guān)鍵詞:
- 空時(shí)網(wǎng)格碼;最大似然估計(jì);最大似然譯碼
Abstract: In the paper, a jointly iterative maximum-likelihood channel estimation and decoding method is proposed for space-time trellis coding. By utilizing few of pilots, it can achieve better performance than the conventional non-iterative maximum-likelihood decoding. Simulation results show that the iterative method with 4 iterations has less than 1dB loss compared to the maximum-likelihood decoding with ideal channel state information. Finally, according to the simulation results, the method also gives a reasonable choice of both the steps of iterations and the amount of pilots. -
Alamouti S M. A simple transmit diversity technique for wireless communications, IEEE J[J].on Selected Areas in Communications.1998, 16(8):1451-1458[2]Tarokh V, Jafarkhina H, Calderbank A R. Space-time block codesfrom orthogonal designs[J].IEEE Trans. on Information Theory.1999, 45(5):1456-1467[3]Tarokh V, Seshadri N, Calderbank A R. Space-time codes for high data rate wireless communications: Performance criterion and code construction[J].IEEE Trans. on Information Theory.1998, 44(2):744-765[4]Larsson E G, Stoica P, Li J. Orthogonal space-time block codes: maximum likelihood detection for unknown channels and unstructured interferences[J].IEEE Trans. on Signal Processing.2003, 51(2):362-371 -
計(jì)量
- 文章訪問(wèn)數(shù): 2205
- HTML全文瀏覽量: 57
- PDF下載量: 1098
- 被引次數(shù): 0
下載:
