A Unified Exact BER Performance Analysis of Asynchronous DS-CDMA Systems Using BPSK Modulation over Fading Channels

Abstract—An asynchronous binary DS-CDMA system using random spreading sequences is considered when communicating over various fading channels. New closed-form expressions are derived for the conditional Characteristic Function (CF) of the multiple access interference. A unified analysis is provided for calculating the exact average Bit Error Rate (BER) expressed in the form of a single numerical integration based on the CF approach. The numerical results obtained from our exact BER analysis are verified by our simulation results and are also compared to those obtained by the Standard Gaussian Approximation (SGA), confirming the accuracy of the SGA for most practical conditions, except for high Signal-to-Noise Ratios (SNR) and for a low number of interferers. Index Terms—BER analysis, CDMA, fading, Rayleigh, Ricean, Hoyt, Nakagami-m, random spreading sequence

Exact BER Calculation of Asynchronous DS-CDMA Systems Communicating over Hoyt Channels

An asynchronous binary DS-CDMA system using random spreading sequences is considered in flat Hoyt fading channels. A new closed-form expression is derived for the conditional characteristic function of the multiple access interference. The exact average BER is expressed as a single numerical integration based on the characteristic function approach. The numerical results obtained from our exact BER analysis are verified by our simulation results and also compared to those obtained by the standard Gaussian approximation

Accurate BER Analysis of QPSK Modulated Asynchronous DS-CDMA Systems Communicating over Rayleigh Channels

The accurate average BER calculation of an asynchronous DS-CDMA system using random spreading sequences is studied in Rayleigh fading channels. An accurate closed-form expression is derived for the conditional characteristic function of the multiple access interference. An accurate BER expression is provided, which only requires a single numerical integration. Our numerical simulation results verify its accuracy, and also demonstrate the relative inaccuracy of the Gaussian approximation

General Model for Infrastructure Multi-channel Wireless LANs

In this paper we develop an integrated model for request mechanism and data transmission in multi-channel wireless local area networks. We calculated the performance parameters for single and multi-channel wireless networks when the channel is noisy. The proposed model is general it can be applied to different wireless networks such as IEEE802.11x, IEEE802.16, CDMA operated networks and Hiperlan\2.Comment: 11 Pages, IJCN

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

Generalized Adaptive Network Coding Aided Successive Relaying Based Noncoherent Cooperation

A generalized adaptive network coding (GANC) scheme is conceived for a multi-user, multi-relay scenario, where the multiple users transmit independent information streams to a common destination with the aid of multiple relays. The proposed GANC scheme is developed from adaptive network coded cooperation (ANCC), which aims for a high flexibility in order to: 1) allow arbitrary channel coding schemes to serve as the cross-layer network coding regime; 2) provide any arbitrary trade-off between the throughput and reliability by adjusting the ratio of the source nodes and the cooperating relay nodes. Furthermore, we incorporate the proposed GANC scheme in a novel successive relaying aided network (SRAN) in order to recover the typical 50% half-duplex relaying-induced throughput loss. However, it is unrealistic to expect that in addition to carrying out all the relaying functions, the relays could additionally estimate the source-to-relay channels. Hence noncoherent detection is employed in order to obviate the power-hungry channel estimation. Finally, we intrinsically amalgamate our GANC scheme with the joint network-channel coding (JNCC) concept into a powerful three-stage concatenated architecture relying on iterative detection, which is specifically designed for the destination node (DN). The proposed scheme is also capable of adapting to rapidly time-varying network topologies, while relying on energy-efficient detection

Interference in Poisson Networks with Isotropically Distributed Nodes

Practical wireless networks are finite, and hence non-stationary with nodes typically non-homo-geneously deployed over the area. This leads to a location-dependent performance and to boundary effects which are both often neglected in network modeling. In this work, interference in networks with nodes distributed according to an isotropic but not necessarily stationary Poisson point process (PPP) are studied. The resulting link performance is precisely characterized as a function of (i) an arbitrary receiver location and of (ii) an arbitrary isotropic shape of the spatial distribution. Closed-form expressions for the first moment and the Laplace transform of the interference are derived for the path loss exponents $\alpha=2$ and $\alpha=4$, and simple bounds are derived for other cases. The developed model is applied to practical problems in network analysis: for instance, the accuracy loss due to neglecting border effects is shown to be undesirably high within transition regions of certain deployment scenarios. Using a throughput metric not relying on the stationarity of the spatial node distribution, the spatial throughput locally around a given node is characterized.Comment: This work was presented in part at ISIT 201