UNDER WATER COMMUNICATION

(UWC)
WITH IDMA SCHEME
 

Manoj Kumar Shukla

Professor
Harcourt Butler Technical
University
Kanpur
 TABLE OF CONTENTS

Introduction to UWC.

Why IDMA Scheme used in UWC.

Introduction to IDMA Scheme.

Types of Interleavers.

Aqua/Acoustic Channel.

MIMO for UWC

MIMO-OFDM-IDMA Scheme for UWC & Simulation results.

Rake Receiver with IDMA Scheme for UWC & Simulation results.

IDMA with MRC Diversity Technique for UWC & Simulation results.

Time Plan and Strategy of Work

Application of UWC.

Expected Impact of the Research in Academics/industries.

References
 INTRODUCTION TO UNDER WATER COMMUNICATION

Technique of sending and receiving message below water.

UWCNs are managed by sensors and AUVs that perform

specific applications such as underwater monitoring

The mobility and the movement of sensors with water currents

of AUVs makes the reliable inter-vehicle and sensor-AUV
communication is especially difficult.

Typical frequency: 1 Hz to 1 MHz

Hydro acoustics
 AQUA/ ACOUSTIC CHANNEL

 The study of sound propagation in the ocean is vital to the understanding of wireless
signal transmission underwater through acoustic channel.

Underwater wireless communication more challenging due to transmission loss,

multipath propagation and multipath fading, Doppler spreading, ambient noise.

Regular and Random are two kinds of heterogeneities observed in the ocean which
cause fluctuations in the sound field. Hence, the speed of sound varies with depth,
temperature, salinity, location, time of the day and season.

Variant of Noise under

sea water
 MIMO for UWC

MIMO is the technique to transmit the data independently from more than one
antenna simultaneously, and at receiver side data is received by one or more than one
antenna.

MIMO is basically used in underwater communication where the data rate is limited,
it is used to increase the data rate.

 MIMO is powerful technique to control the underwater acoustic spectrum by adding

simply multiple receivers and transmitters with less processing stages without adding
extra bandwidth and transmission powers .

Block Diagram of
MIMO
 WHY IDMA SCHEME IN UNDER WATER COMMUNICATION?

The three distinguish characteristics of this channel are

frequency-dependent, Propagation loss, multipath, and low speed
of sound propagation.

Above 3 characteristics best suit in IDMA Scheme features.

IDMA scheme is better than CDMA scheme.

IDMA scheme has very less loss of communication in multipath

propagation.
 INTRODUCTION TO IDMA SCHEME

It is a multiple access technique in which interleavers are

employed to distinguish the users.
 Introduction to IDMA
It is a multiple access technique in
which interleavers are employed to
distinguish the users.
 IDMA Transmitter and Receiver structures
Encoder (C) Spreader Interleaver 1
User 1
Multiple
MultipleAccess
Access
CODER Multipath
Multipath
Channel
Channel

Encoder (C) Spreader Interleaver K

User K
r(j)
Deinterlever 1 eESE (x1 (j))
Decoder
User 1 (DEC)
Interleaver 1 eDEC (x1 (j)) Elementary
Turbo Signal
Processor Estimator
eESE (xK (j)) (ESE)
Deinterleaver K
Decoder
(DEC) eDEC (xK (j))
User K Interleaver K
 Transmitter Structure for IDMA
The coder block of a low-rate code C is employed to produce a
(K )
coded sequence = { c j, j=1, 2, ..J}, where J is the frame length,
followed by a chip level interleaver that maps to c ( Kto )
x ( ={
K)
x ( K, )
j=1, 2, ..J}.

Basic elements referred as “chips”.

Coder block can be either the same or different for different users
such as FEC code or a spreading sequence or a combination of the
two [8]*.
 Transmitter Structure…
From performance point of view, low-rate FEC
code [9]*[10]** provide an extra coding gain.

the interleavers { (K ) } should be different for

individual users.

