Analysis and design of interleavers for iterative multiuser receivers in coded CDMA systems

We deal with the design of interleavers in a coded code-division multiple-access (CDMA) scenario, where at the receiver an iterative turbo-like structure to perform multiuser detection is employed. The choice of the interleavers affects both the maximum-likelihood (ML) performance and the impact of the suboptimality of the iterative receiver. First, heuristic criteria of goodness for a set of interleavers, each assigned to a given active user, are introduced and motivated. One of these criteria is based on the intersection between the equivalent codes seen after the interleavers for each user pair. The design rules are valid for any kind of channel code. In particular, when the channel code used by every user is a terminated convolutional code, a very simple design rule, in the subset of congruential interleavers, is specified. The suitability of an interleaver set to iterative decoding is also treated. The analysis leads to a design rule which is shown to have great importance on the performance of a turbo-like receiver. Numerical results assess the validity of the derived design rules by showing that, for iterative multiuser receivers and reasonable block lengths, the suitability to iterative decoding is more important than the performance optimization.     

Analysis and design of interleavers for CDMA systems

The turbo-principle has been applied to multiuser receivers in CDMA systems. However, the role of interleavers in these turbo-receivers has not been studied yet. In this paper, we give a notion of optimality and of mutual optimality and a way to test it. Moreover, limiting the discussion to congruential interleavers and convolutional codes, we give sufficient conditions to construct a set of mutually optimal interleavers. Also, we provide some simulations to support our results     

On the Design of Space–Time Trellis Codes for Transmit-Correlated Fading Channels

The analysis and design of space-time codes for correlated fading channels when the diversity gain is large enough is considered. We derive a simple form for a distance metric that characterizes the code performance in the presence of transmit correlation, and propose some design criteria to build good space-time trellis codes (STTCs) for correlated channels. For the case of two transmit antennas, we show that in strongly correlated channels, performance is governed by the constellation that results from the sum of the constellations associated with the transmit antennas. This suggests the use of new constellations to design better codes for correlated channels. The design criteria are then extended to any number of transmit antennas. Based on these criteria, we derive new STTCs for two and three transmit antennas that perform much better in correlated channels than the STTC optimized for the independent and identically distributed case. We also consider set partitioning applied to the sum constellation as a simple technique to design good codes for correlated channels. The codes derived show performance close to the codes found by an exhaustive search. Finally, we consider antenna selection as an alternative to build good codes for more than two antennas in fading-correlated scenarios     

Design of Prunable Interleavers for Parallel Turbo Decoder Architectures

In this paper we propose a technique to implement in a parallel fashion a turbo decoder based on an arbitrary permutation, and to expand its interleaver in order to produce a family of prunable S-random interleavers suitable for parallel implementations. We show that the spread properties of the obtained interleavers are almost optimal and we prove by simulation that they are very competitive in terms of error floor performance. A few details on the decoder architecture are also provided     

Mapping interleaving laws to parallel turbo decoder architectures

For high data rate applications, the implementation of iterative turbo-like decoders requires the use of parallel architectures posing some collision-free constraints to the reading/writing process in the soft-input soft-output (SISO) decoders. Contrary to the literature belief, we prove in this paper that the parallelism constraints can be met by any permutation law employed by the turbo-interleaver, and we give a constructive method to satisfy those constraints.     

Mapping interleaving laws to parallel turbo and LDPC decoder architectures

For high-data-rate applications, the implementation of iterative turbo-like decoders requires the use of parallel architectures posing some collision-free constraints to the reading/writing process from/into the memory. This consideration applies to the two main classes of turbo-like codes, i.e., turbo codes and low-density parity-check (LDPC) codes. Contrary to the literature belief, we prove in this paper that there is no need for an ad hoc code design to meet the parallelism requirement, because, for any code and any choice of the scheduling of the reading/writing operations, there is a suitable mapping of the variables in the memory that grants a collision-free access. The proof is constructive, i.e., it gives an algorithm that obtains the desired collision-free mapping. The algorithm is applied to two simple examples, one for turbo codes and one for LDPC codes, to illustrate how the algorithm works.