Analysis and Design of Tree Based Interleaver for Multiuser Receivers in IDMA Scheme

M. Shukla
Dept. of Electronics Engg. H.B.Technological Institute Kanpur, India

V.K. Srivastava
Dept. of Electronics & Comm. Engg. M.N. National Institute of Technology Allahabad, India

S. Tiwari
Dept. of Electronics & Comm. Engg. M.N. National Institute of Technology Allahabad, India

Abstract-Here, we propose a novel Tree Based Interleaver (TBI) for generating user specific chip-level interleaving sequences for various users in an IDMA system, which reduces computational complexity drastically. This interleaver also solves the memory cost problem and reduces the amount of information exchange between mobile stations and base stations required to specify the interleaver. Simulation results are presented to show that the proposed TBI perform well as compared to Master Random and Random Interleavers in an IDMA scheme.

I.

INTRODUCTION

Interleave division multiple access (IDMA) is a technique where interleaving is the only means for user separation. IDMA not only inherits many advantages in comparison to conventional CDMA, such as robustness against fading and mitigation of cross-cell interference, but also allows very simple chip-by-chip (CBC), iterative multiuser detection (MUD) strategy while achieving impressive performance. In [1], an IDMA system that uses randomly and independently generated interleavers is presented. The IDMA system with random interleaver [1] performs better than a comparable CDMA system with random interleaver. In case, the user specific interleavers are generated independently and randomly, the base station (BS) has to use a large amount of memory to store these interleavers as they are required at transmitter and receiver for interleaving and deinterleaving purpose. It may cause serious concern, when the numbers of users is large. In [4], the method for generation of PEG interleaver is merely using an algorithm to generate the sequence of random interleavers, orthogonal in nature, instead of random selection of respective interleavers [1]. Therefore, the problem of memory requirement is still present for high number of users. If the user specific interleavers are generated by master random interleaver method [2], then problem of high memory requirement is reduced, but the computational complexity required to generate the interleaving sequence is increased extensively, especially when the number of users is large. It is also an important point to mention that in the turbo processor, at the receiver section, frequent interleaving and deinterleaving is required during the process of iterative decoding. Therefore, large amount of calculations are required in receiver section

and hence, the computational complexity is increased drastically when number of users is high. Here, we are examining the proposed Tree Based Interleaver (TBI) to alleviate this concern. With this method, not only the interleaver assignment scheme is simplified and memory cost is greatly reduced, but also the computational complexity required to generate the interleaving matrix is greatly reduced without sacrificing the performance. In Section 2, an introduction to IDMA system is presented. In section 3, we have a brief look over master random interleaver generation method discussed in [2], and explain the computational complexity and memory requirement factors of the interleaver generation methods. Section 4 presents Tree Based Interleaver (TBI) that reduces both the computational complexity and memory requirement factors for interleavers in IDMA scheme. Section 5 presents computer simulations of IDMA systems with the Tree Based Interleaver (TBI). Section 6 concludes the paper. II. IDMA SCHEME A. Scheme Model Here, we consider an IDMA system [1], shown in Figure 1, with K simultaneous users using a single path channel. At the transmitter, a N-length input data sequence d k= [d k (1), , d k (i) , d k (N) ]T of user k is encoded into c k= [c k (1), , c k (j) , c k (J) ]T based on low rate code C, where J is the Chip length. In encoder-spreader block, the code C is constructed by serially concatenating a forward error correction (FEC) code and repletion code of length-sl. The FEC code used here is Memory-2 Rate-1/2 Convolutional coder. We may call the elements in c k chips. Then c k is interleaved by a chip level interleaver k, producing a transmitted chip sequence x k= [x k (1), ,x k (j) , x k (J) ]T . After transmitting through the channel, the bits are seen at the receiver side as r = [r k (1), ,r k (j) , r k (J) ]T . The Channel opted is additive white Gaussian noise (AWGN) channel, for simulation purpose. In receiver section, after chip matched filtering, the received signal form K the K users can be written as (1) r ( j ) = hk x k ( j ) + n ( j ), j = 1, 2, ....... J .
k =1

