Available ONLINE www.visualsoftindia.com/journal.

html


VSRD-IJEECE, Vol. 1 (7), 2011, 364-373

____________________________
1
Research Scholar,
2
Assistant Professor,
12
Department of Electronics Engineering, MMM Engineering College, Gorakhpur,
Uttar Pradesh, INDIA. *Correspondence : ajit.luck@gmail.com
R
RR E
EE S
SS E
EE A
AA R
RR C
CC H
HH A
AA R
RR T
TT I
II C
CC L
LL E
EE
Design of IDMA Scheme Using LDPC Coding
1
Ajit Singh* and
2
Rajan Mishra
ABSTRACT
This paper mainly investigates the concepts of the Interleave-Division Multiple-Access (IDMA) schemes and
low density parity check (LDPC) coding scheme. In IDMA the separation of users is achieved by assigning
different interleavers to different users. After this, we run IDMA scheme with BPSK signaling using
convolutional codes and LDPC codes. Then we study the SNIR and BER concepts for IDMA scheme for single
and multipath channels and at last we calculate the SNIR and BER for IDMA using LDPC matrix and plotted it
by using MATLAB simulation.
Keywords : IDMA, LDPC, SNR, BER, CDMA.
1. INTRODUCTION
Our ultimate goal is to communicate any information with anyone, at anytime, from anywhere. This is only
possible through the aid of wireless technology. For the decade, mobile communications have enhanced our
communications networks by providing an important capability, i.e. mobility. There have been many
contributions to the problem of providing multiple access to assume to a same channel. However, the most
common forms of multiple access, such as time-division (TDMA), frequency-division (FDMA), code-division
(CDMA) or rate-splitting
[1]
, require considerable coordination. One recent successful approach for
uncoordinated multiple-access is Interleave Division Multiple-Access (IDMA)
[2][3][4]
, which uses interleaving to
distinguish among signals from different users. The concept of generalized Code Division Multiple Access
(CDMA) may be defined as a multiple access scheme, which separates the users in the code domain, whilst
allowing them to share the same time and frequency resources. But in proposed multiple access technique
IDMA ,user separation is done by user specific interleavers in contrast to the conventional CDMA scheme,
where user separation is assured with user-specific signature sequences. The user specific interleavers must
demonstrate minimum probability of collision amongst each other in addition to other merits, including minimal
consumption of bandwidth, least hardware for their generation, and least memory requirement.
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 365 of 373
The first step of the project work consists of the concepts of the IDMA schemes and LDPC coding scheme.
After this, we run IDMA scheme with BPSK signalling using convolutional codes and LDPC codes. Now study
the SNR and BER concepts for IDMA scheme. After this we calculate the SNIR and BER for IDMA using
LDPC matrix. The second step includes performance of convolutional coded IDMA scheme with variable data
length and variable users. Performance includes the graph between BER and SNIR. In the third step, we
designed random interleaver, master random interleaver and TBI with LDPC matrix using MATLABR2010 and
performed their BER vs. SNIR performance for variable users and variable data length.
2. INTERLEAVE-DIVISION MULTIPLE-ACCESS
Interleave-Division Multiple-Access (IDMA) is a technique that relies on different interleavers to separate
signals from different users in a multiuser spread-spectrum communication systems. In
[6]
, an IDMA system that
uses randomly and independently generated interleavers is presented. With these interleavers, the IDMA system
in
[7]
performs similarly and ever better than a comparable CDMA system. The condition for IDMA to be
successfully implemented is that the transmitter and receiver agree upon the same interleaver. For random
interleavers, the entire interleaver matrix has to be transmitted to the receiver, which can be very costly. Our
goal is to construct non-random interleavers for IDMA that performs as well as random interleavers and satisfy
two design criteria:
They are easy to specify and generate, i.e. the transmitter and receiver can send a small number of bits
between each other in order to agree upon an interleaver, and then generate it.
The interleavers do not collide.
IDMA inherits many advantages from CDMA, in particular diversity against fading and mitigation of the
worst-case other cell user interference problem. The normalized MUD cost (per user) is independent of the
number of users
[6]
.