BPSK signaling is assumed for analysis.

 Receiver Structure
After sampling at chip rate, the received signal
from K users can be written as
K
rj   hk xk ( j )  n( j )
k 1

where j = 1, 2, …, J, and xk ( j ) is the jth chip

transmitted by the Kth user,{ hk } the channel
coefficient for the Kth user and { n(}jsamples
) of
a zero-mean additive white Gaussian noise
(AWGN) with variance =N0/2.
 Elementary Signal Estimator (ESE)
The receiver consists of Elementary Signal
Estimator (ESE) and an a posteriori probability
(APP) decoder (DEC).

The ESE exchanges information with the DEC in

a turbo-type manner [11]*. The DEC also
K
produces hard decisions { d rx } on information
x ( j)
K

K
bits { d } in the final iteration.

The ESE generates coarse estimates of { j = 1,…, J,

K = 1,..k,.., K}.
*
 ESE…
The output of the ESE is defined by the logarithm
likelihood ratio (LLR)
 p ( rj | xK ( j )  1, h) 
{eESE ( xK ( j ))}  log  
 p ( rj | xK ( j )  1, h) 
 
K , j
The DEC consists of K local APP decoders. The kth local
APP decoder performs an APP decoding of Coder for the
kth user using , after appropriate deinterleaving, as its
input. Its output is the so-called extrinsic LLR [11] .
 LLR generation from decoder (DEC)

The LLR output of decoder block represented by,

 pr ( xK ( j )  1| eECE ( xK ( j )), Coder ) 

{eDEC ( xK ( j ))}  log    eECE ( x K ( j ))
 pr ( xK ( j )  1| eECE ( xK ( j )), Coder ) 
K , j
 Log Likehood Ratio (LLR)
For coded communication system both demodulator
and channel decoder are of maximum a posteriori
(MAP) type.

Function of MAP demodulator is to produce

probability 0 or 1.

At the ith iteration, the information available to the

MAP demodulator consists of the received signal r(t).
 Iterative (Turbo) decoding
An example:
APP: a priori probability of event A
Priori means A comes prior to B and is independent of B

Posteriori Probability P (A/B) is probability of A ,

given B or likelihood of A.
An Example….

SR AR

Two bags: with 70% and 100% red balls

So APP of picking AR is 0.5.

P(A/B) form AR is 1.0.

 An Example….

From Baye’s Theorem, (~A,B)

P(B)=P(A,B)+ P(~A,B) (A,B)

=P(B/A).P(A)+ P(B/~A).P(~A)

A B
So,

P( B / A).P( A)
P( A / B) 
P( B / A).P( A)  P( B / ~ A).P(~ A)
An Example….

FIRST ITERATION

APP 0.5 0.5

P(~A) P(A)
SR AR
RED 0.7 1.0
P(B/~A) P(B/A)

~RED 0.3 0

POSTERORI 0.41 0.59

P(A/B)
An Example…..

SECOND ITERATION

SR AR
APP 0.41 0.59
P(~A) P(A)

RED 0.7 1.0

P(B/~A) P(B/A)

~RED 0.3 0

POSTERORI 0.33 0.67

P(A/B)
An Example….

THIRD ITERATION

SR AR
APP 0.33 0.67
P(~A) P(A)

RED 0.7 1.0

P(B/~A) P(B/A)

~RED 0.3 0

POSTERORI 0.26 0.74

P(A/B)
An Example….

FOURTH ITERATION

SR AR

APP 0.26 0.74 P(A)

P(~A)

RED 0.7 1.0

P(B/~A) P(B/A)
RED 0.3 0
POSTERORI 0.19 0.84
P(A/B)
 Why Turbo Processing is used?
It can be applied successfully to many detection/
decoding problems.

Relatively error rate is improved so it is known as error

correcting code.

Turbo codes get their name because the decoder uses

feedback, like turbo engine.
 Turbo processing…..
