Document not found! Please try again

Reduced Complexity Rate-matching / De- matching ...

25 downloads 0 Views 510KB Size Report
Reduced Complexity Rate-matching / De- matching Architecture for the LTE Turbo Code. 21st IEEE International Conference on Electronics Circuits and ...
21st IEEE International Conference on Electronics Circuits and Systems Special Session III: Error Correction Coding Architectures & Implementation Aspects

Reduced Complexity Rate-matching / Dematching Architecture for the LTE Turbo Code A N G E LO S S PA N O S F OT I O S G I O U L E K A S MICHAEL BIRBAS AT H A N A S I O S VG E N I S

*Patent granted

Presentation overview • Objectives • LTE rate-matching algorithm • Implementation cost • Optimization targets • Proposed channel interleaving algorithm implementation • Proposed channel de-interleaving algorithm implementation • Rate matching implementation • Conclusions

Objectives • Our proposed method presents: • an alternative methodology and an architecture improvement in comparison to the current approaches • whereas the interleaving of the info bits with the parity bits is controlled by a logic block (the address assigner) supporting coding-rates ranging from 1/3 to 1 with adaptive resolution. • Hence, memory blocks are replaced by faster logic achieving low latency and low HW resources utilization.

Interleaving / rate matching specification overview

LTE rate-matching block diagram

Column permutation specification

Code rate matching specification

Serialised    k  TC  TC  modKΠ  + C × k R + ( mod ) 1   RTC      

π (k) =  P 

Towards rate matching

Rate matching specification • Output sequence • Data bit stream • Parity bits in pairs

• Transmission stop condition

(K + 4) transmittedBitStringLength = codeRate

Algorithm 1 Standard Rate Matching Process: Interleaving and Puncturing process 1: 2:

Rate matching algorithm

← 32 ← ! & = 0;

" &=

:

≤(

)

3: #$% ( & + 1; & ≤ ) 4: ,$ 5: #$% ( = 0; = + 1; ≤ ) = 40 ( & ∗ 6: /012(1,0) ( &, + ) = 41 ( & ∗ + 7: /012(1,1) ( &, 8: 89, #$% 9: 89, #$% ) ,$ 10: #$% ( & = 0; & = & + 1; & ≤ 11: #$% ( = 0; = + 1; ≤ ) ← /012(1,0) (;( &), 12: /012(2,0) ( &, ) ← /012(2,0) (;( &), 13: /012(2,1) ( &, 14: 89, #$% 15: 89, #$% 16: 401 ←0 ) ,$ 17: #$% ( & = 0; & = & + 1; & ≤ 18: #$% ( = 0; = + 1; ≤ 19: ?89 (C) ) 20: ← /012(2,0) ( &, @%$A∗ (D) @%$A∗

21:

401 22: 23: 89,

Suggest Documents