Fig. 1 : IDMA Transmitter & Receiver
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 366 of 373
The upper part of fig.1 shows the transmitter structure of the multiple access schemes under consideration with
K simultaneous users. The input data sequence d
k
of user-k is encoded based on a low-rate code C, generating a
coded sequence c
k
= [c
k
(1), . c
k
(]), . . c
k
([)]I, where J is the frame length. The elements in c
k
are referred
to as coded bits. Then c
k
is permutated by an interleaver
k
, producingx
k
= [x
k
(1), . x
k
(]), . . x
k
([)]I.
Following the CDMA convention, we call the elements in x
k
chips. Users are solely distinguished by their
interleavers, hence the name interleave-division multiple-access (IDMA)
[5]
.
The key principle of IDMA is that the interleavers {n
k
should be different for different users. We assume that
the interleavers are generated independently and randomly. These interleavers disperse the coded sequences so
that the adjacent chips are approximately uncorrelated, which facilitates the simple chip-by-chip detection
scheme discussed below. We adopt an iterative sub-optimal receiver structure, as illustrated in Fig. 1 which
consists of an elementary signal estimator (ESE) and K single-user a posteriori probability (APP) decoders
(DECs). The multiple access and coding constraints are considered separately in the ESE and DECs. The
outputs of the ESE and DECs are extrinsic log-likelihood ratios (LLRs) about {x
k
(])} defined as :
c(x
k
(])) log _
Pr(x
k
(]) = +1)
Pr(x
k
(]) = 1)
_ , k, ] (2.1)
These LLRs are further distinguished by subscripts, i.e. c
LSL
(x
k
(])) and c
LC
(x
k
(])), depending on whether
they are generated by the ESE or DECs.
2.1. The Basic ESE Function
We first assume that the channel has no memory. After chip-matched filtering, the received signal from K users
can be written as :
r(]) =
k
x
k
(]) +n(]), ] = 1,2, . [ (2.2)
k
k=1

Where x
k
(]) {+1, 1} is the j
th
chip transmitted by user-k,
k
is the channel coefficient for user-k and {n(j)}
are samples of an AWGN process with variance o
2
= N0/2. We assume that the channel coefficients {
k
} are
known a priori at the receiver. Due to the use of random interleavers {n
k
}, the ESE operation can be carried out
in a chip-by-chip manner, with only one sample r(j) used at a time :
r(]) =
k
x
k
(]) +
k
(]) (2.3o)
Where,

k
(]) r(])
k
x
k
(]) =
k
x
k
(]) + n(j) (2.3b)
k
k=1

is the distortion (including interference-plus-noise) in r(j) with respect to user-k. From the central limit theorem,
(
k
can be approximated as a Gaussian variable, and r(j) can be characterized by a conditional Gaussian
probability density function).
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 367 of 373
P(r(]))|x
k
(]) = 1 =
1
_2nIor(
k
(]))
exp _
r(j) [
k
+ (
k
(]))
2
2Ior(
k
(]))
_ (2.4)
Where E() and Var() are the mean and variance functions, respectively.
3. LDPC CODES
In this part we study about low density parity check (LDPC) coding scheme. Basically there are two different
possibilities to represent LDPC codes. Like all linear block codes they can be described via matrices. The
second possibility is a graphical representation. Lets look at an example for a low-density parity-check matrix
first. The matrix defined in section 2 is a parity check matrix with dimension nm for a (8,4) code. We can now
defined two numbers describing this matrix. W
r
for the number of 1s in each row and w
c
_n and w
r
_m must be
satisfied. In order to do this, the parity check matrix should usually be very large, so the example matrix cant be
really called low-density. A LDPC code is called regular if w
c
is constant for every column regular and w

=
w
c
(n/m) is also constant for every row. The example matrix from equation (2.1) is regular with w
c
= 2
and w