978-1-4244-3805-1/08/$25.00 2008 IEEE

ICON 2008

where h k is the channel coefficient for k user and { n( j ) } are the samples of an additive white Gaussian noise (AWGN) process with mean as zero and variance 2 =N0 / 2. An assumption is made that {h k} are known priori at the receiver.

th

Then

E ( r ( j )) hk E ( xk ( j ))
k
2 k

Var ( r ( j )) = hk Var ( xk ( j )) + 2

E (k ,l ( j )) = E (r ( j )) hk E ( xk ( j )) Var (k ( j )) = Var (r ( j )) hk Var ( xk ( j ))

2

k ( j ) is the distortion (including interference-plus-noise) in received signal with respect to user-k.

Step (ii): Process for LLR Generation: r ( j ) E ( r ( j )) + hk E ( x k ( j )) e SE B ( x k ( j )) = 2 hk . 2 V ar ( r j ) hk Var ( x k ( j )) Step (iii): Process for updating of data:

Figure 1. Transmitter and Receiver structures of IDMA scheme with K simultaneous users.

eDEC ( xk ( ( j ))) = eSEB ( xk ( ( j )))

j =1

j = 1,..., S

Now, these steps are repeated depending on no. of iterations and users. III. MASTER RANDOM INTERLEAVER GENERATION METHOD In an IDMA scheme, each user has a user specific interleaver { k} having length equal to chiplength J. Therefore, a considerable amount of memory will be required to store the indexes for these interleavers. To minimize this memory cost problem, a master random interleaver method is proposed in [2]. In this paper, a master interleaver is taken, and the subsequent k-interleavers are generated using k = k . where k(c) is defined as 1(c)= (c). 2(c) = ((c)). where is an ideal random permutation. This method not only reduces the amount of information exchange between Base Station (BS) and Mobile Stations (MSs), but also greatly reduces the memory cost in comparison to random interleaver. In generation of interleaver, if the intermediate variables like 2 , (2) 2, are not stored, then for generating the interleaving sequence for the kth user , (k-1) cycles are needed. Even if the intermediate values are stored as stated in the paper [2], it is mentioned that a maximum of 2(n-1) cycles are needed for generating the required interleaver, if 2 n-1 <k<2 n, where n>1 is an integer. In this paper, we examine a Tree Based Interleaver (TBI) to alleviate this concern. IV. TREE BASED INTERLEAVER The Tree Based Interleaver is basically aimed to minimize the computational complexity and memory requirement that

The receiver consists of a signal estimator block (SEB) and a bank of K single user a posteriori probability (APP) decoders (DECs), operating in an iterative manner. The modulation technique used for simulation is binary phase shift keying (BPSK) signaling. The outputs of the SEB and DECs are extrinsic log-likelihood ratios (LLRs) about {x k } defined as

p ( y / xk ( j ) = +1) e( xk ( j )) = log , k , j . p ( y / xk ( j ) = 1)

(2)

These LLRs are further distinguished by the subscripts i.e., eSEB ( xk ( j )) and eDEC ( xk ( j )) , depending upon whether they are generated by SEB or DECs. Due to the use random interleavers { k}, the SEB operation can be carried out in a chip-by-chip manner, with only one sample r(j) used at a time. So, rewriting (2) as r ( j ) = hk x k ( j ) + k ( j ) (3) where

k ( j ) = r ( j ) hk x k ( j ) =

k' k

k'

xk ' ( j ) + n ( j )

(4)

is the distortion in r( j) with respect to user-k. B. Algorithm for Chip-by-Chip Detection A brief description of CBC algorithm [1] has been presented here. The operations of SEB and APP decoding are carried out user-by-user. Algorithm for Chip-by Chip Detection in a single path Channel: Step (i): Set

e DEC ( xk ( j)) = 0