The turbo-principle is more general than merely its
application to the decoding of turbo codes.
The “Turbo Principle” can be described as:
“Never discard information prematurely that may be
useful in making a decision until all decisions related to
that information have been completed.”
 -Andrew Viterbi
“It is a capital mistake to theorize before you have all the
evidence. It biases the judgment.”
 -Sir Arthur Conan Doyle
Can be used to improve the interface in systems that
employ multiple trellis-based algorithms.
 Applications of the
Turbo Principle
Other applications of the turbo principle include:

Decoding serially concatenated codes.

Combined equalization and error correction decoding.

Combined multiuser detection and error correction decoding.

(Spatial) diversity combining for coded systems in the

presence of MAI or ISI.
Interleavers

27
 Block
Interleaver/Deinterleaver
 Interleaver
 Write row by row sequentially
 read column by column according to the predefined permutation pattern

 Deinterlever
 Write column by column according to the predefined permutation pattern
 read row by row sequentially

read

write b0 b1 b2 …. b(M-1)
bM b(M+1) b(M+2) …. b(2M-1)
b0b1b2...b(L-1) . b0bM…b1b(M+1)…b(M-1)b(2M-1)...b(L-1)
.
.
b((L/M-1)*M) b(1+(L/M-1)*M) b(2+(L/M-1)*M) …. b(L-1)

<interleaving procedure>
 What is Interleaver? 1,5,9,13,………..,8,12,16
Data Out
1,2,3,………..,16 Data In
1 2 3 4
5 6 7 8
TRANSMITTER SIDE 9 10 11 12
13 14 15 16

1,5,9,13,………..,8,12,16
Data In
1,2,3,………..,16 Data Out
1 2 3 4

RECEIVER SIDE 5 6 7 8

9 10 11 12
13 14 15 16

In IDMA, each User will have specific interleaver, orthogonal in nature.

 TYPES OF INTERLEAVERS
RANDOM INTERLEAVERS
MASTER RANDOM INTERLEAVERS
TREE BASED INTERLEAVERS
PRIME INTERLEAVERS
ROTATIONAL INTERLEAVERS
HELICAL INTERLEAVERS
PEG ALGORITHM BASED INTERLEAVERS
PARLLEL INTERLEAVERS
POWER ROTATIONAL INTERLEAVERS
ORTHOGONAL INTERLEAVERS
 TYPES OF INTERLEAVER

1. RANDOM INTERLEAVER

2. MASTER RANDOM INTERLEAVER

3. TREE BASED INTERLEAVER

4. PRIME INTERLEAVER

5. ROTATIONAL INTERLEAVER

6. HELICAL INTERLEAVER
 TYPES OF INTERLEAVERS

1. RANDOM INTERLEAVER
 It scramble the data of different users with
different pattern, generated arbitrarily.

 Rearranges the elements of its input vector

using a random permutation.

 The data is arranged according to the

pseudo-random order of memory addresses.
Random Interleaver Block Diagram

33
 2. MASTER RANDOM INTERLEAVER
 In random interleavers, the base station (BS) has to use a
considerable amount of memory to store the random patterns of
interleavers.

 A master interleaver pattern ᶲ is assigned.

 K Interleavers can be generated using πk = ᶲ k

(K is an integer).

 By this rule, every interleaver is a ‘power’ of ᶲ.

 Now BS assigns the power index k to each user k, and then ᶲ k will
be generated at the MS for user k accordingly.
 3. TREE BASED INTERLEAVER
 Aimed to minimize the computational complexity and memory
requirement that occur in power interleaver and random
interleaver, respectively.

 Tree Based user-specific interleaver generation is based on two

master interleavers, which are randomly selected.

 The odd number of users is taken upside while even number of

users is taken downside.

 First user interleaver will be П1 while for second user, the

interleaver will be П2.

 In case of third user it will be П1 (П1) and for fourth user, the
