SlideShare ist ein Scribd-Unternehmen logo
1 von 13
Downloaden Sie, um offline zu lesen
Journal of Information Engineering and Applications                                            www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011



      Iterative IDMA Receivers with Random and Tree Based
                          Interleavers
                                 Kulbhushan Gupta 1 C.K. Shukla2 M. Shukla3*
    3.   Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed University), Allahabad, India
    4.   Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed University), Allahabad, India
    5.   Harcourt Butler Technological Institute, Kanpur, India
    * E-mail of the corresponding author: manojkrshukla@gmail.com


Abstract
In recent days, on the horizon of wireless world, newly proposed multiple access scheme known as
Interleave-Division Multiple-Access (IDMA) has made its remarkable impact. Researchers all over world,
are making hard marks to establish the scheme to establish its claim as potential candidate for 4th generation
wireless communication systems. This paper is concerned with the performance enhancement of iterative
IDMA systems under coded & uncoded environment. The performance of an interleave division multiple
access (IDMA) system can be improved by the optimized power allocation techniques. Based on the
optimized power allocation technique we compare the performance of coded & uncoded IDMA system
with random interleaver & tree based interleaver. During the simulation, it has been observed that tree
based interleaver demonstrate the similar bit error rate (BER) performance to that of random interleaver
however on other fronts including bandwidth and memory requirement at transmitter and receiver ends, it
outperforms the random interleavers.
Keywords: Tree Based Interleaver, Random Interleaver, IDMA, linear programming, power allocation,
BER.


1. Introduction
The well established Direct-Sequence code-division multiple-access (DS-CDMA) which is also known as
simply CDMA has been adopted in second and third generation cellular mobile standards. The CDMA
scheme possesses many attractive features such as dynamic channel sharing, mitigation of cross-cell
interference, asynchronous transmission, ease of cell planning, and robustness against fading.
In CDMA system, many users share the same transmission media so that signals from different users are
superimposed, causing the multiple access interference (MAI) problems. At the receiver side, it is
necessary to separate the mixed signals. Multi-user detection (MUD) is a technique to improve
performance by jointly processing the signals forms all of the users.
Recently, it has been shown that multiuser detection together with unequal power control can enhance the
performance of code division multiple access (CDMA) systems. The complexity and computational cost is
the major problem of CDMA systems.
Interleave Division Multiple Access (IDMA) scheme in which interleavers are employed as the only means
of user separation. Interleave division multiple access (IDMA) is a special case of random waveform
CDMA, and the accompanying chip-by-chip (CBC) estimation algorithm is essentially a low cost iterative
soft cancellation technique [Ping L. & Lihai L. (2004)].
The chip-by-chip (CBC) MUD algorithm for IDMA is an iterative soft cancellation technique for treating
multiple access interference (MAI). Its computational cost is very low, being independent of the total
number of users when normalized to each user [Wang P., Ping L. & Liu L. (2006)].
With equal power control, it has been shown in [Liu L., Tong J. & Ping L. (2006)] that IDMA together with
CBC algorithm can achieve performance close to the theoretical limits. Unequal power allocation is a
technique to further enhance system performance. In [3], a linear programming technique is employed for
13 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                                       www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


power optimization of IDMA systems over additive white Gaussian noise (AWGN) multiple access
channels (MACs).
In this paper, we use the unequal optimized power allocation technique to the uncoded-IDMA system with
random interleavers & tree based interleavers. After that we compare their performance and reach to the
conclusion.
Section 2 contains an introduction of the IDMA communication system. In section 3, we discussed about
tree based interleaver. In section 4 we discussed the power allocation techniques in brief. Section 5
presents the simulation results of uncoded-IDMA with random interleaver and tree based interleaver.
Section 6 concludes the paper.


2. Iterative IDMA System

2.1. System Model
Consider an IDMA system with k users. At the transmitter side, the information bits for user k are first
encoded by an encoder (ENC) based on a FEC code and then interleaved and transmitted over a Gaussian
multiple access channel (MAC). The received signal can be written as;
                      K
            r ( j ) = ∑ hk xk ( j ) + n ( j ) ,            j = 1,2,...J                   (1)
                      k =1
Where xk ( j ) ∈ {+1, −1} is the jth chip transmitted by user-k, hk the coefficient for user-k representing
                                                                          {           }
the combined effect of power control and channel loss, and n ( j ) are samples of an AWGN process with
zero-mean and variance σ = N 0 / 2 [4].
                          2


The receiver consists of an elementary signal estimator (ESE) and k a posteriori probability (APP)
decoders (DECs), operating iteratively.
For each user k, we rewrite (1) as;
                                   r ( j ) = hk xk ( j ) + ξ k ( j )                                          (2)
where,


                                    ξ k ( j ) = ∑ hk ′ xk ′ ( j ) + n ( j )                                         (3)
                                                  k ′≠ k

2.2 The CBC Algorithm
                                                                          (
                                          E ( xk ( j ) ) = tanh eDEC ( xk ( j ) ) 2 , ∀k , j        )                               (4)
                                                                               (
                                             Var ( xk ( j ) ) = 1 − E ( xk ( j ) ) , ∀k , j     )
                                                                                       2
                                                                                                                                    (5)
                                                 E (ξ k ( j ) ) = ∑ hk ′ xk ′ ( j ) , ∀k , j                                        (6)
                                        Var (ξ k ( j ) ) = ∑ hkk′ ′≠Var ( xk ′ ( j ) ) + σ 2 , ∀k , j
                                                                   2k
                                                                                                                                    (7)
                                             (
            eESE = {2hk / Var (ξk ( j ) )} r( j) − E (ξkk′≠ kj ) ) , ∀k, j
                                                          (               )                             (8)
After    (8),   the    APP       decoding     in           the   DECs         is     performed      to        generate      the   LLRs
{                            }
 eDEC ( xk ( j ) ) , ∀k , j .Then go back to (4) for the next iteration.

    3.   Tree Based Interleaving Mechanism
In iterative IDMA system each user has a specific interleaver                      {π k } having length equal to chip length ‘J’.
A considerable amount of memory will be required to store the indexes for these interleavers. The tree
based interleaver is basically aimed to minimize the computational complexity and memory requirement
14 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                                             www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


that occurs in power interleaver & random interleavers respectively [Shukla M., Srivastava V.K. & Tiwari
S. (2009)].
In a tree based interleaver generation, two randomly generated interleaver are chosen. Let π 1 and π 2 be
the two random interleavers. The combinations of these two interleavers in a particular fashion as shown in
the figure 2 are used as interleaving masks for the users [Shukla M., Srivastava V.K. & Tiwari S. (2009)].
The allocations of the interleaving masks follow the binary tree format. The interleaving masking diagram
is shown upon 14 users for simplicity. It is clearly shown through the figure that, for obtaining the
interleaving sequence of the 14th user, it need only 2 cycles, as in [Shukla M., Srivastava V.K. & Tiwari S.
(2009)].
 π 14 = π 2 (π 2 (π 2 ) )

    4. Power Allocation Strategy for Users
This section is concerned with the power optimization technique for IDMA systems over AWGN channels.


4.1 Problem Formulation:


                     { }                                                                                                              ( )
For simplicity, we assume that, for all users, the same FEC code is used and the same BER performance is
                  (l )                                                                                   (l )
required. Let γ k      be the average SNIR for the outputs of the ESE after the l-th iteration & f k γ k
                                                                                                (l )
be the average variance of the outputs of DECk driven by an input sequence with SNIR γ k [Shukla
M., Srivastava V.K. & Tiwari S. (2006), Shukla M., Srivastava V.K. & Tiwari S. (2009)].
                                (l )
We can approximately track γ k using the following recursion;
                                                                                       2
                                           ( l +1)                       Pk hk
                                      γk             =                                               , ∀k , l = 0,1,....( L − 1)
                                                                               ( )
                                                                                                                                           (10)
                                                         ∑P h                fi γ i ( ) + σ 2
                                                                         2                 l
                                                                 i   i
                                                         i≠k
where L is the maximum number of iterations.
For AWGN channels, we have,
                        hk = 1, ∀κ
                            2


Then recursion (10) reduces to,
                                                                              Pk
                                            γ k (l +1) =                                          , ∀k , l = 0,1,....( L − 1)
                                                                             ( )
                                                                                                                                           (11)
                                                               ∑ Pi fi γ i(l ) + σ 2
                                                               i≠k
Our objective now is to minimize total power ∑ Pk while achieving the required
               (l )
performance γ k ≥ Γ, ∀k , for specified Γ [2]. This power optimization problem can be formulated as
                                                              k


follows.

4.2 Power optimization over AWGN channels:
Find the distribution { Pk } that minimizes,
                                                                                                 Φ = ∑ Pk                                  (12)
subject to,                                                                                             k
                                                                                               γ k (l ) ≥ Γ, ∀k
        { }
                                                                                                                                           (13)
              (l )                                                                                                                   (0)
