507 research outputs found

    Minimum mean-squared error iterative successive parallel arbitrated decision feedback detectors for DS-CDMA systems

    Get PDF
    In this paper we propose minimum mean squared error (MMSE) iterative successive parallel arbitrated decision feedback (DF) receivers for direct sequence code division multiple access (DS-CDMA) systems. We describe the MMSE design criterion for DF multiuser detectors along with successive, parallel and iterative interference cancellation structures. A novel efficient DF structure that employs successive cancellation with parallel arbitrated branches and a near-optimal low complexity user ordering algorithm are presented. The proposed DF receiver structure and the ordering algorithm are then combined with iterative cascaded DF stages for mitigating the deleterious effects of error propagation for convolutionally encoded systems with both Viterbi and turbo decoding as well as for uncoded schemes. We mathematically study the relations between the MMSE achieved by the analyzed DF structures, including the novel scheme, with imperfect and perfect feedback. Simulation results for an uplink scenario assess the new iterative DF detectors against linear receivers and evaluate the effects of error propagation of the new cancellation methods against existing ones

    Packet data communications over coded CDMA with hybrid type-II ARQ

    Get PDF
    This dissertation presents in-depth investigation of turbo-coded CDNIA systems in packet data communication terminology. It is divided into three parts; (1) CDMA with hybrid FEC/ARQ in deterministic environment, (2) CDMA with hybrid FEC/ARQ in random access environment and (3) an implementation issue on turbo decoding. As a preliminary, the performance of CDMA with hybrid FEC/ARQ is investigated in deterministic environment. It highlights the practically achievable spectral efficiency of CDMA system with turbo codes and the effect of code rates on the performance of systems with MF and LMMSE receivers, respectively. For given ensemble distance spectra of punctured turbo codes, an improved union bound is used to evaluate the error probability of ML turbo decoder with MF receiver and with LMMSE receiver front-end and, then, the corresponding spectral efficiency is computed as a function of system load. In the second part, a generalized analytical framework is first provided to analyze hybrid type-11 ARQ in random access environment. When applying hybrid type-11 ARQ, probability of packet success and packet length is generally different from attempt to attempt. Since the conventional analytical model, customarily employed for ALOHA system with pure or hybrid type-I ARQ, cannot be applied for this case, an expanded analytical model is introduced. It can be regarded as a network of queues and Jackson and Burke\u27s theorems can be applied to simplify the analysis. The second part is further divided into two sub topics, i.e. CDMA slotted ALOHA with hybrid type-11 ARQ using packet combining and CDMA unslotted ALOHA with hybrid type-11 ARQ using code combining. For code combining, the rate compatible punctured turbo (RCPT) codes are examined. In the third part, noticing that the decoding delay is crucial to the fast ARQ, a parallel MAP algorithm is proposed to reduce the computational decoding delay of turbo codes. It utilizes the forward and backward variables computed in the previous iteration to provide boundary distributions for each sub-block MAP decoder. It has at least two advantages over the existing parallel scheme; No performance degradation and No additional computation

    Suboptimal maximum-likelihood multiuser detection of synchronous CDMA on frequency-selective multipath channels

    Full text link

    Blind adaptive constrained reduced-rank parameter estimation based on constant modulus design for CDMA interference suppression

    Get PDF
    This paper proposes a multistage decomposition for blind adaptive parameter estimation in the Krylov subspace with the code-constrained constant modulus (CCM) design criterion. Based on constrained optimization of the constant modulus cost function and utilizing the Lanczos algorithm and Arnoldi-like iterations, a multistage decomposition is developed for blind parameter estimation. A family of computationally efficient blind adaptive reduced-rank stochastic gradient (SG) and recursive least squares (RLS) type algorithms along with an automatic rank selection procedure are also devised and evaluated against existing methods. An analysis of the convergence properties of the method is carried out and convergence conditions for the reduced-rank adaptive algorithms are established. Simulation results consider the application of the proposed techniques to the suppression of multiaccess and intersymbol interference in DS-CDMA systems

    Iterative multiuser detection for ultra-wideband systems

    Get PDF
    Master'sMASTER OF ENGINEERIN

    Adaptive DS-CDMA multiuser detection for time variant frequency selective Rayleigh fading channel

    Get PDF
    The current digital wireless mobile system such as IS-95, which is based on direct sequence Code Division Multiple Access (DS-CDMA) technology, will not be able to meet the growing demands for multimedia service due to low information exchanging rate. Its capacity is also limited by multiple accessed interference (MAI) signals. This work focuses on the development of adaptive algorithms for multiuser detection (MUD) and interference suppression for wideband direct sequence code division multiple access (DS-CDMA) systems over time-variant frequency selective fading channels. In addition, channel acquisition and delay estimation techniques are developed to combat the uncertainty introduced by the wireless propagation channel. This work emphasizes fast and simple techniques that can meet practical needs for high data rate signal detection. Most existing literature is not suitable for the large delay spread in wideband systems due to high computational/ hardware complexity. A de-biasing decorrelator is developed whose computational complexity is greatly reduced without sacrificing performance. An adaptive bootstrap symbolbased signal separator is also proposed for a time-variant channel. These detectors achieve MUD for asynchronous, large delay spread, fading channels without training sequences. To achieve high data rate communication, a finite impulse response (FIR) filter based detector is presented for M-ary QAM modulated signals in a multipath Rayleigh fading channel. It is shown that the proposed detector provides a stable performance for QAM signal detection with unknown fading and phase shift. It is also shown that this detector can be easily extended to the reception of any M-ary quadrature modulated signal. A minimum variance decorrelating (MVD) receiver with adaptive channel estimator is presented in this dissertation. It provides comparable performance to a linear MMSE receiver even in a deep fading environment and can be implemented blindly. Using the MVD receiver as a building-block, an adaptive multistage parallel interference cancellation (PIC) scheme and a successive interference cancellation (SIC) scheme were developed. The total number of stages is kept at a minimum as a result of the accurate estimating of the interfering users at the earliest stages, which reduces the implementation complexity, as well as the processing delay. Jointly with the MVD receiver, a new transmit diversity (TD) scheme, called TD-MVD, is proposed. This scheme improves the performance without increasing the bandwidth. Unlike other TD techniques, this TDMVD scheme has the inherent advantage to overcome asynchronous multipath transmission. It brings flexibility in the design of TD antenna systems without restrict signal coordination among those multiple transmissions, and applicable for both existing and next generation of CDMA systems. A maximum likelihood based delay and channel estimation algorithm with reduced computational complexity is proposed. This algorithm uses a diagonal simplicity technique as well as the asymptotically uncorrelated property of the received signal in the frequency domain. In combination with oversampling, this scheme does not suffer from a singularity problem and the performance quickly approaches the Cramer-Rao lower bound (CRLB) while maintaining a computational complexity that is as low as the order of the signal dimension
    corecore