occurs in power interleaver and random interleavers respectively. In a Tree Based Interleaver generation, two randomly generated interleavers are chosen, let 1 and 2 is the two randomly selected interleavers. These interleavers are tested to have zero cross correlation between each other. The combinations of these two interleavers in a particular manner as shown in the figure 2 are used as interleaving masks for the users. The allocations of the interleaving masks follow the tree format. The interleaving masking diagram is shown upon fourteen users only for the shake of simplicity. It is shown through the figure that, for obtaining the interleaving sequence of the 14th user, it needs only 2 cycles of clock, as compared to many more cycles needed in case of master random interleaver method. 14 = 2 ( 2 ( 2 )). The memory required by the Tree Based Interleaver generation method is only slightly more than that required for master random interleaver generation method [2] due to requirement of two orthogonal interleavers in place of one interleaver [2]. The Tree Based Interleaving scheme reduces the computational complexity that occurs in the power interleaving scheme. It is shown by the help of a table below. The results in the figure 3 are shown if the intermediate variables are not stored. The mechanism involved in generation of tree based user specific interleavers is shown in figure 2. The two randomly selected interleavers are solely responsible for generation of other interleavers related to other users.

The algorithm for tree based interleaver is based on selection of combination of two master interleavers which are having zero cross correlation between them. The odd number of users is taken upside while even number of users is taken downside as shown in figure 2. In this manner, large number of users may be allocated with user specific interleavers with extremely less complexity.
Comparison Graph shoeing Complexity of 3 Interleavers 100 90 C o m p le x ity o f in te rle a v e r (N o . o f In t e rle a v in g s / u s e r) 80 70 60 50 40 30 20 10 0 With Random Interelaver With Master Random Interleaver With Tree Based Interleaver

10

20

30

40

50 60 User Number

70

80

90

100

Figure 3: Graph Showing Computational Complexity b/n Random Interleaver, Power Interleaver, and Tree Based Interleaver.

The Memory requirement of Tree Based Interleaver is extremely low as compared to that of the Random Interleaver, while is slightly high if compared with master random interleaver [2], as shown in figure 4.
5 M em ory R equirem ent of Interleav er(N o.of bits required/us er) 4.5 4 3.5 3 2.5 2 1.5 1 0.5 0 x 10
6

Comparison Graph shoeing Memory Requirement of 3 Interleavers with m=256 sl=16 With Random Interleaver With Master Random Interleaver With Tree Based Interleaver

10

20

30

40

50 User Number

60

70

80

90

100

Figure 4: Graph Showing Memory Requirement b/n Random Interleaver, Power Interleaver, and Tree Based Interleaver Figure 2. Interleaving Figure mask allocation for the proposed Tree Based Interleaving scheme.

The Tree Based Interleaving scheme is extremely efficient for reduction of computational complexity as compared to that in Master Random Interleaving scheme [2] as shown in figure 1.

V. NUMERICAL RESULTS For simplicity, assuming IDMA system with BPSK signaling in single path AWGN channels and hk=1, k. Without loss of generality, a uniform CREP {+1, -1, +1, -1, --------} is used with spread length sl =16, for all users and 20

iterations. In figure 5, uncoded IDMA cases are considered, where no forward error correction (CFEC) coding is introduced. The data length is 256 bits is used, for an uncoded system. From figure 5, the performances of IDMA scheme is found to be similar for random and tree based interleavers, while on the front of computational complexity, the tree based interleaver is outperforming the master random interleaver while having very small hike when compared with random interleaver.

