Spectral efficiency improvement of low peak-to-average power ratio complete complementary code division multiple access systems

An investigation into the peak-to-average power ratio (PAPR) performance of cyclic rotation complete complementary code division multiple access (CR-CC-CDMA) has been conducted. Additionally, a novel orthogonal signalling technique, referred to as complementary rotation keying (CRK), has been developed for improving the spectral efficiency (SE) of CC-CDMA whilst maintaining a low PAPR. The CRK system is based on the concept of CR of CC codes in order to allow interoperability with CR-CC-CDMA systems. To this end, both systems employ a similar transmitter and receiver structure. The CR-CC-CDMA technique suffers from increased PAPR as SE per user is increased. The CRK system offers an improvement in SE, while maintaining the PAPR of a CC-CDMA system. The bit error rates of both systems were unaffected in a joint system, indicating complete interoperability. This allows dynamic adjustment of the PAPR and SE of any user in the system, with users being able to switch between both systems without causing multi user interference.Dissertation (MEng)--University of Pretoria, 2018.Electrical, Electronic and Computer EngineeringMEn

Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER

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

Interference-Free Broadband Single- and Multi-Carrier DS-CDMA

The choice of the direct sequence spreading code in DS-CDMA predetermines the properties of the system. This contribution demonstrates that the family of codes exhibiting an interference-free window (IFW) outperforms classic spreading codes, provided that the interfering multi-user and multipath components arrive within this IFW, which may be ensured with the aid of quasi-synchronous adaptive timing advance control. It is demonstrated that the IFW duration may be extended with the advent of multicarrier DS-CDMA proportionately to the number of subcarriers. Hence, the resultant MC DS-CDMA system is capable of exhibiting nearsingle-user performance without employing a multi-user detector. A limitation of the system is that the number of spreading codes exhibiting a certain IFW is limited, although this problem may be mitigated with the aid of novel code design principles

On the Uplink Performance of Asynchronous LAS-CDMA

In this paper closed-form formulae are derived for characterizing the BER performance of Large Area Synchronous CDMA (LAS-CDMA) as a function of both the number of resolvable paths Lp and the maximum delay difference τmax, as well as the number of users K, when communicating over a Nakagami-m fading channel. Moreover, we comparatively studies the performance of LAS-CDMA and the traditional random code based DS-CDMA

Analytical BER Performance of DS-CDMA Ad Hoc Networks using Large Area Synchronized Spreading Codes

The family of operational CDMA systems is interference-limited owing to the Inter Symbol Interference (ISI) and the Multiple Access Interference (MAI) encountered. They are interference-limited, because the orthogonality of the spreading codes is typically destroyed by the frequency-selective fading channel and hence complex multiuser detectors have to be used for mitigating these impairments. By contrast, the family of Large Area Synchronous (LAS) codes exhibits an Interference Free Window (IFW), which renders them attractive for employment in cost-efficient quasi-synchronous ad hoc networks dispensing with power control. In this contribution we investigate the performance of LAS DS-CDMA assisted ad hoc networks in the context of a simple infinite mesh of rectilinear node topology and benchmark it against classic DS-CDMA using both random spreading sequences as well as Walsh-Hadamard and Orthogonal Gold codes. It is demonstrated that LAS DS-CDMA exhibits a significantly better performance than the family of classic DS-CDMA systems operating in a quasi-synchronous scenario associated with a high node density, a low number of resolvable paths and a sufficiently high number of RAKE receiver branches

Analytical Bit Error Rate Performance of DS-CDMA Ad Hoc Networks using Large Area Synchronous Spreading Sequences

The performance of large area synchronous (LAS) direct sequence code division multiple access (DS-CDMA) assisted ad hoc networks is investigated in the context of a single-hop infinite mesh of rectilinearly located ad hoc nodes. It is shown that LAS DS-CDMA exhibits a significantly better performance than the family of traditional spreading sequences used in a quasisynchronous DS-CDMA scenario having a low number of resolvable multipath components and a sufficiently high number of RAKE receiver branches. The benefits of LAS codes in ad hoc networks are multifold: (i) Their performance is noise-limited, rather than interference-limited, provided that the multipath and multi-user interference arrives within their interference free window. (ii) Under the same conditions LAS codes are robust against the ‘near–far’ effects imposed by ad hoc networks operating without base-station-aided power control, without accurate synchronisation and without implementationally complex interference cancellers

An intelligent genetic algorithm for PAPR reduction in a multi-carrier CDMA wireless system

Abstract— A novel intelligent genetic algorithm (GA), called Minimum Distance guided GA (MDGA) is proposed for peak-average-power ratio (PAPR) reduction based on partial transmit sequence (PTS) scheme in a synchronous Multi-Carrier Code Division Multiple Access (MC-CDMA) system. In contrast to traditional GA, our MDGA starts with a balanced ratio of exploration and exploitation which is maintained throughout the process. It introduces a novel replacement strategy which increases significantly the convergence rate and reduce dramatically computational complexity as compared to the conventional GA. The simulation results demonstrate that, if compared to the PAPR reduction schemes using exhaustive search and traditional GA, our scheme achieves 99.52% and 50+% reduction in computational complexity respectively