Efficient implementation of rate matching for LTE turbo codes

Rate matching is an important component in 3
^rd
Generation Partnership Project (3GPP) Long Term Evolution (LTE) and has a strong impact on its error correcting performance. Rate matching is part of error correct coding, which can impact the performance of hybrid ARQ (HARQ). Circular buffer rate matching algorithm has many advantages over earlier rate matching algorithm. One of its advantages is simple and flexible for any arbitrary code rate in LTE with excellent performance. In this paper, an efficient method to implement high throughput processing is proposed. The method is to rearrange the data order in memory to improve throughput and latency. However, implementation of rate matching is not very straightforward with the modified method. With the aid of the proposed method, rate matching can be implemented in parallel processing with low latency for high date rate applications.