电子与信息学报
電子與信息學報
전자여신식학보
JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY
2015年
8期
1926-1930
,共5页
Turbo码%交织器%恢复
Turbo碼%交織器%恢複
Turbo마%교직기%회복
Turbo code%Interleaver%Reconstruction
该文提出了一种针对高误码条件下Turbo码交织器的恢复方法,应用于码率为1/3的并行级联Turbo码。信道编码识别是非合作信号处理领域的重要内容,Turbo码交织器的恢复是其中的一个难点。现有的识别方法可以有效地处理无误码时的问题,而实际通信中 Turbo 码经常应用于信道质量较差的情况,此时误码率会较高,且码长较长,这些方法将失效。利用校验向量的特征,可将交织器的每个位置分离开来,单独求解,使得交织器中每个位置的恢复仅依赖于几个相关的位置,避免了误码累加效应,从而解决了在高误码率,长码长时的识别问题,其复杂度较低。在仿真结果中,对典型的长度达10000的随机交织器,接收序列10%误码率的情况下,实现了正确的恢复。
該文提齣瞭一種針對高誤碼條件下Turbo碼交織器的恢複方法,應用于碼率為1/3的併行級聯Turbo碼。信道編碼識彆是非閤作信號處理領域的重要內容,Turbo碼交織器的恢複是其中的一箇難點。現有的識彆方法可以有效地處理無誤碼時的問題,而實際通信中 Turbo 碼經常應用于信道質量較差的情況,此時誤碼率會較高,且碼長較長,這些方法將失效。利用校驗嚮量的特徵,可將交織器的每箇位置分離開來,單獨求解,使得交織器中每箇位置的恢複僅依賴于幾箇相關的位置,避免瞭誤碼纍加效應,從而解決瞭在高誤碼率,長碼長時的識彆問題,其複雜度較低。在倣真結果中,對典型的長度達10000的隨機交織器,接收序列10%誤碼率的情況下,實現瞭正確的恢複。
해문제출료일충침대고오마조건하Turbo마교직기적회복방법,응용우마솔위1/3적병행급련Turbo마。신도편마식별시비합작신호처리영역적중요내용,Turbo마교직기적회복시기중적일개난점。현유적식별방법가이유효지처리무오마시적문제,이실제통신중 Turbo 마경상응용우신도질량교차적정황,차시오마솔회교고,차마장교장,저사방법장실효。이용교험향량적특정,가장교직기적매개위치분리개래,단독구해,사득교직기중매개위치적회복부의뢰우궤개상관적위치,피면료오마루가효응,종이해결료재고오마솔,장마장시적식별문제,기복잡도교저。재방진결과중,대전형적장도체10000적수궤교직기,접수서렬10%오마솔적정황하,실현료정학적회복。
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.