DocumentCode :
3568806
Title :
Reduced complexity rate-matching/de-matching architecture for the LTE turbo code
Author :
Spanos, Angelos ; Gioulekas, Fotios ; Birbas, Michael ; Vgenis, Athanasios
Author_Institution :
Univ. of Edinburgh, Edinburgh, UK
fYear :
2014
Firstpage :
411
Lastpage :
414
Abstract :
The task of rate matching is to extract from the blocks of code bits, delivered by the Long Term Evolution (LTE) Turbo Encoding (TE), the exact set of bits to be transmitted within a given transmission time interval, depending on the existing channel conditions. Within this context, we propose algorithmic improvements on the rate matching procedure, which are applied to the TE output streams, and to the corresponding rate de-matching at the receiver side, respectively. The proposed method facilitates an address assigner that on-the-fly controls the memory addressing operations by defining the interleaving/ puncturing of bits to be transmitted. The usage of this controller leads to a significant latency reduction and to the utilization of low memory resources when compared with other conventional approaches deduced by the LTE standard.
Keywords :
Long Term Evolution; turbo codes; LTE turbo code; Long Term Evolution; TE output streams; algorithmic improvements; channel conditions; latency reduction; memory addressing operations; on-the-fly controls; rate dematching architecture; reduced complexity rate-matching; transmission time interval; turbo encoding; Calculators; Complexity theory; Long Term Evolution; Memory management; Multiplexing; Read only memory; Address assigner; LTE; Turbo Code; low memory resources; rate matching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electronics, Circuits and Systems (ICECS), 2014 21st IEEE International Conference on
Type :
conf
DOI :
10.1109/ICECS.2014.7050009
Filename :
7050009
Link To Document :
بازگشت