高誤碼率下Turbo碼分量編碼器快速識別算法
doi: 10.11999/JEIT170168 cstr: 32379.14.JEIT170168
-
1.
(海軍航空大學(xué)信息融合所 煙臺 264001) ②(海軍航空大學(xué)電子信息工程系 煙臺 264001)
國家自然科學(xué)基金(91538201),泰山學(xué)者工程專項經(jīng)費(fèi)(ts201511020)
A Fast Algorithm for Blind Identification of Turbo at High BER
-
1.
(Department of Information Fusion, the University of Naval Aeronatical, Yantai 264001, China)
-
2.
(Department of Electronic and Information Engineering, the University of Naval Aeronatical, Yantai 264001, China)
The National Natural Science Foundation of China (91538201), The Taishan Scholar Special Foundation (ts201511020)
-
摘要: 針對目前Turbo碼中,分量編碼器遞歸系統(tǒng)卷積碼識別算法計算量大,容錯性不好兩大缺點(diǎn),該文提出了一種容錯性能較好的快速識別算法。首先,在分析遞歸系統(tǒng)卷積碼特殊結(jié)構(gòu)的基礎(chǔ)上,定義了更具普遍意義的廣義碼重概念;其次,建立出遞歸系統(tǒng)卷積碼生成多項式數(shù)據(jù)庫,按照數(shù)據(jù)庫中多項式是否為實(shí)際編碼多項式的情況,分析出多項式所對應(yīng)的結(jié)果向量廣義碼重概率分布;然后,按照分析出的廣義碼重概率分布,基于極大極小準(zhǔn)則,導(dǎo)出快速識別算法判決門限的計算公式;最后通過遍歷多項式數(shù)據(jù)庫,將遍歷的多項式所對應(yīng)的校驗(yàn)方程廣義碼重值與判決門限比較,從而實(shí)現(xiàn)參數(shù)的快速識別。仿真結(jié)果表明:理論分析出的廣義碼重概率分布與仿真結(jié)果相一致,同時算法容錯性能較好,在誤碼率高達(dá)0.09的條件下,各種編碼約束長度下的遞歸系統(tǒng)卷積碼識別率在90%以上,并且計算復(fù)雜度較小。
-
關(guān)鍵詞:
- 遞歸系統(tǒng)卷積碼 /
- 多項式數(shù)據(jù)庫 /
- 判決門限 /
- 極大極小準(zhǔn)則 /
- 識別
Abstract: In order to solve the defects which are poor error tolerance and large amount of calculation in current algorithms to recognize the Recursive Systematic Convolutional (RSC) encoder in Turbo codes, a new fast algorithm is proposed. Firstly, based on special structure of RSC codes, the concept named generalized code weight is defined which is more general. Secondly, the RSC polynomial database is built up, the probability distribution of generalized code weight can be analyzed under two situation whether the polynomials in database is actual polynomial, then based on distribution and Maxmin criteria, the decision threshold of the fast algorithm is deduced. Finally, the parameters can be recognized by traversing the polynomials in database and compare the corresponding generalized code weight with decision threshold. The simulation results show that theoretical analysis of the probability distribution is consistent with the simulations and the performance of error tolerant is preferable. The actual simulation show that correct rate of recognition can reach above 90% when the rate of bit error is as high as 0.09, besides the computational complexity is low. -
MUKHTAR H, AL-DWEIK A, and SHAMI A. Turbo product codes: applications, challenges, and future directions [J]. IEEE Communications Surveys Tutorials, 2016, 18(4): 3052-3069. doi: 10.1109/COMST.2016.2587863. LI H, GAO Z, ZHAO M, et al. Partial iterative decode of Turbo codes for on-board processing satellite platform[J]. China Communications, 2015, 12(11): 1-8. doi: 10.1109/ CC.2015.7366233. 任亞博, 張健, 劉以農(nóng). 高誤碼率下Turbo碼交織器的恢復(fù)方法[J]. 電子與信息學(xué)報, 2015, 37(8): 1926-1930. doi: 10.11999 /JEIT141556. REN Yabo, ZHANG Jian, and LIU Yinong. Reconstruction of Turbo-code interleaver at high bit error rate[J]. Journal of Electronics Information Technology, 2015, 37(8): 1926-1930. doi: 10.11999/JEIT141556. 劉俊, 李靜, 彭華. 基于校驗(yàn)方程平均符合度的Turbo碼交織器估計[J]. 電子學(xué)報, 2016, 44(5): 1213-1217. doi: 10.3969/ j.issn.0372-2112.2016.05.029. LIU Jun, LI Jing, and PENG Hua. Estimation of Turbo-code Interleaver based on average conformity of parity-check equation[J]. Acta Electronica Sinica, 2016, 44(5): 1213-1217. doi: 10.3969/j.issn.0372-2112.2016.05.029. 謝輝, 黃知濤, 王峰華. 信道編碼盲識別技術(shù)研究進(jìn)展[J]. 電子學(xué)報, 2013, 41(6): 1166-1176. XIE Hui, HUANG Zhitao, and WANG Fenghua. Research progress of blind recognition of channel coding[J]. Acta Electronica Sinica, 2013, 41(6): 1166-1176. BARBIER J. Reconstruction of Turbo-code encoders[J]. The International Society for Optical Engineer, 2005, 5819: 463-473. 解輝, 王峰華, 黃知濤, 等. 基于改進(jìn)歐幾里得算法的卷積碼快速盲識別算法[J]. 國防科技大學(xué)報, 2012, 34(6): 159-162. XIE Hui, WANG Fenghua, HUANG Zhitao, et al. A fast method for blind recognition of convolutional codes based on improved Euclidean algorithm[J]. Journal of National University of Defense Technology, 2012, 34(6): 159-162. 鄒艷, 陸佩忠. 關(guān)鍵方程的新推廣[J]. 計算機(jī)學(xué)報, 2006, 29(5): 711-718. ZOU Yan and LU Peizhong. A new generalization of key equation[J]. Chinese Journal of Computers, 2006, 29(5): 711-718. 劉健, 王曉軍, 周希元. 基于Walsh-Hadamard變換的卷積碼盲識別[J]. 電子與信息學(xué)報, 2010, 32(4): 884-888. doi: 10.3724/SP.J.1146.2009.00359. LIU Jian, WANG Xiaojun, and ZHOU Xiyuan. Blind recognition of convolutional coding based on Walsh- Hadamard transform[J]. Journal of Electronics Information Technology, 2010, 32(4): 884-888. doi: 10.3724/ SP.J.1146.2009.00359. YU P D, LI J, and PENG H. A least square method for parameter estimation of RSC sub-codes of Turbo codes[J]. IEEE Communications Letters, 2014, 18(4): 644-647. DEBESSU Y G, WU H C, and JIANG H. Novel blind encoder parameter estimation for Turbo codes[J]. IEEE Communications Letters, 2012, 16(16): 1917-1920. 于沛東, 李靜, 彭華. 一種利用軟判決的信道編碼識別新算法[J]. 電子學(xué)報, 2013, 41(2): 302-305. YU Peidong, LI Jing, and PENG Hua. A novel algorithm for channel coding recognition using soft-decision[J]. Acta Electronica Sinica, 2013, 41(5): 302-305. 武恒州, 羅霄斌, 劉杰. Turbo碼盲識別技術(shù)研究[J]. 無線電工程, 2015, 45(5): 24-27. WU Hengzhou, LUO Xiaobin, and LIU Jie. Research on blind recognition of Turbo codes[J]. Journal of Radio Engineering, 2015, 45(5): 24-27. 張旻, 陸凱, 李歆昊, 等. 歸零Turbo碼的盲識別方法[J]. 系統(tǒng)工程與電子技術(shù), 2016, 38(6): 1424-1427. doi: 10.3969/ j.issn.1001-506X.2016.06.31. ZHANG Min, LU Kai, LI Xinhao, et al. Blind recognition method for the Turbo codes on trellis termination[J]. Journal of Systems Engineering and Electronics, 2016, 38(6): 1424-1427. doi: 10.3969/j.issn.1001-506X.2016.06.31. NASERI A, AZMON O, and FAZELI S. Blind recognition algorithmn of Turbo codes for communication intelligence systems[J]. International Journal of Computer Science Issues, 2011, 8(6): 68-72. 東陽. Turbo碼盲識別技術(shù)研究與實(shí)現(xiàn)[D]. [碩士論文], 電子科技大學(xué), 2015. DONG Yang. The identification of Turbo-codes and its implementation[D]. [Mater dissertation], University of Electronic Science and Technology of China, 2015. 林曉嫻, 王維歡. SIMD-BF模型上的并行FWHT算法研究[J].計算機(jī)時代, 2011(1): 30-32. LIN Xiaoxian and WANG Weihuan. A study of parallel FWHT algorithm based on SIMD-BF model[J]. Computer Era, 2011(1): 30-32. -
計量
- 文章訪問數(shù): 1478
- HTML全文瀏覽量: 204
- PDF下載量: 168
- 被引次數(shù): 0