一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

高誤碼率下Turbo碼交織器的恢復(fù)方法

任亞博,  張健,  劉以農(nóng)

任亞博, 張健, 劉以農(nóng). 高誤碼率下Turbo碼交織器的恢復(fù)方法[J]. 電子與信息學(xué)報, 2015, 37(8): 1926-1930. doi: 10.11999/JEIT141556
引用本文: 任亞博, 張健, 劉以農(nóng). 高誤碼率下Turbo碼交織器的恢復(fù)方法[J]. 電子與信息學(xué)報, 2015, 37(8): 1926-1930. doi: 10.11999/JEIT141556
Ren Ya-bo, Zhang Jian, Liu Yi-nong. 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
Citation: Ren Ya-bo, Zhang Jian, Liu Yi-nong. 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

高誤碼率下Turbo碼交織器的恢復(fù)方法

doi: 10.11999/JEIT141556
  • 2.

    (清華大學(xué)工程物理系 北京 100084) ②(中國工程物理研究院電子工程研究所 綿陽 621900)

基金項(xiàng)目: 

NSAF基金 (11176005)資助課題

Reconstruction of Turbo-code Interleaver at High Bit Error Rate

  • 2.

    (Department of Engineering Physics, Tsinghua University, Beijing 100084, China)

  • 摘要: 該文提出了一種針對高誤碼條件下Turbo碼交織器的恢復(fù)方法，應(yīng)用于碼率為1/3的并行級聯(lián)Turbo碼。信道編碼識別是非合作信號處理領(lǐng)域的重要內(nèi)容，Turbo碼交織器的恢復(fù)是其中的一個難點(diǎn)?，F(xiàn)有的識別方法可以有效地處理無誤碼時的問題，而實(shí)際通信中Turbo碼經(jīng)常應(yīng)用于信道質(zhì)量較差的情況，此時誤碼率會較高，且碼長較長，這些方法將失效。利用校驗(yàn)向量的特征，可將交織器的每個位置分離開來，單獨(dú)求解，使得交織器中每個位置的恢復(fù)僅依賴于幾個相關(guān)的位置，避免了誤碼累加效應(yīng)，從而解決了在高誤碼率，長碼長時的識別問題，其復(fù)雜度較低。在仿真結(jié)果中，對典型的長度達(dá)10000的隨機(jī)交織器，接收序列10%誤碼率的情況下，實(shí)現(xiàn)了正確的恢復(fù)。
    Abstract: An algorithm to recover a Turbo-code interleaver is proposed at high Bit Error Rate (BER), and it is applied to the 1/3 parallel concatenated Turbo-code. The recognition of channel coding plays an important part in the field of non-cooperative signal processing; recovering a Turbo-code interleaver is one difficulty. There are already some effective algorithms for the noiseless condition, but in actual communication system, Turbo code is often used in a high noisy level, where the BER is high and the word length is long: these algorithms would be ineffective. Using the characteristic of the parity-heck vector, each position of the interleaver can be separated and solved independently. Thus, it makes the recovery of every position only rely on several correlative positions, which avoids the error accumulation effect. The algorithm solves the problem when the BER is high and the code length is long, and it also has low complexity. Simulations show that for a Turbo code with interleaver length 10000 and BER 10%, the algorithm runs successfully.
    • HTML全文
  • 解輝, 黃知濤, 王豐華. 信道編碼盲識別技術(shù)研究進(jìn)展[J]. 電子學(xué)報, 2013, 41(6): 1166-1176.
    Xie Hui, Huang Zhi-tao, and Wang Feng-hua. Research progress of blind recognition of channel coding[J]. Acta Electronica Sinica, 2013, 41(6): 1166-1176.
    Moosavi R and Larsson E G. A fast scheme for blind identification of channel codes[C]. IEEE Global Telecommunications Conference 2011, Linkoping, Sweden, 2011: 1-5.
    Bringer J and Chabanne H. Code reverse engineering problem for identification codes[J]. IEEE Transactions on Information Theory, 2012, 58(4): 2406-2412.
    閆郁翰. 信道編碼盲識別技術(shù)研究[D]. [碩士論文], 西安電子科技大學(xué), 2012.
    Marazin M, Gautier R, and Burel G. Algebraic method for blind recovery of punctured convolutional encoders from an erroneous bitstream[J]. IET Signal Processing, 2012, 6(2): 122-131.
    于沛東, 李靜, 彭華. 一種利用軟判決的信道編碼識別新算法[J]. 電子學(xué)報, 2013, 41(2): 301-306.
    Yu Pei-dong, Li Jing, and Peng Hua. A new algorithm for channel coding recognition using soft decision[J]. Acta Electronica Sinica, 2013, 41(2): 301-306.
    劉建成, 楊曉靜. 基于校驗(yàn)統(tǒng)計(jì)的 (2, 1, m) 卷積碼盲識別[J]. 電子信息對抗技術(shù), 2013, 28(1): 1-4.
    Liu Jian-cheng and Yang Xiao-jing. Blind recognition of (2,1,m) convolutional code based on parity-check Statistics[J]. Electronic Information Warfare Technology, 2013, 28(1): 1-4.
    Karimian Y and Attari M A. Recognition of channel encoder parameters from intercepted bitstream[C]. IEEE 2013 21st Iranian Conference on Electrical Engineering (ICEE), Mashhad, 2013: 1-5.
    Moosavi R and Larsson E G. Fast blind recognition of channel codes[J]. IEEE Transactions on Communications, 2014, 62(5): 1393-1405.
    Barbier J. Reconstruction of Turbo-code encoders[J]. SPIE, 2005, 5819: 463-473.
    Cluzeau M, Finiasz M, and Tillich J P. Methods for the reconstruction of parallel Turbo codes[C]. IEEE International. Symposium on Information Theory, Austin, TX, USA, 2010: 2008-2012.
    Cote M and Sendrier N. Reconstruction of a Turbo-code interleaver from noisy observation[C]. IEEE International Symposium on Information Theory, Austin, TX, USA, 2010: 2003-2007.
    張永光. 一種Turbo碼編碼參數(shù)的盲識別方法[J]. 西安電子科技大學(xué)學(xué)報, 2011, 38(2): 167-172.
    Zhang Yong-guang. Blind recognition method for the Turbo coding parameter[J]. Journal of Xidian University, 2011, 38(2): 167-172.
    李嘯天, 李艷斌, 昝俊軍, 等. 一種基于矩陣分析的 Turbo 碼長識別算法[J]. 無線電工程, 2012, 42(4): 23-26.
    Li Xiao-tian, Li Yan-bin, Zan Jun-jun, et al.. An algorithm for recognition of Turbo code length based on matrix analysis[J]. Radio Engineering of China, 2012, 42(4): 23-26.
    李嘯天, 張潤生, 李艷斌. 歸零 Turbo 碼識別算法[J]. 西安電子科技大學(xué)學(xué)報, 2013, 40(4): 161-166.
    Li Xiao-tian, Zhang Run-sheng, and Li Yan-bin. Research on the recognition algorithm of Turbo codes on trellis termination[J]. Journal of Xidian University, 2013, 40(4): 161-166.
    Valembois A. Detection and recognition of a binary linear code[J]. Discrete Applied Mathematics, 2001, 111(1): 199-218.
  • 加載中
計(jì)量
  • 文章訪問數(shù):  1012
  • HTML全文瀏覽量:  114
  • PDF下載量:  506
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2014-12-08
  • 修回日期:  2015-03-23
  • 刊出日期:  2015-08-19

目錄

    /

    返回文章
    返回