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

Comparative Analysis of Peak Correlation Characteristics of Non-Orthogonal Spreading Codes for Wireless Systems

The performance of a CDMA based wireless system is largely dependent on the characteristics of pseudo-random spreading codes. The spreading codes should be carefully chosen to ensure highest possible peak value of auto-correlation function and lower correlation peaks (side-lobes) at non-zero time-shifts. Simultaneously, zero cross-correlation value at all time shifts is required in order to eliminate the effect of multiple access interference at the receiver. But no such code family exists which possess both characteristics simultaneously. That's why an exhaustive effort has been made in this paper to evaluate the peak correlation characteristics of various non-orthogonal spreading codes and suggest a suitable solution.Comment: 12 Pages, 8 Figures, 3 Table

On the variable capacity property of CC/DS-CDMA systems

A complete complementary code based direct sequence code division multiple access (CC/DS-CDMA) system has been proposed recently as a potential candidate for beyond third generation (B3G) wireless communications. This paper addresses the issues that design of efficient code assignment schemes should be based on a flexible physical layer support, which is extremely important for emerging cross-layer designs in future wireless applications. The study in this paper considers a CC/DS-CDMA system with multiple time slots, three traffic classes and two dynamic code-flock assignment schemes, namely random assignment (RA) and compact assignment (CA). Simulation results show that the CC/DS-CDMA system has variable capacity property (VCP), which is sensitively affected by different code-flock assignment schemes. In general, CA can offer lower blocking probability, whereas RA can offer a larger mean system capacity and higher throughput when offered traffic is heavy

Designing structured tight frames via an alternating projection method

Tight frames, also known as general Welch-bound- equality sequences, generalize orthonormal systems. Numerous applications - including communications, coding, and sparse approximation- require finite-dimensional tight frames that possess additional structural properties. This paper proposes an alternating projection method that is versatile enough to solve a huge class of inverse eigenvalue problems (IEPs), which includes the frame design problem. To apply this method, one needs only to solve a matrix nearness problem that arises naturally from the design specifications. Therefore, it is the fast and easy to develop versions of the algorithm that target new design problems. Alternating projection will often succeed even if algebraic constructions are unavailable. To demonstrate that alternating projection is an effective tool for frame design, the paper studies some important structural properties in detail. First, it addresses the most basic design problem: constructing tight frames with prescribed vector norms. Then, it discusses equiangular tight frames, which are natural dictionaries for sparse approximation. Finally, it examines tight frames whose individual vectors have low peak-to-average-power ratio (PAR), which is a valuable property for code-division multiple-access (CDMA) applications. Numerical experiments show that the proposed algorithm succeeds in each of these three cases. The appendices investigate the convergence properties of the algorithm

On receiver design for low density signature OFDM (LDS-OFDM)

Low density signature orthogonal frequency division multiplexing (LDS-OFDM) is an uplink multi-carrier multiple access scheme that uses low density signatures (LDS) for spreading the symbols in the frequency domain. In this paper, we introduce an effective receiver for the LDS-OFDM scheme. We propose a framework to analyze and design this iterative receiver using extrinsic information transfer (EXIT) charts. Furthermore, a turbo multi-user detector/decoder (MUDD) is proposed for the LDS-OFDM receiver. We show how the turbo MUDD is tuned using EXIT charts analysis. By tuning the turbo-style processing, the turbo MUDD can approach the performance of optimum MUDD with a smaller number of inner iterations. Using the suggested design guidelines in this paper, we show that the proposed structure brings about 2.3 dB performance improvement at a bit error rate (BER) equal to 10-5 over conventional LDS-OFDM while keeping the complexity affordable. Simulations for different scenarios also show that the LDS-OFDM outperforms similar well-known multiple access techniques such as multi-carrier code division multiple access (MC-CDMA) and group-orthogonal MC-CDMA