1,271 research outputs found
Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA
In this paper, we propose a fast decoder algorithm for uniquely decodable
(errorless) code sets for overloaded synchronous optical code-division
multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a
way that the users can uniquely recover the information bits with a very simple
decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML)
decoder, which has a high computational complexity for even moderate code
lengths, the proposed decoder has much lower computational complexity.
Simulation results in terms of bit error rate (BER) demonstrate that the
performance of the proposed decoder for a given BER requires only 1-2 dB higher
signal-to-noise ratio (SNR) than the ML decoder.Comment: arXiv admin note: substantial text overlap with arXiv:1806.0395
Weyl Spreading Sequence Optimizing CDMA
This paper shows an optimal spreading sequence in the Weyl sequence class,
which is similar to the set of the Oppermann sequences for asynchronous CDMA
systems. Sequences in Weyl sequence class have the desired property that the
order of cross-correlation is low. Therefore, sequences in the Weyl sequence
class are expected to minimize the inter-symbol interference. We evaluate the
upper bound of cross-correlation and odd cross-correlation of spreading
sequences in the Weyl sequence class and construct the optimization problem:
minimize the upper bound of the absolute values of cross-correlation and odd
cross-correlation. Since our optimization problem is convex, we can derive the
optimal spreading sequences as the global solution of the problem. We show
their signal to interference plus noise ratio (SINR) in a special case. From
this result, we propose how the initial elements are assigned, that is, how
spreading sequences are assigned to each users. In an asynchronous CDMA system,
we also numerically compare our spreading sequences with other ones, the Gold
codes, the Oppermann sequences, the optimal Chebyshev spreading sequences and
the SP sequences in Bit Error Rate. Our spreading sequence, which yields the
global solution, has the highest performance among the other spreading
sequences tested
- …