Scribd
Upload
49 views11 pages

Ways of Generating Cdma Codes

There are several ways to generate codes for CDMA including Walsh-Hadamard codes, Fourier codes, Pseudo-Noise codes, Gold codes, Binary Barker codes, and Kasami codes. Gold codes can generate numerous families of orthogonal codes from pairs of m-sequences. Kasami codes are derived from a maximum-length sequence and have fewer members than Gold codes but better correlation properties.

Uploaded by

Alango Jr Tz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
49 views11 pages

Ways of Generating Cdma Codes

There are several ways to generate codes for CDMA including Walsh-Hadamard codes, Fourier codes, Pseudo-Noise codes, Gold codes, Binary Barker codes, and Kasami codes. Gold codes can generate numerous families of orthogonal codes from pairs of m-sequences. Kasami codes are derived from a maximum-length sequence and have fewer members than Gold codes but better correlation properties.

Uploaded by

Alango Jr Tz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

WAYS OF GENERATING CDMA CODES

INTRODUCTION

•  

•In
the beginning communication channel used Frequency Division Multiple Access (FDMA) and
Time Division Multiple Access (TDMA) focusing in frequency and time respectively. Then came
Code Division Multiple Access (CDMA) which is a spread-spectrum. CDMA raised on top of other
multi-access communication networks.
Ways of generating CDMA codes

Walsh-Hadamard codes

•They are used for error detection and correction when transmitting message over noisy or an
unreliable channel. They are also used to define individual channels. They are orthogonal codes. They
are simple to generate recursively using the Hadamard matrix generation
Fourier codes
•  
• They are obtained from column of FFT matrix. They are normally orthogonal to each other but non
linear unlike the Hadamard codes. They are defined as:

Cl =  

• In comparison with Hadamard codes, the Fourier code result in an equal or lower peak to average
power ration
•   Pseudo Noise (PN) codes
• these codes normally appear as noise-like structures if the construction is not known at the receiver. It
has a spectrum similar to a random sequence of bits but is deterministically generated. It is generated
by shift register, often used PN sequences are maximum length shift register sequences known as m-
sequences

• Where m = length of the shift register


Gold Code
• For CDMA code multiplex sets of multiple orthogonal (uncorrelated) codes are required. In many
applications the no of m-sequences of the same degree n is too small. Gold codes can be easily generated
from m-sequences and offer numerous families of orthogonal codes of equal code length (sequence length)
L. Gold codes are widely used in spread spectrum and CDMA systems, e.g. for GPS and for UMTS
• Generation of Gold-Codes:

• - 2 m-sequence generators with equal no. of stages

• - simultaneous clocking of generator 1 and generator 2

• - start condition of gen. 1: at least one "1" required in the register (no "all-0-state")

• - start condition of gen. 2: choice of 2n – 1 different start constellations (phases)


Block Diagram:
No. of Gold codes per code family: each phase shift between LFSR 1 and LFSR 2 produces an
individual Gold code of length L = 2n - 1 → both m-sequence generators produce their individual m-
sequence → there are L = 2n - 1 possible phase shifts between 2 n-stage m-sequence generators.

• A Gold code family, composed of 2 preferred m-sequences each of degree n, contains in total 2n + 1
different codes
Binary Barker Codes
• Binary Barker codes offer favorable auto-correlation behavior and ACF properties. Unfortunately,
there is only a very limited number of different Barker codes. Binary Barker codes consist of a finite
number of binary symbols {+1 ; -1}. Barker codes are defined by their (normalized) auto-ccorrelation
function ACF

 
• Application of binary Barker codes: - signal acquisition (detection of binary signal strings in the
presence of noise/interference). Synchronization of data packets or preambles of data sequences.
Spreading of data bits in CDMA/DS systems (e.g. IEEE 802.11 WLAN early standards)
 Kasami Code

•Kasami code families are constructed from a maximum-length-sequence (m-sequence). In contrast to


Gold codes the Kasami code families have less members for a given sequence length L, but offer better side
peak properties in acf and ccf. A Kasami code family is derived from a m-sequence with even degree n and
hence has a sequence length of: L = 2n - 1. This m-sequence will be decimated by a decimation factor d with:
d = 2n/2 + 1. This results in a "support" sequence (s-sequence) with a sequence length of:

• LS = 2n/2 - 1

• In addition to the basic m-sequence the other members of a Kasami code family are constructed by
multiplication of the m-sequence with all LS cyclically shifted versions of the support sequence (s-sequence)
• the number of codes in a (so called "small") Kasami code family - including the basic m-sequence - is:

•M = 2n/2

You might also like