interleaving sequence will be П2 (П1).
The algorithm for generation of TBI tree is given below.
Step 1: Master interleaver  1 is randomly generated having the
length of data block (data length × spreader length).
Step 2: Master interleaver 2 is randomly generated having the length of data block (data
length × spreader length).
Step 3: According to user k, level (L) of Tree is determined. Hence, Number of users in
that level = 2L
Step 4: All the possible combinations (2L) of interleavers are generated as
( 1 ) (2 ), ( 2 ) (1), …..and so on.
Step 5: According to the user k particular combination of Master interleaver i.e.  1 , 2
and , is chosen and there after data is interleaved accordingly.
3. TREE BASED INTERLEAVER
Tree Based Interleaver Block Diagram

38
 The Memory requirement of TBI is extremely low as compared to
that of the Random Interleaver, while is slightly high if compared
with master random interleaver.

 The simulations results conclude that the performance of TBI is

very close to the desired ideal status of the results.
 Memory Requirement of Interleavers

For a Chip length: cl, no. of user: n

Memory Required for Random Interleaver: n*cl*log2 (cl).

Memory Required for Master Random Interleaver: cl*log2

(cl).

Memory Required for Tree Based Interleaver:

2* cl*log2 (cl).

40
 MEMORY REQUIREMENT 6
x 10 Comparison Graph showing Memory Requirement of 3 Interleavers with m=256 sl=16
5
With Random Interleaver
4.5 With Master Random Interleaver
Memory Requirement of Interleaver(No.of bits required/user)

With Tree Based Interleaver

4

3.5

2.5

1.5

0.5

0
0 10 20 30 40 50 60 70 80 90 100
41 User Number
 Data Formats with Different Interleavers

 With Random Interleaver:

1st int seq 2nd int seq Nth int seq Data
 With Master Random Interleaver:

Master
User number Data
Sequence
 With Tree Based Interleaver:

1st Master 2nd Master User number Data

Sequence Sequence
42
 4. PRIME INTERLEAVER
 Aimed to minimize the bandwidth and memory requirement with
BER performance comparable to random interleaver.

 Used the prime numbers as seed of interleaver.

 Let us consider a case of interleaving n bits with seed p.

 First, we consider a Gallois Field GF (n).

 If {1, 2, 3, 5, 6, 7, 8… n} are consecutive bits to be interleaved with

seed p then location of bits after interleaving will be as follows:
1===> 1 2===> (1+p) mod n 3===> (1+2p) mod n
4===> (1+3p) mod n . . n===> (1+(n-1)p) mod n
 4. PRIME INTERLEAVER
 For Example: if we have to interleave 8 bits such that
{1, 2, 3, 4, 5, 6, 7, 8} and we wish to interleave these bits with seed
3 then the new location of bit will be as follows 1===> 1
2===> (1+1*3) mod 3===>4
3===> (1+2*3) mod 3===>7
4===> (1+3*3) mod 3===>2
5===> (1+4*3) mod 3===>5
6===> (1+5*3) mod 3===>8
7===> (1+6*3) mod 3===>3
8===> (1+7*3) mod 3===>6
Now, the new order of bits will be {1, 4, 7, 2, 5, 8, 3, and 6}.

 The bandwidth required by the Prime Interleaver (PI) is smaller

 5. ROTATIONAL INTERLEAVER
1. Get a data matrix where the number of rows is equal to the
number of users and the number of columns is equal the data
length of spreaded data.

2. Generate a scrambling rule for the columns.

3. Scramble the each column of the data matrix.

4. Generate another scrambling rule for single row length.

5. The other rows of the scrambling rule can be generated by

rotating the first random row by xk steps.
x=int (datalength /N) k=number of user being processed
6. Scramble the each row of previously scrambled matrix according
to the scrambling rule generated in step 4.

 The simulation results for 16 users performs better than

conventional CDMA and existing IDMA simulations in terms of
lower BER for same number of users.

 This interleaver is recommended to be used with IDMA scheme