= 4. Its also possible to see the regularity of this code while looking at the graphical representation.
There is the same number of incoming edges for every v-node and also for all the c-nodes. If H is low density
but the numbers of 1s in each row or column arent constant the code is called an irregular LDPC code.
3.1. Decoding LDPC Codes
The algorithm used to decode LDPC codes was discovered independently several times and as a matter of fact
comes under different names. The most common ones are the belief propagation algorithm, the message passing
algorithm and the sum-product algorithm In order to explain this algorithm, a very simple variant which works
with hard decision, will be introduced first.
3.1.1. Hard-Decision Decoding
The algorithm will be explained on the basis of the example code already introduced in equation 2.1 and figure
1. An error free received codeword would be e.g. c= [10010101]. Lets suppose that we have a BHC channel
and the received
The codeword with one error- bit c1 flipped to 1.
1. In the first step all v-nodes ci send a message to their (always 2 in our example) c-codes fj containing the
bit they believe to be the correct one for them. At this stage the only information a v-node ci has, is the
corresponding received i-th bit of c, yi. That means for example, that c0 sends a message containing 1 to f1
and f3, node c1 sends messages containing y1 (1) to f0 and f1, and so on.
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 368 of 373

Table 1: Overview over messages Received and Sent by the C-nodes in step 2 of the
Message Passing Algorithm
2. In the second step every check nodes fj calculate a response to fj ci

every connected variable node. The
response message contains the bit that fj believes to be the correct one for this v-node ci assuming that the
order v-nodes connected to fj are correct.
In other words: If you at the example, every c-node fj is connected to 4 v-nodes. So a c-node fj looks at the
message received from three v-nodes and calculated the bit that the fourth v-node should have in order to fulfill
the parity check equation. Table 1 gives an overview about this step.
Important is, that might also be the point at which the decoding algorithm terminates. This will be the case if all
check equations are fulfilled. We will later see that the whole algorithm contains a loop, so another possibility to
stop would be a threshold for the amount of loops.
Next Phase: The v-node receive the messages from the check ci fj nodes and use this additional information
to decide if their originally received bit is OK. A simple way to do this is a majority vote. When coming back to
our example that means, that each v-node has three sources of information concerning its bit. The original bit
received and two suggestions from the check nodes. Table 2 illustrates this step. Now the v-nodes can send
another message with their (hard) decision for the correct value to the check nodes.
Go to step 2. Loop: In our example, the second execution of step 2 would terminate the decoding process since
c1 has voted for 0 in the last step. This corrects v-node y
i
the answer messages from the c-nodes to perform a
majority vote on the bit value. The transmission error and all check equations are now satisfied.

Table 2 : Step 3 of the describe decoding algorithm. The v-nodes use the answer messages from the
c-codes to perform a majority vote on the bit value
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 369 of 373
4. SIMULATION RESULTS AND PLOTS
We are using BER curves for show the simulation result and for this we are using MATLAB R2010 version .
Assume, for all users, the same FEC code is used and the same BER performance is required. If SNR is denoted
by {
k
} after l
th
iteration and if we take f
k
{
k
}is average variance of the output of EC
k
driven by an input
sequence with SNR {
k
}
y
k
I
=
P
k
c
2
+
| i=k
|y
k
l
|P
|
|P
|
|
2
|h
k
|
2


Valid for all k and l=0,1,2,3........L-1.
Here L is maximum number of iteration. At the beginning of iteration; {
k
}=0 for all k. We have, ||
2
=
1; or oll k olJing Aw0N conncl and we have to minimize power P
k k
while achieving the required
performance.
y
k
I
2
2R
1; or oll k .

Fig. 2 : Simulation Results For Variable Users Without Coding Over
AWGN Channel Using Master Random Interleaver

Fig. 3 : Simulation Results For Variable Users Without Coding Over
Rayleigh Channel Using BPSK Signalling
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 370 of 373

Fig. 4 : Simulation Results For Variable Users Without Coding Using Tree Based Interleaver

Fig. 5 : Simulation Results For Variable Users With Coding Using TBI.

Fig. 6 : Simulation Results For 32 Users Without Coding Using Random Interleaver
Over Rayleigh Channel.
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 371 of 373

Fig. 7 : Simulation Results For 32 Users Without Coding Using TBI.

Fig. 8 : Simulation Results For 48 Users Without Coding Using Random Interleaver

Fig. 9 : Simulation Results For 64 Users Without Coding Using TBI
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 372 of 373