where γ k            are obtained through the following SNIR evolution process with initialization γ k                                     =0,
for all k.
                                                                             Pk
                                           γ k (l +1) =                                           , ∀k , l = 0,1,....( L − 1)
                                                                             ( )
                                                                                                                                           (14)
                                                               ∑ Pi fi γ i( ) + σ 2
                                                               i≠k
                                                                                   l




15 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                                                                        www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


Problem (14) is generally nonlinear and non-convex. The problem considered above is to find the
minimum sum-power solution within the feasible region [Shukla M., Srivastava V.K. & Tiwari S. (2009)].
We define the total interference after the l-th iteration of recursion (11) as,
                                                                                   I ( ) = ∑ Pk f k γ k ( ) + σ 2
                                                                                     l

                                                                                            k =1
                                                                                                                  ( )    l
                                                                                                                                                                   (15)

Then (11) can be rewritten as
                                                       Pk
                       γ k (l +1) =                                          , ∀k , l = 0,1,....( L − 1)
                                                                ( )
                                                                                                                                                 (16)
                                          (l )
                                                 − Pk f k γ k ( )
                                                                    l
                                      I

B. Linear Programming Approach:

In problem (12), the constraints (13) & (14) are nonlinear with respect to the optimization variables { Pk } ,
which makes the problem complicated. We therefore consider a linearization technique to solve this
problem.
We quantize the power levels { Pk } into (M+1) discrete levels : { P(m), m=0,1,……M} with P(m-1) <
P(m), m=1,2,…….M, and partition the k users into (M+1) groups according to their power levels. Letting
 λ (m) denote the number of users assigned with power level P(m) [Shukla M., Srivastava V.K. & Tiwari S.
(2009)].
Then total power (12) is rewritten as
                                                                                             φ = ∑ λ (m)P(m)                                                       (17)
                                                                                                              m
and the number of users k can be represented as,
                     k = ∑ λ ( m)                                                            (18)
                           m
γ ( l ) ( m)
         be the SNIR of the ESE outputs for the users in the group with power P(m) after the l-th iteration
and assume that user-k has power P(m). Then (15) & (16) can be rewritten as,

                                      I ( ) = ∑ λ ( m) P ( m) f γ
                                             l

                                                        m
                                                                                            (      (l )
                                                                                                          (m) +σ 2   )                              (19)

                                                      ( l +1)                               P (m)
                                                  γ             (m) =                                                            , ∀k , l = 0,1,....( L − 1)       (20)
                                                                        I   (l )
                                                                                   − P ( m) f γ      (        (l )
                                                                                                                     ( m)    )
Since   {I ( ) } is a monotonically decreasing sequence, i.e.,
               l



                                                                             I(
                                                                                    l +1)
                                                          ≤ I ( ) , l=0, 1,….. (L-1)
                                                               l
                                                                                                      (21)
Substituting (21) into (20) and introducing a delay factor δ ( 0 < δ < 1) to control the convergence speed
of the iterative detection, we get,


                                                                ∑ λ (m)P(m) f (γ ( ) (m) ) + σ
                                                                m
                                                                                                          l                         2
                                                                                                                                        ≤ (1 − δ ) I ( )
                                                                                                                                                      l
                                                                                                                                                                   (22)

                l=0, 1,………… (L-1)
Now we take {λ ( m)} as optimization variables. In this case both the target function (17) and the
constraints (18) & (22) appear linear with respect to {λ ( m)} . However γ
                                                                             ( l +1)
                                                                                     (m) in (20) is dependent
on {λ ( m)} . Now, γ
                       ( l +1)
                               (m) can be treated as pre-calculated parameter when linear programming is
applied.
Using an approximation,


16 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                                  www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


                                                             ( l +1)                          P ( m)
                                                        γ              ( m ) ≈ γ ∗ ( m) =                                    (23)
                                                                                               I (l )
* denotes approximation.
We can rewrite (22) as
                                                              P ( m) 
                                      ∑ λ (m)P(m) f
                                       m
                                                             
                                                               I 
                                                                       + σ ≤ (1 − δ ) I , I min ≤ I ≤ I max
                                                                           2
                                                                                                                             (24)

where I max & I min specify the total interference at the beginning and end of the iterative detection and the
                       (l )
iteration index l for I is omitted. We evaluate (24) at a set of quantized values of I:{I(n),n=0,1,..N}. By
                {                            }                     { }
pre-calculating f m , n = f ( P ( m) I ( n ) ) and using f m ,n as constants, we obtain a group of linear
constraints with respect to {λ ( m)} [2].
In summary, we have
                                                                    φ = ∑ λ (m)P(m)                                          (25)
                                                                               m
subject to
                                                                    ∑ λ ( m) = k                                             (26)
                                                            λ (m) ≥ 0, m = 0,1,....M
                                                                     m                                                       (27)
                                                                    P ( m) 
                                             ∑ λ (m)P(m) f
                                             m
                                                                   
                                                                    I 
                                                                             + σ ≤ (1 − δ ) I , I min ≤ I ≤ I max
                                                                                 2                                           (28)

Let y (m) denotes the total power of these   λ (m) users. As such,
                                                                       y(m)= λ (m) P(m)                                      (29)
Substituting (29) into (25),(27) & (28) we get
                                                                           φ = ∑ y ( m)                                      (30)
subject to,                                                                            m

                                                       P ( m) 
                                     ∑ y ( m) f
                                      m
                                                      
                                                        I 
                                                                + σ ≤ (1 − δ ) I , I min ≤ I ≤ I max
                                                                    2
                                                                                                                             (31)

                                                         y (m) ≥ 0, m = 0,1,....M . (32)
In practice in [1], both P and I should be quantized. We need to determine the searching
ranges Pmin , Pmax , I min & I max . Let us quantize P and I as
                                                      P(m) = α m Pmin , m = 0,1,....M                                        (33)
                                                              I (n) = β n I min , n = 0,1,....N                              (34)
with P(0)= Pmin >0, P(M)= Pmax ,I(0)= I min >0, I(N)= I max , α >1 and                     β >1.
Then (31) becomes,
                                                 ∑ y ( m ) f (α
                                                  m
                                                                           m
                                                                               β − nγ ) + σ 2 ≤ (1 − δ ) β n I min           (35)

                                                   Since     γ = Pmin I min                      (36)
The minimum SNR is obtained at the end of the iterative decoding process. Here γ can be determined by
the desired BER. For more details about the relation between γ and BER see in [1]. Since
                                                                                       y ( m)    y (m)α − m
                                                 k = ∑ λ (m) = ∑                              =∑                             (37)
                                                         m                         m   P(m) m γ I min
We get,
                                                             ∑ y(m)α
                                                               m
                                                                                   −m
                                                                                        − kγ I min = 0                       (38)

We can replace (31) by (35). We can also include (38) as part of the LP constraints. In this way
I min becomes an optimization variable and Pmin can be determined from I min by (36) [1].
17 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                         www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


We still need to determine M and N in (33) & (34). In general, we just use a sufficient large M, since the
LP will automatically determine the maximum power level used. We start with a relatively small N.
If after the LP,
                                                  I max = ∑ y (m) ×1 +σ 2 > I ( N )                   (39)
                                                          m
then the quantization range in (34) is not sufficient and we increase N and repeat the LP until
 I max ≤ I ( N ) .
     5. Simulation Results
The power profiles for 32, 48, 64 users are given below in the Table 1.
As we see that the performance improves with increased data lengths. We can also see that a data length of
512 is sufficient to achieve relatively good performance. Performance enhancement is marginal with
information block longer than 512.
                                                                                     −4
If user count is k ≤ 32, then fewer than 20 iterations are sufficient (measured at 10 ) and more iterations
do not bring about significant performance improvement. However, when user count is K ≥ 48, more
iteration can be beneficial [Shukla M., Srivastava V.K. & Tiwari S. (2008), Shukla M., Srivastava V.K. &
Tiwari S. (2006)].

     6. Conclusion
As we see from the simulation results that in unequal power allocation technique with Tree based
interleaver based uncoded and coded IDMA system gives the better results in comparison to random
interleaver based IDMA system.
So using Tree based interleaver in IDMA system with unequal optimized power allocation technique will
enhance the performance in comparison to random interleaver and also reduce the memory cost &
computational complexity.