with are where less than 20 users are operative at a time.
 6. HELICAL INTERLEAVER
 Generate a one-dimensional master interleaver of length Nc and write the
interleaver indices of the master interleaver row-wise into a matrix with Mr
rows and Mc columns as depicted, where Mr ·Mc = Nc.

 The 1st helical interleaver is generated from the master interleaver by reading
the interleaver indices column-wise.

 The remaining interleavers are generated by cyclicly reading the interleaver

indices from the diagonals.

 A mathematical representation of the ith helical interleaver

πi[k]=π[ l mod Nc], 0 ≤ k<N c,
where l = k mod Mr ·Mc + k Mr+(k mod Mr ·(i−1)mod Mc
 Simulation result shows generation of helical
interleavers is very fast and interleaver indices
spread out effectively.

 Good-error performance and a low

computational complexity make helical
interleavers a potential candidates for
IDMA systems.
6. HELICAL INTERLEAVER
 7. PEG INTERLEAVER

 PEG Interleaver is based on PEG (Progressive Edge Growth) algorithm.

 PEG algorithm generates random interleavers.
 8. PARLLEL INTERLEAVER
 Interleaving and deinterleaving operations permute sequences
serially, take many clock periods and lead to much processing
latency and low processing throughput.

 Shuang Wu et al [12] proposed the parallel interleaver.

 To overcome memory access conflict.

 The data in the same memory unit simultaneously, which may

have a severe impact on the receiver performance.
 Main design principles of the parallel interleavers:
N number of chips in a frame
D number of information bits per frame per user
M degree of parallel processing
W number of chips to be processed in each processor

 N = DS = MW and W are constrained.

For example: with linear block codes, W is an integer multiple of
the coding length; with repetition codes, W is an integer multiple
of the spreading length S.

 The algorithm for the parallel interleaver design, can be divided into
five stages, which are given as
 8. PARLLEL INTERLEAVER
Stage 1: Assign the initial matrices with M rows and W columns.
Stage 2: Put the coded bits into matrices by rows.
Stage 3: Perform column-wise interleaving for each column.
Stage 4: Perform row-wise interleaving for each row.
Stage 5: Read out the bits by rows.
Detailed descriptions of Stage 3 and 4 are given as follows
Stage 3: column permutation
1) Different random seeds are allocated to different users.
2) For user k, independent random sequences with length
M are generated by its own random seed.
 8. PARLLEL INTERLEAVER
Stage 4: row permutation
1) Let ᴫini be the initial interleaver with length W.

2) ᴫk, the interleaver of the first row of user k, is generated by

cyclically shifting the initial interleaver by Lk steps, where
L = int(W/K) , and int(x) returns the greatest integer that is no larger than x.

3) For user k, the interleaving patterns of the following row

are generated by cyclically shifting the previous row’s
interleaver one step.
 9. POWER ROTATIONAL INTERLEAVER
 To obtain the interleaving rule at the receiver which needs some
additional bandwidth.
 In order to reduce this bandwidth requirement the Power
Rotational Interleaver design is proposed.
 No memory collision in the scrambling process of spreaded data.
 Design Algorithm:
Let us consider
n= number of users
N= length of spreaded data for each user
Matrix of order (n x N).
Data of user in a separate matrix of order (p x w) row wise.
 9. POWER ROTATIONAL INTERLEAVER
p x w = N
 Generate an random sequence of length w which consists of each
number among 1 to w.
 Divide each element of this random sequence with p and take
remainder for each element.
 Generate a column permutation rule in a rotational manner and
scramble the data of the user separately.
 For next user the initial random sequence is generated using
master random interleaver concept.
 Perform row wise scrambling in the same fashion on this column
wise scrambled data matrix.
 9. POWER ROTATIONAL INTERLEAVER
 For example let us consider n=4, N=24, p=4 hence w=6
 Initial Matrix generated

 The random sequence generated for column permutation rule is


 After taking remainder of each element with p the remaining array will be

 The column permutation rule can be generated in the following way

 9. POWER ROTATIONAL INTERLEAVER
 Then the scrambled data matrix will be as given below

 For row permutation rule we need to generate a random sequence again as given below

 Then the row permutation rule can be generated by shifting the random sequence by i steps with
