Abstract: High Peak to Average Power Ratio (PAPR) of the
transmitted signal is a serious problem in multicarrier systems (MC),
such as Orthogonal Frequency Division Multiplexing (OFDM), or in
Multi-Carrier Code Division Multiple Access (MC-CDMA) systems,
due to large number of subcarriers. This effect is possible reduce with
some PAPR reduction techniques. Spreading sequences at the
presence of Saleh and Rapp models of high power amplifier (HPA)
have big influence on the behavior of system. In this paper we
investigate the bit-error-rate (BER) performance of MC-CDMA
systems. Basically we can see from simulations that the MC-CDMA
system with Iterative algorithm can be providing significantly better
results than the MC-CDMA system. The results of our analyses are
verified via simulation.
Abstract: In the context of spectrum surveillance, a method to
recover the code of spread spectrum signal is presented, whereas the
receiver has no knowledge of the transmitter-s spreading sequence.
The approach is based on a genetic algorithm (GA), which is forced to
model the received signal. Genetic algorithms (GAs) are well known
for their robustness in solving complex optimization problems.
Experimental results show that the method provides a good
estimation, even when the signal power is below the noise power.
Abstract: This paper investigates the problem of spreading
sequence and receiver code synchronization techniques for satellite
based CDMA communications systems. The performance of CDMA
system depends on the autocorrelation and cross-correlation
properties of the used spreading sequences. In this paper we propose
the uses of chaotic Lu system to generate binary sequences for
spreading codes in a direct sequence spread CDMA system. To
minimize multiple access interference (MAI) we propose the use of
genetic algorithm for optimum selection of chaotic spreading
sequences. To solve the problem of transmitter-receiver
synchronization, we use the passivity controls. The concept of
semipassivity is defined to find simple conditions which ensure
boundedness of the solutions of coupled Lu systems. Numerical
results are presented to show the effectiveness of the proposed
approach.
Abstract: Different pseudo-random or pseudo-noise (PN) as well as orthogonal sequences that can be used as spreading codes for code division multiple access (CDMA) cellular networks or can be used for encrypting speech signals to reduce the residual intelligence are investigated. We briefly review the theoretical background for direct sequence CDMA systems and describe the main characteristics of the maximal length, Gold, Barker, and Kasami sequences. We also discuss about variable- and fixed-length orthogonal codes like Walsh- Hadamard codes. The equivalence of PN and orthogonal codes are also derived. Finally, a new PN sequence is proposed which is shown to have certain better properties than the existing codes.
Abstract: In the context of spectrum surveillance, a new method
to recover the code of spread spectrum signal is presented, while the
receiver has no knowledge of the transmitter-s spreading sequence. In
our previous paper, we used Genetic algorithm (GA), to recover
spreading code. Although genetic algorithms (GAs) are well known
for their robustness in solving complex optimization problems, but
nonetheless, by increasing the length of the code, we will often lead
to an unacceptable slow convergence speed. To solve this problem we
introduce Particle Swarm Optimization (PSO) into code estimation in
spread spectrum communication system. In searching process for
code estimation, the PSO algorithm has the merits of rapid
convergence to the global optimum, without being trapped in local
suboptimum, and good robustness to noise. In this paper we describe
how to implement PSO as a component of a searching algorithm in
code estimation. Swarm intelligence boasts a number of advantages
due to the use of mobile agents. Some of them are: Scalability, Fault
tolerance, Adaptation, Speed, Modularity, Autonomy, and
Parallelism. These properties make swarm intelligence very attractive
for spread spectrum code estimation. They also make swarm
intelligence suitable for a variety of other kinds of channels. Our
results compare between swarm-based algorithms and Genetic
algorithms, and also show PSO algorithm performance in code
estimation process.
Abstract: The study in this paper underlines the importance of
correct joint selection of the spreading codes for uplink of multicarrier
code division multiple access (MC-CDMA) at the transmitter
side and detector at the receiver side in the presence of nonlinear
distortion due to high power amplifier (HPA). The bit error rate
(BER) of system for different spreading sequences (Walsh code, Gold
code, orthogonal Gold code, Golay code and Zadoff-Chu code) and
different kinds of receivers (minimum mean-square error receiver
(MMSE-MUD) and microstatistic multi-user receiver (MSF-MUD))
is compared by means of simulations for MC-CDMA transmission
system. Finally, the results of analysis will show, that the application
of MSF-MUD in combination with Golay codes can outperform
significantly the other tested spreading codes and receivers for all
mostly used models of HPA.