References
Ping L. & Lihai L. (2004), “Analysis and Design of IDMA Systems Based on SNR Evolution and Power
Allocation”, Proceedings of Vehicular Technology Conference VTC 2004-Fall, IEEE, 1068-1072.
Wang P., Ping L. & Liu L. (2006), “Power Allocation for Multiple Access Systems with Practical Coding
and Iterative Multi-User Detection”, Proceedings of International Conference ICC`06, 11, IEEE, 4971-
4976.
Liu L., Tong J. & Ping L. (2006), “Analysis and Optimization of CDMA Systems with Chip-Level
Interleavers”, Journal Selected Areas in Communication, 24, IEEE, 141-150.
Ping L., Wu Y. & Leung W. (2006),”Interleave-Division Multiple-Access”, Transaction on Wireless
Communication, 5 (4), IEEE. 938-947.
Shukla M., Srivastava V.K. & Tiwari S. (2009), “Analysis and Design of Optimum Interleaver for Iterative
Receivers in IDMA Scheme”, Journal of Wireless Communication and Mobile Computing, 9(10), Wiley
1312-1317.
Shukla M., Srivastava V.K. & Tiwari S. (2006), “Interleave Division Multiple Access for Wireless
Communication”, Proceedings of International Conference on Next Generation Communication Systems:
A Perspective’, “ICONGENCOM 06”, J.K. Institute, Allahabad, India, 150-154.
Shukla M., Srivastava V.K. & Tiwari S. (2008), “Analysis and Design of Tree Based Interleaver for
Multiuser Receivers in IDMA Scheme”, Proceedings of International Conference on Networks “ICON
2008”, Delhi, India, IEEE, 1-4.




18 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                        www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


Shukla M., Shukla A., Srivastava V.K., & Tiwari S. (2009), “Different Designing Factors for IDMA
Systems”, Proceedings of International Conference on Computer, Communication, and Control and
Information Technology “C3 IT 2009”, Calcutta, India, Academy Publishers, 748-756.
Shukla M., Srivastava V.K. & Tiwari S. (2006), “A Novel Interleaver for Interleave Division Multiple
Access Scheme”, Proceedings of International Conference on Information and Communication Techniques
“ICCT 07”, Dehradun, India, 843-846.
Shukla M., Srivastava V.K. & Tiwari S. (2009), “Analysis of Optimum Interleaver for Iterative Receivers in
IDMA Scheme”, Proceedings of International Conference on Computing and Networking “ICDCN 2009”,
Springer, 400-407.
Shukla M., Srivastava V.K. & Tiwari S. (2009), “Performance Analysis of Tree Based Interleaver with
IDMA Systems using Optimum Power Allocation Algorithm”, Proceedings of International Conference on
Emerging Trends in Engineering & Technology “ICETET-09”, IEEE, 1173-1177.




                                                 Table 1
                                  Power Profile For 32, 48 & 64 Users
                                 (power level(dB)) × (user number)
                       K=32      0 × 25, 5.3811 × 7
                       K=48      0 × 26, 7.4509 × 8, 10.3484 × 8, 10.7623 × 6
                       K=64      0 × 25, 7.8645 × 7, 8.2784 × 7, 13.2455 × 5
                                 13.6594 × 7, 18.6266 × 13




19 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                               www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


           Figure 1. (a) The transmitter for user-k. (b) A part of the receiver related to user-k.


                                                                       П1(П1(П1))    7
                                                            3

                                                     П1(П1)
                                                                       П1(П1(П2))    11

                                           1

                                                                       П1(П2(П1))    9
                                           П1
                                                        5

                                                     П1(П2)
                                                                       П1(П2(П2))    13

                                                                   П2(П1(П1))        8
                                                            4

                                                    П2(П1)
                                           2

                                                                   П2(П1(П2))        12
                                               П2

                                                                   П2(П2(П1))        10
                                                        6

                                                    П2(П2)


                                                                   П2(П2(П2))        14

         Figure 2. Interleaving mask allocation for the proposed Tree based interleaving scheme


                                  0
                                                            withoutcoding random interleaver 32 users
                                 10


                                  -1
                                 10


                                  -2
                                 10
                Bit Error Rate




                                  -3                            datalength=128
                                 10
                                                                datalength=256
                                                                datalength=512
                                  -4                            datalength=1024
                                 10


                                  -5
                                 10


                                  -6
                                 10
                                       2            4              6         8           10   12        14   16
                                                                                 Eb/No

                                                        Figure 3 (a). 32 users Random Interleaver




20 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                                             www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011



                                                  0
                                                            without coding tree based interleaver 32 users
                                             10


                                                  -1
                                             10


                                                  -2
                                             10
                            Bit Error Rate




                                                  -3                datalength=128
                                             10
                                                                    datalength=256
                                                                    datalength=512
                                                  -4
                                             10                     datalength=1024


                                                  -5
                                             10


                                                  -6
                                             10
                                                       2   4            6           8           10        12     14   16
                                                                                        Eb/No
                                                           Figure 3 (b). 32 users Tree Based Interleaver

                                             0
                                                                   without coding 64 users random interleaver
                                 10


                                             -1
                                 10


                                             -2
                                 10
           Bit Error Rate




                                             -3                     datalength=128
                                 10
                                                                    datalength=256
                                                                    datalength=512
                                             -4                     datalength=1024
                                 10


                                             -5
                                 10


                                             -6
                                 10
                                                  0            5               10                    15         20         25
                                                                                        Eb/No

                                                               Figure 4 (a). 64 users Random Interleaver




21 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                                         www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011



                                      0
                                                         without coding tree based interleaver 64 users
                                     10




                                      -1
                                     10
             Bit Error Rate




                                      -2
                                     10                       datalength=512
                                                              datalength=1024
                                                              datalength=256
                                                              datalength=128
                                      -3
                                     10




                                      -4
                                     10
                                          2        4     6      8      10     12         14   16        18   20        22
                                                                             Eb/No

                                                       Figure 4 (b). 64 users Tree Based Interleaver

                                           Comparison of with and without coding 16 users random interleaver
                                          -1
                                     10

                                                                                         datalength=512
                                                                                         datalength=2048
                                          -2
                                     10
                    Bit Error Rate




                                          -3
                                     10




                                          -4
                                     10




                                          -5
                                     10
                                               2         4             6             8             10             12
                                                                            Eb/No
                                          Figure 5 (a). 16 users Random Interleaver with and without coding




22 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                                         www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011



                                   -1
                                            16 users with and without coding tree based interleaver
                                  10
                                                                                     datalength=512
                                                                                     datalength=2048
                                   -2
                                  10



                                   -3
                 Bit Error Rate




                                  10



                                   -4
                                  10



                                   -5
                                  10



                                   -6
                                  10
                                        2          4            6            8           10            12
                                                                    Eb/No
                        Figure 5 (b). 16 users Tree-Based Interleaver with and without Coding

Kulbhushan Gupta is engaged as Assistant Professor in B.B.S. College of Engineering, Allahabad, India
and is perusing Ph.D. form Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed University),
Allahabad, India. His area of interest is Ad-Hoc Neworks, Multiple Access Scheme and Modulation
Schemes.


C.K. Shukla is associated with Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed
University), Allahabad, India as Professor in Electronics & Communication Engineering Department. At
present he is working in the area of Ad-Hoc Networks, routing algorithms, and Mobile Computing
mechanisms. He has published several papers in national and international conferences of repute apart from
various journal publications. He is also member of various professional bodies and is active in research
areas. He may be contacted at http://shiats.edu.in/faculty/Colleges/dept/staff/facProfile.asp?txtOpt=1519 .



M. Shukla is associate professor of Electronics Engineering Department in Harcourt Butler Technological
Institute, Kanpur, India. As an engineer-scientist-turned-faculty, Dr. Shukla’s research agenda has been
extensive, ranging from information systems development to case-driven strategic technological issues. His
current research interests include network security, neural network and fuzzy applications in electronics
engineering, design and analysis of interleavers for multiple access schemes in wireless and mobile networks,
channel coding, QOS issues, VHDL coding of communication models, and next generation networks. He has
more than eighteen years of teaching and research experience in the area of circuit design and
Communication Engineering. He has supervised a number of M. Tech. theses. He has worked as reviewer for
several conferences and journals of repute. He has published more than fifteen research papers in different
journals and conferences. Dr. Shukla’s papers have appeared in journals such as Wiley Transactions on
Wireless Communication and Mobile Computing, International Journal of Applied Engineering Research, The

23 | P a g e
www.iiste.org
Journal of Information Engineering and Applications                                    www.iiste.org
ISSN 2224-5758 (print) ISSN 2224-896X (online)
Vol 1, No.3, 2011


IUP Journal of Telecommunications, and Springer Lecture Notes on Computer Science, among others. He is a
member of the Institute of Electrical and Electronics Engineers (IEEE), Institution of Electronic and
Telecommunication Engineers (IETE), International Society of Electronics & Electrical Engineers (ISEEE),
and the Indian Society for Technical Education (ISTE). He may be ‘virtually’ reached at
http://www.hbti.ac.in/Dept/ET/manoj.htm and http://www.manojkrshukla.weebly.com.




24 | P a g e
www.iiste.org
International Journals Call for Paper
The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals
usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should
send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org

Business, Economics, Finance and Management               PAPER SUBMISSION EMAIL
European Journal of Business and Management               EJBM@iiste.org
Research Journal of Finance and Accounting                RJFA@iiste.org
Journal of Economics and Sustainable Development          JESD@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Developing Country Studies                                DCS@iiste.org
Industrial Engineering Letters                            IEL@iiste.org


Physical Sciences, Mathematics and Chemistry              PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Chemistry and Materials Research                          CMR@iiste.org
Mathematical Theory and Modeling                          MTM@iiste.org
Advances in Physics Theories and Applications             APTA@iiste.org
Chemical and Process Engineering Research                 CPER@iiste.org


Engineering, Technology and Systems                       PAPER SUBMISSION EMAIL
Computer Engineering and Intelligent Systems              CEIS@iiste.org
Innovative Systems Design and Engineering                 ISDE@iiste.org
Journal of Energy Technologies and Policy                 JETP@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Control Theory and Informatics                            CTI@iiste.org
Journal of Information Engineering and Applications       JIEA@iiste.org
Industrial Engineering Letters                            IEL@iiste.org
Network and Complex Systems                               NCS@iiste.org


Environment, Civil, Materials Sciences                    PAPER SUBMISSION EMAIL
Journal of Environment and Earth Science                  JEES@iiste.org
Civil and Environmental Research                          CER@iiste.org
Journal of Natural Sciences Research                      JNSR@iiste.org
Civil and Environmental Research                          CER@iiste.org


Life Science, Food and Medical Sciences                   PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Journal of Biology, Agriculture and Healthcare            JBAH@iiste.org
Food Science and Quality Management                       FSQM@iiste.org
Chemistry and Materials Research                          CMR@iiste.org


Education, and other Social Sciences                      PAPER SUBMISSION EMAIL
Journal of Education and Practice                         JEP@iiste.org
Journal of Law, Policy and Globalization                  JLPG@iiste.org                       Global knowledge sharing:
New Media and Mass Communication                          NMMC@iiste.org                       EBSCO, Index Copernicus, Ulrich's
Journal of Energy Technologies and Policy                 JETP@iiste.org                       Periodicals Directory, JournalTOCS, PKP
Historical Research Letter                                HRL@iiste.org                        Open Archives Harvester, Bielefeld
                                                                                               Academic Search Engine, Elektronische
Public Policy and Administration Research                 PPAR@iiste.org                       Zeitschriftenbibliothek EZB, Open J-Gate,
International Affairs and Global Strategy                 IAGS@iiste.org                       OCLC WorldCat, Universe Digtial Library ,
Research on Humanities and Social Sciences                RHSS@iiste.org                       NewJour, Google Scholar.

Developing Country Studies                                DCS@iiste.org                        IISTE is member of CrossRef. All journals
Arts and Design Studies                                   ADS@iiste.org                        have high IC Impact Factor Values (ICV).

Weitere ähnliche Inhalte

Was ist angesagt?

INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...ijsc
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
 
Chaotic Variations Of Aes Algorithm
Chaotic Variations Of Aes AlgorithmChaotic Variations Of Aes Algorithm
Chaotic Variations Of Aes Algorithmijccmsjournal
 
CHAOTIC VARIATIONS OF AES ALGORITHM
CHAOTIC VARIATIONS OF AES ALGORITHMCHAOTIC VARIATIONS OF AES ALGORITHM
CHAOTIC VARIATIONS OF AES ALGORITHMijccmsjournal
 
Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...
Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...
Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...CSCJournals
 
Improving Performance of Back propagation Learning Algorithm
Improving Performance of Back propagation Learning AlgorithmImproving Performance of Back propagation Learning Algorithm
Improving Performance of Back propagation Learning Algorithmijsrd.com
 
Background Estimation Using Principal Component Analysis Based on Limited Mem...
Background Estimation Using Principal Component Analysis Based on Limited Mem...Background Estimation Using Principal Component Analysis Based on Limited Mem...
Background Estimation Using Principal Component Analysis Based on Limited Mem...IJECEIAES
 
Performance analysis of transformation and bogdonov chaotic substitution base...
Performance analysis of transformation and bogdonov chaotic substitution base...Performance analysis of transformation and bogdonov chaotic substitution base...
Performance analysis of transformation and bogdonov chaotic substitution base...IJECEIAES
 
Performance Analysis of Various Activation Functions in Generalized MLP Archi...
Performance Analysis of Various Activation Functions in Generalized MLP Archi...Performance Analysis of Various Activation Functions in Generalized MLP Archi...
Performance Analysis of Various Activation Functions in Generalized MLP Archi...Waqas Tariq
 
Efficient Implementation of Low Power 2-D DCT Architecture
Efficient Implementation of Low Power 2-D DCT ArchitectureEfficient Implementation of Low Power 2-D DCT Architecture
Efficient Implementation of Low Power 2-D DCT ArchitectureIJMER
 
Fast dct algorithm using winograd’s method
Fast dct algorithm using winograd’s methodFast dct algorithm using winograd’s method
Fast dct algorithm using winograd’s methodIAEME Publication
 

Was ist angesagt? (14)

INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
 
call for papers, research paper publishing, where to publish research paper, ...
call for papers, research paper publishing, where to publish research paper, ...call for papers, research paper publishing, where to publish research paper, ...
call for papers, research paper publishing, where to publish research paper, ...
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
Chaotic Variations Of Aes Algorithm
Chaotic Variations Of Aes AlgorithmChaotic Variations Of Aes Algorithm
Chaotic Variations Of Aes Algorithm
 
CHAOTIC VARIATIONS OF AES ALGORITHM
CHAOTIC VARIATIONS OF AES ALGORITHMCHAOTIC VARIATIONS OF AES ALGORITHM
CHAOTIC VARIATIONS OF AES ALGORITHM
 
Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...
Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...
Content Based Video Retrieval in Transformed Domain using Fractional Coeffici...
 
Improving Performance of Back propagation Learning Algorithm
Improving Performance of Back propagation Learning AlgorithmImproving Performance of Back propagation Learning Algorithm
Improving Performance of Back propagation Learning Algorithm
 
.doc
.doc.doc
.doc
 
Background Estimation Using Principal Component Analysis Based on Limited Mem...
Background Estimation Using Principal Component Analysis Based on Limited Mem...Background Estimation Using Principal Component Analysis Based on Limited Mem...
Background Estimation Using Principal Component Analysis Based on Limited Mem...
 
Performance analysis of transformation and bogdonov chaotic substitution base...
Performance analysis of transformation and bogdonov chaotic substitution base...Performance analysis of transformation and bogdonov chaotic substitution base...
Performance analysis of transformation and bogdonov chaotic substitution base...
 
Performance Analysis of Various Activation Functions in Generalized MLP Archi...
Performance Analysis of Various Activation Functions in Generalized MLP Archi...Performance Analysis of Various Activation Functions in Generalized MLP Archi...
Performance Analysis of Various Activation Functions in Generalized MLP Archi...
 
Efficient Implementation of Low Power 2-D DCT Architecture
Efficient Implementation of Low Power 2-D DCT ArchitectureEfficient Implementation of Low Power 2-D DCT Architecture
Efficient Implementation of Low Power 2-D DCT Architecture
 
Fn2611681170
Fn2611681170Fn2611681170
Fn2611681170
 
Fast dct algorithm using winograd’s method
Fast dct algorithm using winograd’s methodFast dct algorithm using winograd’s method
Fast dct algorithm using winograd’s method
 

Andere mochten auch

Research Google
Research GoogleResearch Google
Research Googleannwill
 
Tup2 人人网张铁安
Tup2 人人网张铁安Tup2 人人网张铁安
Tup2 人人网张铁安yongboy
 
Consuelo -power_point[1]
Consuelo  -power_point[1]Consuelo  -power_point[1]
Consuelo -power_point[1]Consuelo518
 
Library intro-fac-staff
Library intro-fac-staffLibrary intro-fac-staff
Library intro-fac-staffelaine_day
 
Mesyaurt guru sksi (1)
Mesyaurt guru sksi (1)Mesyaurt guru sksi (1)
Mesyaurt guru sksi (1)ZaCk Abu Bakar
 
Beauty of mathematics
Beauty of mathematicsBeauty of mathematics
Beauty of mathematicsgkretsi
 
Cercle innovation IBM 2013 - Ile Bendor
Cercle innovation IBM 2013 -  Ile Bendor Cercle innovation IBM 2013 -  Ile Bendor
Cercle innovation IBM 2013 - Ile Bendor Claude Riousset
 
Instalación OpenSolaris 2008.05
Instalación OpenSolaris 2008.05Instalación OpenSolaris 2008.05
Instalación OpenSolaris 2008.05Manuel Hernandez
 
Viscom power pt on pics
Viscom power pt on picsViscom power pt on pics
Viscom power pt on picsswolf69420
 
Galileo Powerpoint
Galileo PowerpointGalileo Powerpoint
Galileo Powerpointaudreymcn
 
Real-Time Web实时信息流推送
Real-Time Web实时信息流推送Real-Time Web实时信息流推送
Real-Time Web实时信息流推送yongboy
 

Andere mochten auch (20)

Research Google
Research GoogleResearch Google
Research Google
 
Microsoft windows
Microsoft windowsMicrosoft windows
Microsoft windows
 
Bs 7sada
Bs 7sadaBs 7sada
Bs 7sada
 
Tup2 人人网张铁安
Tup2 人人网张铁安Tup2 人人网张铁安
Tup2 人人网张铁安
 
Redes sociais
Redes sociaisRedes sociais
Redes sociais
 
Consuelo -power_point[1]
Consuelo  -power_point[1]Consuelo  -power_point[1]
Consuelo -power_point[1]
 
Question 1
Question 1Question 1
Question 1
 
Goodbye
GoodbyeGoodbye
Goodbye
 
Library intro-fac-staff
Library intro-fac-staffLibrary intro-fac-staff
Library intro-fac-staff
 
Mesyaurt guru sksi (1)
Mesyaurt guru sksi (1)Mesyaurt guru sksi (1)
Mesyaurt guru sksi (1)
 
Valdes private sectorinitiatives
Valdes private sectorinitiativesValdes private sectorinitiatives
Valdes private sectorinitiatives
 
Śniadanie Daje Moc
Śniadanie Daje MocŚniadanie Daje Moc
Śniadanie Daje Moc
 
9月7日報告会
9月7日報告会9月7日報告会
9月7日報告会
 
Beauty of mathematics
Beauty of mathematicsBeauty of mathematics
Beauty of mathematics
 
Cercle innovation IBM 2013 - Ile Bendor
Cercle innovation IBM 2013 -  Ile Bendor Cercle innovation IBM 2013 -  Ile Bendor
Cercle innovation IBM 2013 - Ile Bendor
 
Instalación OpenSolaris 2008.05
Instalación OpenSolaris 2008.05Instalación OpenSolaris 2008.05
Instalación OpenSolaris 2008.05
 
Viscom power pt on pics
Viscom power pt on picsViscom power pt on pics
Viscom power pt on pics
 
Presentation math 105
Presentation math 105Presentation math 105
Presentation math 105
 
Galileo Powerpoint
Galileo PowerpointGalileo Powerpoint
Galileo Powerpoint
 
Real-Time Web实时信息流推送
Real-Time Web实时信息流推送Real-Time Web实时信息流推送
Real-Time Web实时信息流推送
 

Ähnlich wie 11.iterative idma receivers with random and tree based interleavers

COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSORCOUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSORIJNSA Journal
 
Application of diversity techniques for multi user idma communication system
Application of diversity techniques for multi user idma communication systemApplication of diversity techniques for multi user idma communication system
Application of diversity techniques for multi user idma communication systemAlexander Decker
 
Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...
Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...
Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...ijsc
 
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...ijsc
 
FPGA Based Design of High Performance Decimator using DALUT Algorithm
FPGA Based Design of High Performance Decimator using DALUT AlgorithmFPGA Based Design of High Performance Decimator using DALUT Algorithm
FPGA Based Design of High Performance Decimator using DALUT AlgorithmIDES Editor
 
ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...
ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...
ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...CSCJournals
 
SC-FDM-IDMA Scheme Employing BCH Coding
SC-FDM-IDMA Scheme Employing BCH Coding SC-FDM-IDMA Scheme Employing BCH Coding
SC-FDM-IDMA Scheme Employing BCH Coding IJECEIAES
 
Implementation and validation of multiplier less fpga based digital filter
Implementation and validation of multiplier less fpga based digital filterImplementation and validation of multiplier less fpga based digital filter
Implementation and validation of multiplier less fpga based digital filterIAEME Publication
 
Ecc cipher processor based on knapsack algorithm
Ecc cipher processor based on knapsack algorithmEcc cipher processor based on knapsack algorithm
Ecc cipher processor based on knapsack algorithmAlexander Decker
 
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...IJCNC
 
Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...
Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...
Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...IRJET Journal
 
Performance evaluation of circular microstrip
Performance evaluation of circular microstripPerformance evaluation of circular microstrip
Performance evaluation of circular microstripIAEME Publication
 
Performance evaluation of circular microstrip
Performance evaluation of circular microstripPerformance evaluation of circular microstrip
Performance evaluation of circular microstripIAEME Publication
 
Outage performance analysis of non-orthogonal multiple access systems with RF...
Outage performance analysis of non-orthogonal multiple access systems with RF...Outage performance analysis of non-orthogonal multiple access systems with RF...
Outage performance analysis of non-orthogonal multiple access systems with RF...IJECEIAES
 
Modelling Quantum Transport in Nanostructures
Modelling Quantum Transport in NanostructuresModelling Quantum Transport in Nanostructures
Modelling Quantum Transport in Nanostructuresiosrjce
 
Convolutional networks and graph networks through kernels
Convolutional networks and graph networks through kernelsConvolutional networks and graph networks through kernels
Convolutional networks and graph networks through kernelstuxette
 
Implementation performance analysis of cordic
Implementation performance analysis of cordicImplementation performance analysis of cordic
Implementation performance analysis of cordiciaemedu
 
Real Time Results of a Fuzzy Neural Network Active Noise Controller
Real Time Results of a Fuzzy Neural Network Active Noise ControllerReal Time Results of a Fuzzy Neural Network Active Noise Controller
Real Time Results of a Fuzzy Neural Network Active Noise ControllerIRJET Journal
 

Ähnlich wie 11.iterative idma receivers with random and tree based interleavers (20)

COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSORCOUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
COUPLED FPGA/ASIC IMPLEMENTATION OF ELLIPTIC CURVE CRYPTO-PROCESSOR
 
Application of diversity techniques for multi user idma communication system
Application of diversity techniques for multi user idma communication systemApplication of diversity techniques for multi user idma communication system
Application of diversity techniques for multi user idma communication system
 
Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...
Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...
Inversion of Magnetic Anomalies Due to 2-D Cylindrical Structures – By an Art...
 
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
INVERSIONOF MAGNETIC ANOMALIES DUE TO 2-D CYLINDRICAL STRUCTURES –BY AN ARTIF...
 
FPGA Based Design of High Performance Decimator using DALUT Algorithm
FPGA Based Design of High Performance Decimator using DALUT AlgorithmFPGA Based Design of High Performance Decimator using DALUT Algorithm
FPGA Based Design of High Performance Decimator using DALUT Algorithm
 
ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...
ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...
ECG Signal Compression Technique Based on Discrete Wavelet Transform and QRS-...
 
SC-FDM-IDMA Scheme Employing BCH Coding
SC-FDM-IDMA Scheme Employing BCH Coding SC-FDM-IDMA Scheme Employing BCH Coding
SC-FDM-IDMA Scheme Employing BCH Coding
 
Implementation and validation of multiplier less fpga based digital filter
Implementation and validation of multiplier less fpga based digital filterImplementation and validation of multiplier less fpga based digital filter
Implementation and validation of multiplier less fpga based digital filter
 
Ecc cipher processor based on knapsack algorithm
Ecc cipher processor based on knapsack algorithmEcc cipher processor based on knapsack algorithm
Ecc cipher processor based on knapsack algorithm
 
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
FURTHER RESULTS ON THE DIRAC DELTA APPROXIMATION AND THE MOMENT GENERATING FU...
 
Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...
Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...
Qualitative Analysis of Optical Interleave Division Multiple Access using Spe...
 
Performance evaluation of circular microstrip
Performance evaluation of circular microstripPerformance evaluation of circular microstrip
Performance evaluation of circular microstrip
 
Performance evaluation of circular microstrip
Performance evaluation of circular microstripPerformance evaluation of circular microstrip
Performance evaluation of circular microstrip
 
Outage performance analysis of non-orthogonal multiple access systems with RF...
Outage performance analysis of non-orthogonal multiple access systems with RF...Outage performance analysis of non-orthogonal multiple access systems with RF...
Outage performance analysis of non-orthogonal multiple access systems with RF...
 
E010632226
E010632226E010632226
E010632226
 
Modelling Quantum Transport in Nanostructures
Modelling Quantum Transport in NanostructuresModelling Quantum Transport in Nanostructures
Modelling Quantum Transport in Nanostructures
 
Convolutional networks and graph networks through kernels
Convolutional networks and graph networks through kernelsConvolutional networks and graph networks through kernels
Convolutional networks and graph networks through kernels
 
Implementation performance analysis of cordic
Implementation performance analysis of cordicImplementation performance analysis of cordic
Implementation performance analysis of cordic
 
Real Time Results of a Fuzzy Neural Network Active Noise Controller
Real Time Results of a Fuzzy Neural Network Active Noise ControllerReal Time Results of a Fuzzy Neural Network Active Noise Controller
Real Time Results of a Fuzzy Neural Network Active Noise Controller
 
1568973267 effect of multi-tone
1568973267 effect of multi-tone1568973267 effect of multi-tone
1568973267 effect of multi-tone
 

Mehr von Alexander Decker

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inAlexander Decker
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksAlexander Decker
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dAlexander Decker
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceAlexander Decker
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifhamAlexander Decker
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaAlexander Decker
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenAlexander Decker
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget forAlexander Decker
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabAlexander Decker
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalAlexander Decker
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesAlexander Decker
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloudAlexander Decker
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveragedAlexander Decker
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenyaAlexander Decker
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health ofAlexander Decker
 

Mehr von Alexander Decker (20)

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale in
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websites
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banks
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized d
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistance
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifham
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibia
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school children
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banks
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget for
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjab
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incremental
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniques
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo db
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloud
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveraged
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenya
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health of
 

Kürzlich hochgeladen

Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Will Schroeder
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Commit University
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URLRuncy Oommen
 
GenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation IncGenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation IncObject Automation
 
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostKubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostMatt Ray
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7DianaGray10
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataCloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataSafe Software
 
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdfJamie (Taka) Wang
 
Things you didn't know you can use in your Salesforce
Things you didn't know you can use in your SalesforceThings you didn't know you can use in your Salesforce
Things you didn't know you can use in your SalesforceMartin Humpolec
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesDavid Newbury
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfDianaGray10
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxMatsuo Lab
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioChristian Posta
 

Kürzlich hochgeladen (20)

Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URL
 
GenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation IncGenAI and AI GCC State of AI_Object Automation Inc
GenAI and AI GCC State of AI_Object Automation Inc
 
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostKubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataCloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
 
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
 
Things you didn't know you can use in your Salesforce
Things you didn't know you can use in your SalesforceThings you didn't know you can use in your Salesforce
Things you didn't know you can use in your Salesforce
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond Ontologies
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptx
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and Istio
 

11.iterative idma receivers with random and tree based interleavers

  • 1. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 Iterative IDMA Receivers with Random and Tree Based Interleavers Kulbhushan Gupta 1 C.K. Shukla2 M. Shukla3* 3. Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed University), Allahabad, India 4. Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed University), Allahabad, India 5. Harcourt Butler Technological Institute, Kanpur, India * E-mail of the corresponding author: manojkrshukla@gmail.com Abstract In recent days, on the horizon of wireless world, newly proposed multiple access scheme known as Interleave-Division Multiple-Access (IDMA) has made its remarkable impact. Researchers all over world, are making hard marks to establish the scheme to establish its claim as potential candidate for 4th generation wireless communication systems. This paper is concerned with the performance enhancement of iterative IDMA systems under coded & uncoded environment. The performance of an interleave division multiple access (IDMA) system can be improved by the optimized power allocation techniques. Based on the optimized power allocation technique we compare the performance of coded & uncoded IDMA system with random interleaver & tree based interleaver. During the simulation, it has been observed that tree based interleaver demonstrate the similar bit error rate (BER) performance to that of random interleaver however on other fronts including bandwidth and memory requirement at transmitter and receiver ends, it outperforms the random interleavers. Keywords: Tree Based Interleaver, Random Interleaver, IDMA, linear programming, power allocation, BER. 1. Introduction The well established Direct-Sequence code-division multiple-access (DS-CDMA) which is also known as simply CDMA has been adopted in second and third generation cellular mobile standards. The CDMA scheme possesses many attractive features such as dynamic channel sharing, mitigation of cross-cell interference, asynchronous transmission, ease of cell planning, and robustness against fading. In CDMA system, many users share the same transmission media so that signals from different users are superimposed, causing the multiple access interference (MAI) problems. At the receiver side, it is necessary to separate the mixed signals. Multi-user detection (MUD) is a technique to improve performance by jointly processing the signals forms all of the users. Recently, it has been shown that multiuser detection together with unequal power control can enhance the performance of code division multiple access (CDMA) systems. The complexity and computational cost is the major problem of CDMA systems. Interleave Division Multiple Access (IDMA) scheme in which interleavers are employed as the only means of user separation. Interleave division multiple access (IDMA) is a special case of random waveform CDMA, and the accompanying chip-by-chip (CBC) estimation algorithm is essentially a low cost iterative soft cancellation technique [Ping L. & Lihai L. (2004)]. The chip-by-chip (CBC) MUD algorithm for IDMA is an iterative soft cancellation technique for treating multiple access interference (MAI). Its computational cost is very low, being independent of the total number of users when normalized to each user [Wang P., Ping L. & Liu L. (2006)]. With equal power control, it has been shown in [Liu L., Tong J. & Ping L. (2006)] that IDMA together with CBC algorithm can achieve performance close to the theoretical limits. Unequal power allocation is a technique to further enhance system performance. In [3], a linear programming technique is employed for 13 | P a g e www.iiste.org
  • 2. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 power optimization of IDMA systems over additive white Gaussian noise (AWGN) multiple access channels (MACs). In this paper, we use the unequal optimized power allocation technique to the uncoded-IDMA system with random interleavers & tree based interleavers. After that we compare their performance and reach to the conclusion. Section 2 contains an introduction of the IDMA communication system. In section 3, we discussed about tree based interleaver. In section 4 we discussed the power allocation techniques in brief. Section 5 presents the simulation results of uncoded-IDMA with random interleaver and tree based interleaver. Section 6 concludes the paper. 2. Iterative IDMA System 2.1. System Model Consider an IDMA system with k users. At the transmitter side, the information bits for user k are first encoded by an encoder (ENC) based on a FEC code and then interleaved and transmitted over a Gaussian multiple access channel (MAC). The received signal can be written as; K r ( j ) = ∑ hk xk ( j ) + n ( j ) , j = 1,2,...J (1) k =1 Where xk ( j ) ∈ {+1, −1} is the jth chip transmitted by user-k, hk the coefficient for user-k representing { } the combined effect of power control and channel loss, and n ( j ) are samples of an AWGN process with zero-mean and variance σ = N 0 / 2 [4]. 2 The receiver consists of an elementary signal estimator (ESE) and k a posteriori probability (APP) decoders (DECs), operating iteratively. For each user k, we rewrite (1) as; r ( j ) = hk xk ( j ) + ξ k ( j ) (2) where, ξ k ( j ) = ∑ hk ′ xk ′ ( j ) + n ( j ) (3) k ′≠ k 2.2 The CBC Algorithm ( E ( xk ( j ) ) = tanh eDEC ( xk ( j ) ) 2 , ∀k , j ) (4) ( Var ( xk ( j ) ) = 1 − E ( xk ( j ) ) , ∀k , j ) 2 (5) E (ξ k ( j ) ) = ∑ hk ′ xk ′ ( j ) , ∀k , j (6) Var (ξ k ( j ) ) = ∑ hkk′ ′≠Var ( xk ′ ( j ) ) + σ 2 , ∀k , j 2k (7) ( eESE = {2hk / Var (ξk ( j ) )} r( j) − E (ξkk′≠ kj ) ) , ∀k, j ( ) (8) After (8), the APP decoding in the DECs is performed to generate the LLRs { } eDEC ( xk ( j ) ) , ∀k , j .Then go back to (4) for the next iteration. 3. Tree Based Interleaving Mechanism In iterative IDMA system each user has a specific interleaver {π k } having length equal to chip length ‘J’. A considerable amount of memory will be required to store the indexes for these interleavers. The tree based interleaver is basically aimed to minimize the computational complexity and memory requirement 14 | P a g e www.iiste.org
  • 3. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 that occurs in power interleaver & random interleavers respectively [Shukla M., Srivastava V.K. & Tiwari S. (2009)]. In a tree based interleaver generation, two randomly generated interleaver are chosen. Let π 1 and π 2 be the two random interleavers. The combinations of these two interleavers in a particular fashion as shown in the figure 2 are used as interleaving masks for the users [Shukla M., Srivastava V.K. & Tiwari S. (2009)]. The allocations of the interleaving masks follow the binary tree format. The interleaving masking diagram is shown upon 14 users for simplicity. It is clearly shown through the figure that, for obtaining the interleaving sequence of the 14th user, it need only 2 cycles, as in [Shukla M., Srivastava V.K. & Tiwari S. (2009)]. π 14 = π 2 (π 2 (π 2 ) ) 4. Power Allocation Strategy for Users This section is concerned with the power optimization technique for IDMA systems over AWGN channels. 4.1 Problem Formulation: { } ( ) For simplicity, we assume that, for all users, the same FEC code is used and the same BER performance is (l ) (l ) required. Let γ k be the average SNIR for the outputs of the ESE after the l-th iteration & f k γ k (l ) be the average variance of the outputs of DECk driven by an input sequence with SNIR γ k [Shukla M., Srivastava V.K. & Tiwari S. (2006), Shukla M., Srivastava V.K. & Tiwari S. (2009)]. (l ) We can approximately track γ k using the following recursion; 2 ( l +1) Pk hk γk = , ∀k , l = 0,1,....( L − 1) ( ) (10) ∑P h fi γ i ( ) + σ 2 2 l i i i≠k where L is the maximum number of iterations. For AWGN channels, we have, hk = 1, ∀κ 2 Then recursion (10) reduces to, Pk γ k (l +1) = , ∀k , l = 0,1,....( L − 1) ( ) (11) ∑ Pi fi γ i(l ) + σ 2 i≠k Our objective now is to minimize total power ∑ Pk while achieving the required (l ) performance γ k ≥ Γ, ∀k , for specified Γ [2]. This power optimization problem can be formulated as k follows. 4.2 Power optimization over AWGN channels: Find the distribution { Pk } that minimizes, Φ = ∑ Pk (12) subject to, k γ k (l ) ≥ Γ, ∀k { } (13) (l ) (0) where γ k are obtained through the following SNIR evolution process with initialization γ k =0, for all k. Pk γ k (l +1) = , ∀k , l = 0,1,....( L − 1) ( ) (14) ∑ Pi fi γ i( ) + σ 2 i≠k l 15 | P a g e www.iiste.org
  • 4. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 Problem (14) is generally nonlinear and non-convex. The problem considered above is to find the minimum sum-power solution within the feasible region [Shukla M., Srivastava V.K. & Tiwari S. (2009)]. We define the total interference after the l-th iteration of recursion (11) as, I ( ) = ∑ Pk f k γ k ( ) + σ 2 l k =1 ( ) l (15) Then (11) can be rewritten as Pk γ k (l +1) = , ∀k , l = 0,1,....( L − 1) ( ) (16) (l ) − Pk f k γ k ( ) l I B. Linear Programming Approach: In problem (12), the constraints (13) & (14) are nonlinear with respect to the optimization variables { Pk } , which makes the problem complicated. We therefore consider a linearization technique to solve this problem. We quantize the power levels { Pk } into (M+1) discrete levels : { P(m), m=0,1,……M} with P(m-1) < P(m), m=1,2,…….M, and partition the k users into (M+1) groups according to their power levels. Letting λ (m) denote the number of users assigned with power level P(m) [Shukla M., Srivastava V.K. & Tiwari S. (2009)]. Then total power (12) is rewritten as φ = ∑ λ (m)P(m) (17) m and the number of users k can be represented as, k = ∑ λ ( m) (18) m γ ( l ) ( m) be the SNIR of the ESE outputs for the users in the group with power P(m) after the l-th iteration and assume that user-k has power P(m). Then (15) & (16) can be rewritten as, I ( ) = ∑ λ ( m) P ( m) f γ l m ( (l ) (m) +σ 2 ) (19) ( l +1) P (m) γ (m) = , ∀k , l = 0,1,....( L − 1) (20) I (l ) − P ( m) f γ ( (l ) ( m) ) Since {I ( ) } is a monotonically decreasing sequence, i.e., l I( l +1) ≤ I ( ) , l=0, 1,….. (L-1) l (21) Substituting (21) into (20) and introducing a delay factor δ ( 0 < δ < 1) to control the convergence speed of the iterative detection, we get, ∑ λ (m)P(m) f (γ ( ) (m) ) + σ m l 2 ≤ (1 − δ ) I ( ) l (22) l=0, 1,………… (L-1) Now we take {λ ( m)} as optimization variables. In this case both the target function (17) and the constraints (18) & (22) appear linear with respect to {λ ( m)} . However γ ( l +1) (m) in (20) is dependent on {λ ( m)} . Now, γ ( l +1) (m) can be treated as pre-calculated parameter when linear programming is applied. Using an approximation, 16 | P a g e www.iiste.org
  • 5. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 ( l +1) P ( m) γ ( m ) ≈ γ ∗ ( m) = (23) I (l ) * denotes approximation. We can rewrite (22) as  P ( m)  ∑ λ (m)P(m) f m   I   + σ ≤ (1 − δ ) I , I min ≤ I ≤ I max 2 (24) where I max & I min specify the total interference at the beginning and end of the iterative detection and the (l ) iteration index l for I is omitted. We evaluate (24) at a set of quantized values of I:{I(n),n=0,1,..N}. By { } { } pre-calculating f m , n = f ( P ( m) I ( n ) ) and using f m ,n as constants, we obtain a group of linear constraints with respect to {λ ( m)} [2]. In summary, we have φ = ∑ λ (m)P(m) (25) m subject to ∑ λ ( m) = k (26) λ (m) ≥ 0, m = 0,1,....M m (27)  P ( m)  ∑ λ (m)P(m) f m   I   + σ ≤ (1 − δ ) I , I min ≤ I ≤ I max 2 (28) Let y (m) denotes the total power of these λ (m) users. As such, y(m)= λ (m) P(m) (29) Substituting (29) into (25),(27) & (28) we get φ = ∑ y ( m) (30) subject to, m  P ( m)  ∑ y ( m) f m   I   + σ ≤ (1 − δ ) I , I min ≤ I ≤ I max 2 (31) y (m) ≥ 0, m = 0,1,....M . (32) In practice in [1], both P and I should be quantized. We need to determine the searching ranges Pmin , Pmax , I min & I max . Let us quantize P and I as P(m) = α m Pmin , m = 0,1,....M (33) I (n) = β n I min , n = 0,1,....N (34) with P(0)= Pmin >0, P(M)= Pmax ,I(0)= I min >0, I(N)= I max , α >1 and β >1. Then (31) becomes, ∑ y ( m ) f (α m m β − nγ ) + σ 2 ≤ (1 − δ ) β n I min (35) Since γ = Pmin I min (36) The minimum SNR is obtained at the end of the iterative decoding process. Here γ can be determined by the desired BER. For more details about the relation between γ and BER see in [1]. Since y ( m) y (m)α − m k = ∑ λ (m) = ∑ =∑ (37) m m P(m) m γ I min We get, ∑ y(m)α m −m − kγ I min = 0 (38) We can replace (31) by (35). We can also include (38) as part of the LP constraints. In this way I min becomes an optimization variable and Pmin can be determined from I min by (36) [1]. 17 | P a g e www.iiste.org
  • 6. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 We still need to determine M and N in (33) & (34). In general, we just use a sufficient large M, since the LP will automatically determine the maximum power level used. We start with a relatively small N. If after the LP, I max = ∑ y (m) ×1 +σ 2 > I ( N ) (39) m then the quantization range in (34) is not sufficient and we increase N and repeat the LP until I max ≤ I ( N ) . 5. Simulation Results The power profiles for 32, 48, 64 users are given below in the Table 1. As we see that the performance improves with increased data lengths. We can also see that a data length of 512 is sufficient to achieve relatively good performance. Performance enhancement is marginal with information block longer than 512. −4 If user count is k ≤ 32, then fewer than 20 iterations are sufficient (measured at 10 ) and more iterations do not bring about significant performance improvement. However, when user count is K ≥ 48, more iteration can be beneficial [Shukla M., Srivastava V.K. & Tiwari S. (2008), Shukla M., Srivastava V.K. & Tiwari S. (2006)]. 6. Conclusion As we see from the simulation results that in unequal power allocation technique with Tree based interleaver based uncoded and coded IDMA system gives the better results in comparison to random interleaver based IDMA system. So using Tree based interleaver in IDMA system with unequal optimized power allocation technique will enhance the performance in comparison to random interleaver and also reduce the memory cost & computational complexity. References Ping L. & Lihai L. (2004), “Analysis and Design of IDMA Systems Based on SNR Evolution and Power Allocation”, Proceedings of Vehicular Technology Conference VTC 2004-Fall, IEEE, 1068-1072. Wang P., Ping L. & Liu L. (2006), “Power Allocation for Multiple Access Systems with Practical Coding and Iterative Multi-User Detection”, Proceedings of International Conference ICC`06, 11, IEEE, 4971- 4976. Liu L., Tong J. & Ping L. (2006), “Analysis and Optimization of CDMA Systems with Chip-Level Interleavers”, Journal Selected Areas in Communication, 24, IEEE, 141-150. Ping L., Wu Y. & Leung W. (2006),”Interleave-Division Multiple-Access”, Transaction on Wireless Communication, 5 (4), IEEE. 938-947. Shukla M., Srivastava V.K. & Tiwari S. (2009), “Analysis and Design of Optimum Interleaver for Iterative Receivers in IDMA Scheme”, Journal of Wireless Communication and Mobile Computing, 9(10), Wiley 1312-1317. Shukla M., Srivastava V.K. & Tiwari S. (2006), “Interleave Division Multiple Access for Wireless Communication”, Proceedings of International Conference on Next Generation Communication Systems: A Perspective’, “ICONGENCOM 06”, J.K. Institute, Allahabad, India, 150-154. Shukla M., Srivastava V.K. & Tiwari S. (2008), “Analysis and Design of Tree Based Interleaver for Multiuser Receivers in IDMA Scheme”, Proceedings of International Conference on Networks “ICON 2008”, Delhi, India, IEEE, 1-4. 18 | P a g e www.iiste.org
  • 7. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 Shukla M., Shukla A., Srivastava V.K., & Tiwari S. (2009), “Different Designing Factors for IDMA Systems”, Proceedings of International Conference on Computer, Communication, and Control and Information Technology “C3 IT 2009”, Calcutta, India, Academy Publishers, 748-756. Shukla M., Srivastava V.K. & Tiwari S. (2006), “A Novel Interleaver for Interleave Division Multiple Access Scheme”, Proceedings of International Conference on Information and Communication Techniques “ICCT 07”, Dehradun, India, 843-846. Shukla M., Srivastava V.K. & Tiwari S. (2009), “Analysis of Optimum Interleaver for Iterative Receivers in IDMA Scheme”, Proceedings of International Conference on Computing and Networking “ICDCN 2009”, Springer, 400-407. Shukla M., Srivastava V.K. & Tiwari S. (2009), “Performance Analysis of Tree Based Interleaver with IDMA Systems using Optimum Power Allocation Algorithm”, Proceedings of International Conference on Emerging Trends in Engineering & Technology “ICETET-09”, IEEE, 1173-1177. Table 1 Power Profile For 32, 48 & 64 Users (power level(dB)) × (user number) K=32 0 × 25, 5.3811 × 7 K=48 0 × 26, 7.4509 × 8, 10.3484 × 8, 10.7623 × 6 K=64 0 × 25, 7.8645 × 7, 8.2784 × 7, 13.2455 × 5 13.6594 × 7, 18.6266 × 13 19 | P a g e www.iiste.org
  • 8. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 Figure 1. (a) The transmitter for user-k. (b) A part of the receiver related to user-k. П1(П1(П1)) 7 3 П1(П1) П1(П1(П2)) 11 1 П1(П2(П1)) 9 П1 5 П1(П2) П1(П2(П2)) 13 П2(П1(П1)) 8 4 П2(П1) 2 П2(П1(П2)) 12 П2 П2(П2(П1)) 10 6 П2(П2) П2(П2(П2)) 14 Figure 2. Interleaving mask allocation for the proposed Tree based interleaving scheme 0 withoutcoding random interleaver 32 users 10 -1 10 -2 10 Bit Error Rate -3 datalength=128 10 datalength=256 datalength=512 -4 datalength=1024 10 -5 10 -6 10 2 4 6 8 10 12 14 16 Eb/No Figure 3 (a). 32 users Random Interleaver 20 | P a g e www.iiste.org
  • 9. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 0 without coding tree based interleaver 32 users 10 -1 10 -2 10 Bit Error Rate -3 datalength=128 10 datalength=256 datalength=512 -4 10 datalength=1024 -5 10 -6 10 2 4 6 8 10 12 14 16 Eb/No Figure 3 (b). 32 users Tree Based Interleaver 0 without coding 64 users random interleaver 10 -1 10 -2 10 Bit Error Rate -3 datalength=128 10 datalength=256 datalength=512 -4 datalength=1024 10 -5 10 -6 10 0 5 10 15 20 25 Eb/No Figure 4 (a). 64 users Random Interleaver 21 | P a g e www.iiste.org
  • 10. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 0 without coding tree based interleaver 64 users 10 -1 10 Bit Error Rate -2 10 datalength=512 datalength=1024 datalength=256 datalength=128 -3 10 -4 10 2 4 6 8 10 12 14 16 18 20 22 Eb/No Figure 4 (b). 64 users Tree Based Interleaver Comparison of with and without coding 16 users random interleaver -1 10 datalength=512 datalength=2048 -2 10 Bit Error Rate -3 10 -4 10 -5 10 2 4 6 8 10 12 Eb/No Figure 5 (a). 16 users Random Interleaver with and without coding 22 | P a g e www.iiste.org
  • 11. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 -1 16 users with and without coding tree based interleaver 10 datalength=512 datalength=2048 -2 10 -3 Bit Error Rate 10 -4 10 -5 10 -6 10 2 4 6 8 10 12 Eb/No Figure 5 (b). 16 users Tree-Based Interleaver with and without Coding Kulbhushan Gupta is engaged as Assistant Professor in B.B.S. College of Engineering, Allahabad, India and is perusing Ph.D. form Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed University), Allahabad, India. His area of interest is Ad-Hoc Neworks, Multiple Access Scheme and Modulation Schemes. C.K. Shukla is associated with Sam Higginbottom Inst. of Agriculture Tech. & Sciences (Deemed University), Allahabad, India as Professor in Electronics & Communication Engineering Department. At present he is working in the area of Ad-Hoc Networks, routing algorithms, and Mobile Computing mechanisms. He has published several papers in national and international conferences of repute apart from various journal publications. He is also member of various professional bodies and is active in research areas. He may be contacted at http://shiats.edu.in/faculty/Colleges/dept/staff/facProfile.asp?txtOpt=1519 . M. Shukla is associate professor of Electronics Engineering Department in Harcourt Butler Technological Institute, Kanpur, India. As an engineer-scientist-turned-faculty, Dr. Shukla’s research agenda has been extensive, ranging from information systems development to case-driven strategic technological issues. His current research interests include network security, neural network and fuzzy applications in electronics engineering, design and analysis of interleavers for multiple access schemes in wireless and mobile networks, channel coding, QOS issues, VHDL coding of communication models, and next generation networks. He has more than eighteen years of teaching and research experience in the area of circuit design and Communication Engineering. He has supervised a number of M. Tech. theses. He has worked as reviewer for several conferences and journals of repute. He has published more than fifteen research papers in different journals and conferences. Dr. Shukla’s papers have appeared in journals such as Wiley Transactions on Wireless Communication and Mobile Computing, International Journal of Applied Engineering Research, The 23 | P a g e www.iiste.org
  • 12. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5758 (print) ISSN 2224-896X (online) Vol 1, No.3, 2011 IUP Journal of Telecommunications, and Springer Lecture Notes on Computer Science, among others. He is a member of the Institute of Electrical and Electronics Engineers (IEEE), Institution of Electronic and Telecommunication Engineers (IETE), International Society of Electronics & Electrical Engineers (ISEEE), and the Indian Society for Technical Education (ISTE). He may be ‘virtually’ reached at http://www.hbti.ac.in/Dept/ET/manoj.htm and http://www.manojkrshukla.weebly.com. 24 | P a g e www.iiste.org
  • 13. International Journals Call for Paper The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org Business, Economics, Finance and Management PAPER SUBMISSION EMAIL European Journal of Business and Management EJBM@iiste.org Research Journal of Finance and Accounting RJFA@iiste.org Journal of Economics and Sustainable Development JESD@iiste.org Information and Knowledge Management IKM@iiste.org Developing Country Studies DCS@iiste.org Industrial Engineering Letters IEL@iiste.org Physical Sciences, Mathematics and Chemistry PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Chemistry and Materials Research CMR@iiste.org Mathematical Theory and Modeling MTM@iiste.org Advances in Physics Theories and Applications APTA@iiste.org Chemical and Process Engineering Research CPER@iiste.org Engineering, Technology and Systems PAPER SUBMISSION EMAIL Computer Engineering and Intelligent Systems CEIS@iiste.org Innovative Systems Design and Engineering ISDE@iiste.org Journal of Energy Technologies and Policy JETP@iiste.org Information and Knowledge Management IKM@iiste.org Control Theory and Informatics CTI@iiste.org Journal of Information Engineering and Applications JIEA@iiste.org Industrial Engineering Letters IEL@iiste.org Network and Complex Systems NCS@iiste.org Environment, Civil, Materials Sciences PAPER SUBMISSION EMAIL Journal of Environment and Earth Science JEES@iiste.org Civil and Environmental Research CER@iiste.org Journal of Natural Sciences Research JNSR@iiste.org Civil and Environmental Research CER@iiste.org Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Journal of Biology, Agriculture and Healthcare JBAH@iiste.org Food Science and Quality Management FSQM@iiste.org Chemistry and Materials Research CMR@iiste.org Education, and other Social Sciences PAPER SUBMISSION EMAIL Journal of Education and Practice JEP@iiste.org Journal of Law, Policy and Globalization JLPG@iiste.org Global knowledge sharing: New Media and Mass Communication NMMC@iiste.org EBSCO, Index Copernicus, Ulrich's Journal of Energy Technologies and Policy JETP@iiste.org Periodicals Directory, JournalTOCS, PKP Historical Research Letter HRL@iiste.org Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Public Policy and Administration Research PPAR@iiste.org Zeitschriftenbibliothek EZB, Open J-Gate, International Affairs and Global Strategy IAGS@iiste.org OCLC WorldCat, Universe Digtial Library , Research on Humanities and Social Sciences RHSS@iiste.org NewJour, Google Scholar. Developing Country Studies DCS@iiste.org IISTE is member of CrossRef. All journals Arts and Design Studies ADS@iiste.org have high IC Impact Factor Values (ICV).