移动通信中Turbo码的编译码研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
移动通信系统采用纠错码提高消息传输的可靠性。自Shannon定理提出以来,许多信道编码相继被提出,例如汉明码、卷积码、RS码等。而C.Berrou等人于1993年提出的Turbo码获得了几乎接近Shannon理论极限的译码性能,对信道编码领域的研究产生了深远的影响。近年来Turbo码不仅作为了3G(第三代移动通信)的信道编码方案,还被LTE(Long Term Evolution)技术采用,用于纠错抗干扰。
     由于Turbo码迭代译码复杂度大,导致其时延较大,在移动通信的运用中有一定的限制。所以Turbo码的研究一直致力于提高性能和降低时延,这也是本文的主要研究的主要方向。本文详细研究了Turbo码的编译码结构、算法,设计参数(分量码、迭代次数、编码速率等)对其性能的影响;研究了3G中的Turbo码并分析了距离谱,改善了3G中的3GPP(The 3th Genaration Partnership Project)交织器在低信噪比条件下的性能;详细分析了LTE中的并行译码的Turbo码结构,研究了译码结构、无冲突交织器、译码算法等,对其中的一种常用无冲突交织器进行了改进;使用VHDL语言实现了Turbo码的编码器。
     本文的主要创新之处如下:
     ①对3G中Turbo码的3GPP交织器进行了改进,并在基本不改变原交织器的设计步骤情况下,改进方案精简了交织器的结构,并通过对短帧进行填充的方式,达到较长的交织长度,改善了短帧在低信噪比条件下传输的误码性能。
     ②对LTE中的并行译码的Turbo码进行了分析,对其关键部分——无冲突交织器进行了研究和改进。将S-random规则再用于一种常用的行列S随机无冲突交织器,使每个子译码器内的相邻数据在交织后的距离增大。通过与行列S随机交织器对比仿真,这种改进的方案改善了并行Turbo码低重码字的问题,降低了译码的误码率。
Mobile communication system use error-control coding to improve reliability of news transmission. Since the Shannon’s Information Theory has proposed, many channel coding is invented, such as Hamming codes,Conolutional codes, RS codes etc. C.Berrou et al invented Turbo codes in 1993 has captured great importance due to exhibiting near Shannon-limit performance, it has far-reaching influence on channel coding. In recent years, Turbo codes not only as a 3G (The Third Generation Mobile Communication) channel encoding scheme, it still used in the LTE (Long Term Evolution) technology for correctting and anti-jamming.
     Due to the complexity of Turbo iteration decoding, the delay is seriously, so it has some limitation in the use of Mobile communication. The research of Turbo code has been committed to improve performance and reduce the delay, and it is also the main research direction of this paper. This thesis introduced the Turbo coder scheme, arithmetic in detail and the design parameters (constitutive codes, interative times, encode rate et al) which have influence on its performance at frist, then introduced the 3GPP (The 3th Genaration Partnership Project)interleaver and analyzed the distance spectrum of Turbo codes, and an improved 3GPP interleaver applied under low signal-to-noise ratio condition, then introduced the parallel decoding Turbo codes in LTE, study the decoding structure, memory collision free interleaver and decoding algorithm, improve the key technology—memory collision free interleaver. At last Turbo encoder is achieved by use of VHDL language.
     The main innovation of this thesis is below:
     ①This thesis improved 3GPP interleaver. On the condition of design steps of the basic interleaver does not change, the improve method simplify its structure, so the transmission BER of the short-frame at low SNR conditions was improved.
     ②The parallel decoding Turbo codes in LTE is analyzed, improved the key technology--memory collision free interleaver. Used S-random regulation into common row column random interleaver again, and make the distance of adjacent data increase after interleaving in every processor . The simulation figures show, this improved design scheme to make better the code weight of parallel decoding Turbo codes, and the bit error rate performance is better.
