Reduced complexity rate-matching/de-matching architecture for the LTE turbo code | IEEE Conference Publication | IEEE Xplore

Reduced complexity rate-matching/de-matching architecture for the LTE turbo code


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 transmit...Show More

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.
Date of Conference: 07-10 December 2014
Date Added to IEEE Xplore: 26 February 2015
Electronic ISBN:978-1-4799-4242-8
Conference Location: Marseille, France

References

References is not available for this document.