Efficient implementation of bit-rate matching for LTE-A with sub-matrix transpose technique

This work proposes an efficient software implementation of circular buffer rate matching algorithm in Long Term Evolution Advanced (LTE-A). Rate matching algorithm in LTE-A performs bit re-positioning to randomize the data bits. Due to data format mismatch, such algorithm is inefficient in commodity word-based microprocessors. This work implements the transposed matrix with one or a few square sub-matrices, and each sub-matrix is performed with perfect shuffling operations. Performance of the algorithm is evaluated on the Texas Instruments C6416 with CCS-5.0. According to the results, order of magnitude performance enhancement can be achieved.