This paper discusses circular buffer rate matching (CBRM) algorithms for the turbo code in the long term evolution (LTE) of the WCDMA-based air interface. To enhance performance at high code rates, systematic bit puncturing is incorporated in conjunction with the CBRM. The RM algorithm is further optimized based on the algebraic properties of the QPP interleavers and the 8-state recursive systematic convolutional code of the LTE turbo code.

The Long Term Evolution (LTE) of the WCDMA standard requires turbo decoding throughputs of up to 100 Mbps. Unfortunately, the existing WCDMA turbo interleaver does not permit an efficient high throughput implementation. The almost regular permutation (ARP) and quadratic polynomial permutation (QPP) interleavers were proposed to rectify this situation with QPP selected for LTE. In this paper, the interleavers are compared and a full suite of LTE designs and performance results for both are presented.

This paper presents a low-complexity interleaver design that facilitates the high throughput turbo decoding required for next generation wireless systems. Specifically, it addresses the interleaver design issues that arise when several Log-MAP processors are used in parallel to improve turbo decoding throughput. In such a parallel decoder, memory access contentions occur when more than one extrinsic value is to be written to or read from the same memory block at the same time. These contentions may be avoided by designing contention- free (CF) interleavers that incorporate hardware constraints into the interleaver description. The paper first derives bounds on the number of CF interleavers, demonstrating that the fraction of interleavers of a given size that are contention-free is quite small. In spite of this, a class of contention-free "inter-window shuffle" (IWS) interleavers are shown via simulation to achieve near-WCDMA performance. Further, the paper shows that the memory requirement of CF IWS interleavers is small compared to an alternate contention-resolving method that uses a modified memory addressing scheme. Finally, we note that the advantages of contention-free interleavers have led to the adoption of a CF quadratic permutation polynomial (QPP) interleaver in the 3 GPP long term evolution (LTE) standard.

Interleavers that avoid memory contentions in parallelized log-MAP decoding are analyzed and designed. Bounds are derived demonstrating that the fraction of interleavers that are contention-free is small. Nevertheless, contention-free "inter-window shuffle" interleavers with a simple implementation and reasonable memory requirements are shown to surpass 3GPP performance.

This paper summarizes the propagation characteristics of a 20 MHz channel at a carrier frequency of 3.676 GHz transmitted from a two-antenna base to a two-antenna mobile receiver. The experiments were conducted in a moderate density suburban setting outside Chicago, Illinois. The transmit and receive systems are described, as are the data collection procedures and data analysis. The results include path loss measurements and various metrics of the MIMO channel, such as channel impulse responses, rms delay spread, and other spatial characteristics.

This letter studies the numerical properties of log-MAP-based soft-input soft-output decoding. The ranges of the differences between the path metrics, the soft output, and the complete information are derived. Since the log-MAP algorithm is functionally dependent only upon the differences between path metrics, not their magnitudes, a module normalization technique that is automatically implemented in two's complement arithmetic can be used to accommodate overflow of the path metrics. An expression for the minimum internal data width of a soft-input soft-output decoder that employs the module normalization technique is derived. As an application, the minimum internal data width of a decoder for the turbo code used in third-generation mobile communication systems is determined.