Fast Code Design for Overloaded Code-Division

Multiplexing Systems
ABSTRACT:
We consider the problem of designing binary antipodal code sequences (signatures)
for overloaded code-division multiplexing (CDM) systems where the number of
concurrent users/signals is greater than code length. Our goal is to provide an
overloaded code which can be fast constructed, fast decoded, and more
importantly, can provide satisfactory recovery performance in conjunction with
decoder design specifics. We first introduce a fast and practical method for
constructing a code set by operating Kronecker product with two smaller codes.
Under such construction, a fast two-stage maximum-likelihood (ML) detection
scheme can dramatically reduce the computational complexity of ML decoder and
make CDM systems practically implementable. To improve the performance in
terms of biterror- rate (BER), we propose hierarchical criteria for code design
which aims at reducing the cross-correlation of code while maintaining uniquely
decodable (errorless) code property. Simulation studies illustrate that the proposed
code design can provide satisfactory performance with low-complexity two-stage
ML detection.

EXISTING SYSTEM:
In code-division multiplexing (CDM) systems, individual signals/users utilize
distinct codes (also known as signatures) to access a common (in both time and
frequency) communication channel. With rapid development in past decades, CDM
has various commercial usages in both wired/wireless communication systems and
fiber-optic networks. In a synchronous CDM system with K equal power signals/
users and code length L over a common additive white Gaussian noise (AWGN)
k

channel, the received data vector is of the form

r= Abk S k +n
k=1

where A is the

amplitude of received signal, bk {1} is binary antipodal symbol transmitted by

the kth signal/user, sk 1/ 1/ L {+-}L,k=1,2k {1}L, k = 1; 2; : : : ;K, is
normalized binary code of length (processing gain) L, n RL is a zero mean
2
Gaussian random vector with auto covariance matrix IL, IL denotes an LL

identity matrix. For simplicity, we rewrite the received data vector as r = ASb + n
(2) where b = [b1; : : : ; bK]Tis the bit vector of all K signals/ users, S , [s1;
s2; : : : ; sK] is an LK matrix that represents a code set of K normalized codes of
length L. The transmitted bits can be recovered from r by an optimum
maximumlikelihood (ML) decoder or sub-optimal low-complexity linear decoders.

PROPOSED SYSTEM:
In this present work, we consider the problem of designing sets of codes
(signatures) from the binary alphabet for overloaded code-division multiplexing
applications. We aim to design antipodal binary code sets which have great
properties of fast code construction/generation, unique decodability, lower crosscorrelation, low-complexity decoding, and satisfactory bit recovery performance.
We first introduce a method for constructing a code set with large size by operating
Kronecker product on two smaller code sets. Under such construction, a
low-complexity two-stage maximum likelihood (ML) detection scheme can be
utilized to make CDM systems practically implementable. To gain better
performance in terms of biterror- rate (BER), we propose conditional hierarchical
criteria for the design of overloaded binary codes which can guarantee asymptotic
errorless transmission as well as suppress and balance the cross-correlation of
codes. The main contribution of this paper lies in the elaborating of the overloaded
code construction and two-stage detector introduced in [1]-[3] and the developing
of code design by defining the hierarchical criteria.

SOFTWARE IMPLEMENTATION:
Modelsim 6.0
Xilinx 14.2
HARDWARE IMPLEMENTATION:
SPARTAN-III, SPARTAN-VI