REFERENCES
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] Li ping, Lihai Liu, Keying Wu and W. K. Leung, Interleave-Division Multiple-Access, IEEE Trans. Wireless Commun., vol. 5, pp. 938-947, April 2006. H. Wu, L. Ping and A. Perotti, User-specific chip-level interleaver design for IDMA systems, IEEE Elec. Lett., vol. 42, no. 4, Feb. 2006. Li Ping and L. Liu, Analysis and design of IDMA systems based on SNR evolution and power allocation, in Proc. VTC2004-Fall, Los Angles, CA, Sept. 2004 Zhisong Bie,W. Wu, PEG Algorithm Based Interleavers Design for IDMA System, proceedings of IEEE 41st Annual Conference , March, 2007, pp. 480-483 Berrou and A. Glavieux, Near optimum error correcting coding and decoding: Turbo-codes, IEEE Trans. Commun., vol 44, pp. 1261-1271, Oct. 1996. M. Moher, An iterative multiuser decoder for near-capacity communications, IEEE Trans. Commun., vol. 46, pp. 870880, July 1998. S. Brck, U. Sorger, S. Gligorevic, and N. Stolte, Interleaving for outer convolutional codes in DS-CDMA Systems, IEEE Trans. Commun., vol. 48, pp. 11001107, July 2000. Tarable, G. Montorsi, and S. Benedetto, Analysis and design of interleavers for CDMA systems, IEEE Commun. Lett., vol. 5, pp. 420 422, Oct. 2001. F. N. Brannstrom, T. M. Aulin, and L. K. Rasmussen, Iterative multiuser detection of trellis code multiple access using a posteriori probabilities, in Proc. ICC 2001, Finland, June 2001, pp. 1115. J. Viterbi, Very low rate convolutional codes for maximum theoretical performance of spread spectrum multiple-access channels, IEEE J. Select. Areas Commun., vol. 8, pp. 641649, Aug. 1990. S. Verd and S. Shamai, Spectral efficiency of CDMA with random spreading, IEEE Trans. Inform. Theory, vol. 45, pp. 622640, Mar. 1999. M. Moher and P. Guinand, An iterative algorithm for asynchronous coded multi-user detection, IEEE Commun. Lett., vol. 2, pp. 229231, Aug. 1998. R. H. Mahadevappa and J. G. Proakis, Mitigating multiple access interference and intersymbol Interference in uncoded CDMA Systems with chip level interleaving, IEEE Trans. Wireless Commun., vol. 1, pp. 781792, Oct. 2002. L. Liu, W. K. Leung, and Li Ping, Simple chip-by-chip multi-user detection for CDMA systems, in Proc. IEEE VTC-Spring, Korea, Apr. 2003, pp. 2157-2161. Li Ping, L. Liu, K. Y. Wu, and W. K. Leung, A unified approach to multi-user detection and space time coding with low complexity and nearly optimal performance, in Proc. 40th Allerton Conference, Allerton House, USA, Oct. 2002, pp. 170179. L. Liu, W. K. Leung, and Li Ping, Simple iterative chip-by-chip multiuser detection for CDMA systems, in Proc. IEEE VTC 2003, Korea, Apr. 2003. X. Wang and H. V. Poor, Iterative (Turbo) Soft Interference Cancellation and Decoding for Coded CDMA, IEEE Trans. Commun., vol. 47, July 1999, pp. 104661. H. Schoeneich and P. Hoeher, Adaptive interleave-division multiple access A potential air interface for 4G bearer services and wireless LANs, in Proc. WOCN 2004, Muskat, Oman, June 2004, pp. 179182. Theodore S. Rappaport, Wireless Communication, PHI, pp. 25-40, 447-460, 2007.

Figure 5. Comparison of Random Interleaver and TBI with 64 users in single path AWGN channel, with uncoded IDMA systems.

[12] [13]

Considering the memory requirement, the proposed Tree Based Interleaver is far better than random interleaver while having slight increment in memory requirement when compared with master random interleaver. So, we may conclude that Tree Bases Interleaver may replace the random interleaver and master random interleaver efficiently without compromise in system performance. VI. CONCLUSION The proposed Tree Based Interleaver is very easy to generate and is better than the random interleavers in terms of memory requirement problems. The Tree Based Interleaver is better than master random interleaver in terms of computational complexity. The proposed interleavers can take the place of the random and master random interleaver techniques without performance loss.

[14] [15]

[16] [17] [18] [19]