引文
[1] C.E.Shannon. A mathematical theory of communication [J]. USA Bell Systematic Technical Journal. Vol.27, July-Oct,1948:379-423,623-656.
    [2] R.W.Hamming. Error detecting and correcting codes [J]. USA Bell Systematic Technical Journal. Vol.29.1950:147-160.
    [3] M.J.E.Golay. Notes on digital coding. Proc.IRE[J]. Vol37 .June1949:657.
    [4] P.Elias. Coding for noisy channels. IEEE Conv.Record[J]. Vol.4. 1955:37-47.
    [5] S.G.Wilson. Digital communication[J]. 5thEd.New York:McGraw-Hill,1999.
    [6] G.Ungerboeck. Channel coding with multilevel/phase signals[J]. IEEE Trans. Inform. Theory. Vol.28. Jan.1982:55-67.
    [7] R.G.Gallager. Low-density parity-check codes[J]. IEEE Transactions on Information Theory, Jan. 1962:21~28.
    [8] Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit error-correcting coding and decoding: Turbo codes[J]. In Proc.IEEE Conf.Communications, Geneva, Switzerland, 1993:1064-1074.
    [9]王新梅,肖国镇.纠错码——原理与方法(修订版)[M].西安:西安电子科技大学出版社.2001.4.
    [10]袁东风,张海霞等.宽带移动通信中的先进信道编码技术[M].北京:北京邮电大学出版社.2004,3.
    [11]刘东华.Turbo码原理与应用技术[M].北京:电子工业出版社,2004,1.
    [12] 3GPP Document,3G TS 25.212 v4.00,3rd Generation Partnership Project: Technical Specification Group Radio Access Network: Multiplexing and Channel Coding(FDD)[S], 2000.
    [13]曹蕾.3GPP-LTE移动通信系统信道编解码技术研究[D].东南大学.2007.02.
    [14]刘东华.Turbo码关键技术及Turbo原理的应用研究[D].国防科学技术大学.2003.6:17.
    [15] J.Hagenauer, E. Offer and L.Papke. Iterative decoding of binary block and convolutional codes[J]. IEEE Trans Inform Theory. Vol.42. Mar.1996:429-445.
    [16] S.Benedetto and G.Montorsi. Design of parallel concatenated convolutional codes. IEEE Trans Communcation[J]. Vol.44, May 1996:591-600.
    [17] D.Divsalar, S.Dolinar, R.J.McEliece et al. Transfer function bounds on the performance of Turbo codes[R]. JPL TDA Progress REPORT42-122. aug.1995:44-55.
    [18] L.C.Perez, J.Seghers, D.J.Costello Jr. A Distance Spectrum Interpretation of Turbo Codes[J].In IEEE Trans.Inform Theory. Vol.42, Nov.1996:1698-1709.
    [19]赵宏字,范平志.Turbo码的一种高效改进型MAP译码算法[J].电子与信息学报, V0130(10),Oct.2008:2397-2401.
    [20] Papaharalabos.S, Sweeney.P, Evans.B.G. SISO algorithms based on combined max/max* operations for turbo decoding[J], Electronics Letters , Volume41(3),2005: 142-143.
    [21] Tarable.A, Benedetto S. Mapping interleaving laws to parallel Turbo decoder architectures[J], 2004, 8(3):162-164.
    [22] Rostislav Dobkin, Michael Peleg, Ran Ginosar et al, Parallel interleaver design and VLSI architecture for low-latency MAP Turbo decoder[J]. IEEE Transactions on Very Large Scale Integration(VLSI) systems, 2005, 13(04): 427-438.
    [23] Sun J, Takeshita O Y. Interleavers for turbo codes using permutation polynomials over integer rings[J]. IEEE Trans. On Inform. Theory, 2005,51(01):101-119.
    [24] Orhan Gazi, Yilmaz A, Collision free row s-random interleaver[J]. Communications Letters, 2009,13(4):257– 259.
    [25] S.Dolinar and D.Divealar. Weight distributions for Turbo codes using random and nonrandom permutation[R]. TDA Progress REPORT42-122. aug.1995:56-65.
    [26] Elias P. Coding for noisy channels. IRE Conv Record[J]. 1955.vol.4:37-47.
    [27]孙昌霞.两种确定性交织器的研究与改进[D].郑州大学.2005.5.
    [28] G..D.Fomey. Concatenated codes[N]. Cambridge,MA:MIT Press,1966.
    [29] P.Robertson, E.Villebrun,P.Hoeher. AComparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain[J]. Proc. IEEE ICC’95, Seattle, Washington, Vol. 2, June 1995:1009-1013.
    [30] J.Hagenauer, P. Hoeher. A viterbi algorithm with soft-decision outputs and its applications[J]. Proc. IEEE GLOBECOM’89, Vol.3,1989:1680~1686.
    [31] J.Hagenauer, P. Robertson, L.Papke. Iterative(Turbo)decoding of systematic convolutional codes with MAP and SOVA algorithms. Proc. ITG Conf. on“Source and Channel Coding,”Frankfurt, Germany, Oct.1994:1~9.
    [32]周贤伟,赵欣,王丽娜.使用SIMULINK构建Turbo码仿真系统.微计算机信息.2006年第22卷第5-3期:202-204.
    [33]谢伟,胡贵军,李公羽等.Tutho码的simuhnk建模及性能测试[J].吉林大学学报(信息科学版),Vol.25,No.5,2007:495-497.
    [34]王强,孙锦涛,芮义斌.Turbo码在3GPP短帧数据传输中的性能分析[J],兵工学报,2004,25(2):p167-170.
    [35] L C Perez, J Seghers, and D J Costello Jr, A Distance Spectrum Interpretation of TurboCodes[J], in IEEE Trans.Inform Theory, 1996, 42:p1698-1709.
    [36] Kostas V Koutsouvelis, Christos E Dimakis, A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers[J], in Wireless Personal Communications, 2008,46(3):365-370.
    [37] Chaikalis, Costas,Turbo decoder dynamic reconfiguration in Urban/Suburban outdoor operating environment for 3GPP[J], in IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC, 2007:1-5.
    [38] Abrardo, A, Performance bounds and codes design criteria for channel decoding with a-priori information[J],in Wireless Communications, IEEE Transactions on , 2009,8(2):608- 612.
    [39] Nimbalker.A, BlankenshipT.K, Classon B, et al, Contention-Free Interleavers for High-Throughput Turbo Decoding[J]. Communications IEEE Transactions ,2008,56(8):1258– 1267.
    [40] Sun J, Takeshita O Y. Interleavers for Turbo codes using permutation polynomials over integer rings[J]. IEEE Trans. On Inform. Theory, 2005,51(01):101-119.
    [41] A Giulietti, L can der Perre, M Strum, Parallel Turbo coding interleavers: avoiding collisions in accesses to storage elements. Electronic letters, 2002, 28(38):5.
    [42]曹达仲,侯春萍.移动通信原理、系统及技术[M].北京:清华大学出版社,2004,3.
    [43]郑银香,张秀军,赵明.一种适合于并行译码的Turbo交织器的设计[J].微计算机信息,2006,22(1-2):195-197.
    [44]黄卉,王辉.高速并行Turbo译码中的交织器技术研究[J].通信技术.2008,06(41):83-85.
    [45] Rostislav Dobkin, Michael Peleg, Ran Ginosar et al, Parallel interleaver design and VLSI architecture for low-latency MAP Turbo decoder[J]. IEEE Transactions on Very Large Scale Integration(VLSI) systems, 2005, 13(04): 427-438.
    [46]彭林.第三代移动通信技术[M].北京:电子工业出版社2003.2
    [47] TS 25.814 V1.01. Physical layer aspects for evolved UTRA[S], 3GPP TSG RAN WGl. Nov.2005.
    [48]金发逊. LTE中高吞吐率Turbo译码器研究[D].中国科学技术大学. 2009.05:3-4.
    [49] Kostas V Koutsouvelis, Christos E Dimakis, A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers[J], in Wireless Personal Communications, 2008,46(3):365-370.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700