Reduced complexity rate-matching/de-matching architecture for the LTE turbo code
暂无分享,去创建一个
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.
[1] Brian K. Classon,et al. Analysis of Circular Buffer Rate Matching for LTE Turbo Code , 2008, 2008 IEEE 68th Vehicular Technology Conference.
[2] Suqin He. Implementation of Rate Matching with Low Latency and Little Memory for LTE Turbo Code , 2013 .
[3] Joseph R. Cavallaro,et al. Efficient hardware implementation of a highly-parallel 3GPP LTE/LTE-advance turbo decoder , 2011, Integr..