A Method to Partially Suppress IS1 and MA1 for DS SS CDMA Wireless Networks

We propose a method to partially suppress ISI and MAI for US SS CDMA schemes in wireless LANs. The method can be regarded as an alternative approach to combat ISI and in particular MAI by the use of advanced multiuser detection. Instead of using very sophisticated detectors, we propose introduction of a simple modification to the carrier waveform which results in very substaiitial reduction in cross-correlation belween users and an off-peak auto-correlation. The method can be applied to any DS SS CDMA scheme, but should be particularly useful in the case of short spreading signatures, as is the case of WLAN

Closed-Form Derivations of ISI and MUI for Time-Reversed Ultra Wideband

Through transmitter pre-filtering, a time reversed UWB system is capable if harnessing a multipath channel to achieve temporal and spatial focusing. Unfortunately, large RMS channel delay spread leads to significant intersymbol and multiuser interference. This paper presents closed-form expressions for self and multi-user interference for a UWB system utilizing a time-reversed approach. The influence of user multiplexing codes is taken to account through incorporation of a ‘separation probability’, which characterizes a family of hopping sequences. The standardized IEEE 802.15.3a channel model is applied, and the derived performances are compared with that of a simulated time hopped time-reversed UWB system

Performance of convolutional interleavers with different spacing parameters in turbo codes

This paper considers application of a convolutional interleaver and the issue of infuence of the space parameter in the turbo code performance. Similarly to previously considered convolutional interleavers, the new interleavers are designed as block interleavers and their performance in different code structures is compared with the interleaver having higher periods and space value of 1. In each comparison, the number of inserted stuff bits at the end of each data block is considered to be of similar order. Finally, suitable modification to the new interleavers is proposed improving performance for the codes with lower number of stuff bits

Asterism decoding for Turbo coded MIMO systems

The area of Multiple Input Multiple Output (MIMO) communications systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using multiple transmit and receive antennas. MIMO combined with an Turbo coding has been shown as a promising way to achieve near capacity for wireless channels. Where previously described decoders provide linear decoding where the number of receive antennas is at least equal to the number of transmit antennas, are computationally burdensome when nt \u3e nr. Asterism decoding is a scheme that achieved ML performance for MIMO systems for any number of receive antennas. By applying Asterism decoding to Turbo coded MIMO systems we show that good performance can be achieved for nt \u3e nr without the need of additional feedback into the MIMO decoding stage

On The Performance of Turbo Codes With Convolutional Interleavers

In this paper, some issues governing the block-wise performance of convolutional interleavers used in turbo codes are presented. Two different constructions of convolutional interleaver differing by the position of stuff bits in the interleaved data block are considered here. The performance assessment is based on the contribution of each weight to the overall code performance. For the given turbo code and each utilized interleaver, weight contribution is computed to finalize the code behavior in different signal to noise ratios. Simulations have been performed to verify the conducted analysis

On The Performance of Turbo Codes With Convolutional Interleavers

In this paper, some issues governing the block-wise performance of convolutional interleavers used in turbo codes are presented. Two different constructions of convolutional interleaver differing by the position of stuff bits in the interleaved data block are considered here. The performance assessment is based on the contribution of each weight to the overall code performance. For the given turbo code and each utilized interleaver, weight contribution is computed to finalize the code behavior in different signal to noise ratios. Simulations have been performed to verify the conducted analysis

Asterism decoding for Turbo coded MIMO systems

The area of Multiple Input Multiple Output (MIMO) communications systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using multiple transmit and receive antennas. MIMO combined with an Turbo coding has been shown as a promising way to achieve near capacity for wireless channels. Where previously described decoders provide linear decoding where the number of receive antennas is at least equal to the number of transmit antennas, are computationally burdensome when nt \u3e nr. Asterism decoding is a scheme that achieved ML performance for MIMO systems for any number of receive antennas. By applying Asterism decoding to Turbo coded MIMO systems we show that good performance can be achieved for nt \u3e nr without the need of additional feedback into the MIMO decoding stage

Error Performance of the 13-Channel DS CDMA WATM LAN

In the paper, we present simulation results for the 13 channel DS CDMA WATM LAN utilising optimized complex spreading signatures based on Walsh-Rademacher functions. The method to obtain those optimized spreading signatures, as well as the full set of the coefficients giving the minimum level of cross-correlation between any pair of the channels is shown. The resultant system BER and the distribution of errors within encapsulated WATM cells is given. The obtained results indicate that with the application of a hybrid ARQ scheme, capable of correcting 10 errors, the number of WATM cells which would require retransmission is in the order of I-2%

DS CDMA Scheme for WATM with Errors and Erasures Decoding

In the paper, we present simulation results for the 13 channel DS CDMA WATM LAN utilising optimized complex spreading signatures based on Walsh functions. The method to obtain those optimized spreading signatures, as well as the full set of the coefficients giving the minimum level of cross-correlation between any pair of the channels is shown. The resultant system BER as well as the distribution of errors within WATM cells is given. The obtained results indicate that with the application of a hybrid ARQ scheme with errors and erasures decoding, the number of WATM cells which would require retransmission is in the order of 0.46%

Modelling and Comparative Performance Analysis of a Time Reversed UWB System

The effects of multipath propagation lead to a significant decrease in system performance in most of the proposed ultra-wideband communication systems. A time-reversed system utilises the multipath channel impulse response to decrease receiver complexity, through a prefiltering at the transmitter. This paper discusses the modelling and comparative performance of a UWB system utilising time-reversed communications. System equations are presented, together with a semianalytical formulation on the level of intersymbol interference and multiuser interference. The standardised IEEE 802.15.3a channel model is applied, and the estimated error performance is compared through simulation with the performance of both time-hopped time-reversed and RAKE-based UWB systems