respect to sequence of previous row. Where the i is the number of row being accessed.
 9. POWER ROTATIONAL INTERLEAVER
 Then the finally scrambled data matrix will be

 For the next user the initial sequence for column permutation rule will be generated
using master random interleaver concept.
 User1:{5,3,4 ,1,6,2}; User2:{6,4,1,5,2,3}; User3:{3,5,6,2,4,1}

 Similarly the initial sequence for row permutation rule will be generated using same
concept
 User1:{4,3,6,2,1,5}; User2:{2,6,5,3,4,1} ; User2:{6,1,4,5,3,2}

 The above mentioned approach ensured the reduction in bandwidth requirement and
removal of the problem of memory collision.
COMPARISSON OF INTERLEAVERS
COMPARISSON OF INTERLEAVERS
Multi-User Detection Techniques

The three detector techniques discussed here are

A Posteriori Information (APPI) based

Chip Extrinsic Information (CEI) based

Bit Extrinsic Information (BEI) based

62
COMPARISSON OF INTERLEAVERS
COMPARISSON OF INTERLEAVERS
COMPARISSON OF INTERLEAVERS
 CONCLUSION
 IDMA can generate some fruitful results.

 IDMA is better than FDMA/CDMA/TDMA/SCDMA.

 The main advantages of IDMA are its low complexity, high

bandwidth and power efficiency, and excellent adaptivity.

 IDMA provides a low-cost approach towards MUG.

 Hybrid schemes can combine the advantages of both orthogonal and

non-orthogonal approaches.
 FUTURE ENHANCEMENT
 Further improvements and testing of IDMA systems :
 Interleaving scheme for memory optimization

 Improvement in coding schemes,

 Automatic repeat request,

 Synchronization issues,

 Peak-to-average power reduction,

 In modulation schemes.

for superior performances in wireless communication.

 MIMO-OFDM-IDMA SCHEME for UWC

 It is an efficient, scalable, adaptive MIMO-OFDM Technique with IDMA scheme to

mitigate the fading issues in UWC

OFDM technique transmitted high data rate into low rate parallel sub-streams.

 MIMO-OFDM with IDMA Scheme is employed to improve the below water communication
with the help of the most common device known as hydrophones.

Block Diagram of OFDM

 MIMO-OFDM TECHNIQUE with IDMA SCHEME for UWC
SIMULATION RESULT

BER performance of the BER performance of the MIMO-OFDM-

MIMO-IDMA with different users IDMA with different users
 RAKE RECEIVER with IDMA SCHEME FOR UWC

 Rake receiver is to process the fading signal and take advantage of the replicas
that follow different paths.

 The Rake receiver consists of finger processors, a maximal ratio combiner

(MRC) and a detector.

 An adaptive joint CE and phase tracking algorithm is developed for IDMA

systems using two different training methods.

 Two low cost adaptive algorithms, LMS and NLMS, are employed to track and
correct the effects of time variations.

Block Diagram of The Soft

rake IDMA receiver
 RAKE RECEIVER with IDMA SCHEME for UWC
SIMULATION RESULT

Simulation of IDMA scheme over IDMA over UWA channel for same number
UWA channel for FOUR number of of rake fingers but for different path length.
rake fingers
 IDMA with MRC DIVERSITY TECHNIQUE for UWC

IDMA multiple-access Scheme with receive diversity is demonstrated using

random interleaver.

MRRC diversity technique is being employed due to its better performance in

comparison to other methods.

After encoding and spreading the data is randomly interleaved and termed as
chips.

Block Diagram of IDMA with

MRC Receiver diversity
MRC DIVERSITY TECHNIQUE with IDMA SCHEME for UWC
SIMULATION RESULT