Fig. 10 : Simulation Results For Comparison Of LDPC Coded IDMA And Convolutional Coded IDMA
5. CONCLUSIONS
Based on the chip-interleaved CDMA philosophy of frenger et al. and Prokis et al. the IDMA entails reversing
the classical position of direct sequence spreading and interleaving employed in traditional CDMA system,
leading to chip interleaving instead of bit interleaving, where the different users are distinguish by their user-
specific chip interleavers. The very simple chip-by-chip iterative MUD is allowed in IDMA system due to chip-
level interleavers
[5]
. Meanwhile this process combines coding and spreading operation to maximize coding
gains using low rate codes and make the system nearer multiple access channel (MAC) capacity
[6][7]
. In paper
[8]

convolutional codes is used in IDMA to verify the system performance of multiple access over AWGN channel
and quasi-static Rayleigh fading multi-path channel. According to our studies
[9]
, regular (3,6) LDPC codes can
be applied to IDMA systems, called LDPC coded IDMA system. The optimal LDPC code rates in LDPC coded
IDMA system for reliable voice and data transmission is middle rates between 0.4 and 0.5 over AWGN channel.
6. FUTURE SCOPE
Still, it needs a lot of improvement in the field of detection techniques and coding techniques. By improving
IDMA detection algorithm we can enhance the performance of IDMA system in wireless communication.
7. REFERENCES
[1] Pingzhi Fan, Multiple Access Technologies for Next Generation Mobile Communication, IEEE Int.
Conf.ITS Telecomm. Proc., pp. 10-11, 2006
[2] kiyohito Nagata, IMT-2000 Terminal and its Requirements for Device Technologies, VLSI Circuits
Digest of Technical Papers, pp. 2-5, IEEE, 2000.
[3] Li Ping, L. Liu, K.Y.Wu, and W.K. Leung, Interleave-division multiple-access, IEEE Trans. Wireless
Commu., Vol. 5, NO. 4, pp. 938-947, April 2006.
[4] Li Ping, Interleave Division Multiple Access and Chip by Chip Iterative Multiuser Detection, IEEE Radio
Communications, pp. S19-S23, june 2005.
[5] Shimon Moshavi, Multiple detection for DS-CDMA Communications, IEEE Comm. Magazine, pp. 124-
Ajit Singh et. al / VSRD International Journal of Electrical, Electronics & Comm. Engg. Vol. 1 (7), 2011
Page 373 of 373
136, oct. 1996.
[6] Li Ping, Lihai Liu, and W.K. Leung. A simple Approach to Near-Optimal Multiuser Detection: Interleave-
Division Multiple-Access. In IEEE Wireless Comm. and Networking Conference, pages 391396, 2003
[7] A.Grant B.Rimoldi, R.Urbanke,and P.Whiting. Rate-Splitting Multiple Access for Discrete Memoryless
Channels. IEEE Trans. Info. Theo., 47(3): 873-890, Mar. 2001.
[8] Peter Adam Hoeher and Hendrik Schoeneich, Interleave Division Multiple Access from a Multiuser
Theory Point of View, Turbo Coding, Munich, April 2006.
[9] L.H. Liu, W.K. Leung, and Li Ping, "Simple chip-by-chip multi-user detection for CDMA systems" in Proc
.IEEE VTC, Jeju, Korea, pp.2157-2161, Apr.2003.
[10] R.H. Mahadevappa and J.G. Proakis, Mitigating multiple access interference and intersymbol Interference
in uncoded CDMA Systems with chip-level interleaving, IEEE Trans. Wireless commun., vol. 1, pp. 781-
792,Oct. 2002.
[11] N.V. Anil Kumar, M.K.Shukla, and S. Tiwari, Performance of an Optimum Tree Based Interleaver for
IDMA Systems, submitted for publication in IEEE, 2007.
[12] Luo, Yao Wang, Lin Ling, Jun, The Coding-Spreading Trade-off in LDPC coded IDMA systems, Dept.
Of Communication Engineering, Cchongqing University of Posts & Telecommunications, Chongqing,
400065.
[13] P.Li, K.Y. Wu and L.H.Liu, A Simple, Unified Approach to Nearly Optimal Multiuser Detection and
Space-Time Coding, in Proc. ITW 2002, India, pp. 53-56, Oct.20-25.2002.