IDMA scheme using tree based interleaver with and without receive diversity
at different data length. The block length is set for 200 bits, with 15 iterations
and 16 bits
 APPLICATIONS OF UNDERWATER COMMUNCIATION

Naval defense (submarines)

Ocean exploration

Understanding natural disasters (tsunami)

 Environmental monitoring

 Mine reconnaissance

Seismic monitoring

 Equipment monitoring and control

 REFERENCES

[1] M. Shukla, V.K. Srivastava, S. Tiwari, “Analysis and Design of Optimum

Interleaver for Iterative Receivers in IDMA Scheme”, Wiley Journal of Wireless
Communication and Mobile Computing, Vol 9. Issue 10, pp. 1312-1317. Oct, 2009.

[2] Nirmal Chandrasekaran, “Diversity Techniques in WirelessCommunication

Systems” in Proceedings of the WirelessCommunication Technologies Spring, pp. 1-
8, 2005.

[3] J. A. Catipovic, "Performance limitations in underwater acoustic telemetry,"

OceanicEngineering, IEEE Journal of, vol. 15, pp. 205-216,1990.

[4] M. Stojanovic, "Recent advances in high-speed underwater acoustic

communications," OceanicEngineering, IEEE Journal of, vol. 21, pp. 125-136,1996.

[5] M.Johnson, D.Herold and J.Catipovic, “The design and performance of a compact
underwater acoustic network node," in Proc. OCEANS'94, pp. III.467-471, Brest,
France, Sept. 94.

[6] Tanuja Pande, Kulbhushan Gupta, M. Shukla, Prachi Tripathi, Ashutosh Singh.
“Underwater Communication with IDMA Scheme”. In proc. of ICACNI 2013, pp.
432-438.
[7] M. Shukla, V.K. Srivastava, S. Tiwari “Interleave Division Multiple Access for
Wireless Communication,” Proc. of International Conference on Next Generation
Communication Systems: APerspective, ICONGENCOM 06”, J.K. Institute, Allahabad,
India, pp. 150-154, Dec 9-11, 2006.

[8] M. Shukla, Akanksha Gupta,Rinkoo Bhatia “Performance Evaluation of Maximal

Ratio Receiver Combining Diversity with Prime Interleaver for Iterative IDMA
Receiver” Journal of Information Engineering and Applications, pp. 29-39. 2011.

[9] L.J. Cimini, Jr., Analysis and simulation of a digital mobile channel using orthogonal
frequency division multiplexing," IEEE Trans. on Communications.,vol. 33, pp. 665-
675, July 1985.

[10] Hongwei Yang, A road to future broadband wireless access: MIMO-OFDM Based
air interface," IEEE Communications Magazine, Vol. 43, No. 1, pp. 53 -60, Jan. 2005.

[11] P. Kumar, “DCT Based OFDM for Underwater Acoustic Communication,” 1st
International Conference on Recent Advances in Information Technology, Dhanbad, 15-
17 March 2012, pp. 170-176.
 
[12] Li Ping, Lihai Liu, Keying Wu, W. Leung, “Interleave Division Multiple
Access,” IEEE Transactions on Wireless Communications, vol. 5, pp. 938-947,
April 2006.

[13] H.Wu, L.Ping and A. Perotti, “User-specific chip- level interleaver design for
IDMA System,” IEEE Electronics Letters, vol.42, Feb 2006.

[14] L. Baosheng, H. Jie, Z. Shengli, K. Ball, M. Stojanovic, L. Freitag and P.

Willett,“MIMO OFDM for High-Rate Un- derwater Acoustic Communications,”
IEEE Journal of Oceanic Engineering, Vol. 34, No. 4, 2009, pp. 634-644.

[15] E. Biglieri, J. Proakis, and S. Shamai, “Fading channels: Information-theoretic

and communications aspects,” IEEE Trans. Inform. Theory, vol. 44, no. 6, pp.
2619–2692, Oct. 1998.
THANK YOU